./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/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_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/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-635dfa2 [2018-12-01 21:50:49,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 21:50:49,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 21:50:49,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 21:50:49,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 21:50:49,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 21:50:49,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 21:50:49,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 21:50:49,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 21:50:49,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 21:50:49,211 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 21:50:49,211 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 21:50:49,212 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 21:50:49,212 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 21:50:49,213 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 21:50:49,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 21:50:49,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 21:50:49,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 21:50:49,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 21:50:49,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 21:50:49,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 21:50:49,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 21:50:49,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 21:50:49,219 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 21:50:49,219 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 21:50:49,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 21:50:49,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 21:50:49,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 21:50:49,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 21:50:49,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 21:50:49,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 21:50:49,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 21:50:49,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 21:50:49,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 21:50:49,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 21:50:49,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 21:50:49,224 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 21:50:49,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 21:50:49,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 21:50:49,233 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 21:50:49,233 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 21:50:49,233 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 21:50:49,234 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 21:50:49,234 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 21:50:49,234 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 21:50:49,234 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 21:50:49,234 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 21:50:49,234 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 21:50:49,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 21:50:49,234 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 21:50:49,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 21:50:49,235 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 21:50:49,235 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 21:50:49,235 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 21:50:49,235 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 21:50:49,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 21:50:49,235 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 21:50:49,235 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 21:50:49,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 21:50:49,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 21:50:49,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 21:50:49,235 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 21:50:49,235 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 21:50:49,235 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 21:50:49,236 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 21:50:49,236 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 21:50:49,236 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_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/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-12-01 21:50:49,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 21:50:49,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 21:50:49,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 21:50:49,267 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 21:50:49,267 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 21:50:49,268 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-12-01 21:50:49,308 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/data/1939a10be/b280d36794f547109cbebf51e2bb058e/FLAGbe180910c [2018-12-01 21:50:49,745 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 21:50:49,745 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-12-01 21:50:49,748 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/data/1939a10be/b280d36794f547109cbebf51e2bb058e/FLAGbe180910c [2018-12-01 21:50:49,756 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/data/1939a10be/b280d36794f547109cbebf51e2bb058e [2018-12-01 21:50:49,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 21:50:49,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 21:50:49,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 21:50:49,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 21:50:49,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 21:50:49,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 09:50:49" (1/1) ... [2018-12-01 21:50:49,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5663953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49, skipping insertion in model container [2018-12-01 21:50:49,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 09:50:49" (1/1) ... [2018-12-01 21:50:49,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 21:50:49,776 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 21:50:49,857 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 21:50:49,859 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 21:50:49,868 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 21:50:49,876 INFO L195 MainTranslator]: Completed translation [2018-12-01 21:50:49,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49 WrapperNode [2018-12-01 21:50:49,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 21:50:49,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 21:50:49,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 21:50:49,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 21:50:49,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49" (1/1) ... [2018-12-01 21:50:49,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49" (1/1) ... [2018-12-01 21:50:49,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 21:50:49,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 21:50:49,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 21:50:49,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 21:50:49,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49" (1/1) ... [2018-12-01 21:50:49,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49" (1/1) ... [2018-12-01 21:50:49,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49" (1/1) ... [2018-12-01 21:50:49,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49" (1/1) ... [2018-12-01 21:50:49,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49" (1/1) ... [2018-12-01 21:50:49,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49" (1/1) ... [2018-12-01 21:50:49,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49" (1/1) ... [2018-12-01 21:50:49,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 21:50:49,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 21:50:49,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 21:50:49,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 21:50:49,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 21:50:49,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 21:50:50,048 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 21:50:50,048 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-01 21:50:50,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:50:50 BoogieIcfgContainer [2018-12-01 21:50:50,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 21:50:50,049 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 21:50:50,049 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 21:50:50,051 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 21:50:50,051 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 21:50:50,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 09:50:49" (1/3) ... [2018-12-01 21:50:50,052 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@761185ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 09:50:50, skipping insertion in model container [2018-12-01 21:50:50,053 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 21:50:50,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:50:49" (2/3) ... [2018-12-01 21:50:50,053 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@761185ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 09:50:50, skipping insertion in model container [2018-12-01 21:50:50,053 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 21:50:50,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:50:50" (3/3) ... [2018-12-01 21:50:50,055 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-12-01 21:50:50,090 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 21:50:50,090 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 21:50:50,090 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 21:50:50,091 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 21:50:50,091 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 21:50:50,091 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 21:50:50,091 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 21:50:50,091 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 21:50:50,091 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 21:50:50,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-01 21:50:50,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 21:50:50,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 21:50:50,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 21:50:50,116 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 21:50:50,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 21:50:50,116 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 21:50:50,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-01 21:50:50,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 21:50:50,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 21:50:50,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 21:50:50,117 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 21:50:50,117 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 21:50:50,122 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue 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; 4#L21true assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 5#L23-2true [2018-12-01 21:50:50,122 INFO L796 eck$LassoCheckResult]: Loop: 5#L23-2true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 8#L25-2true assume !(main_~j~0 < main_~m~0); 7#L25-3true main_~i~0 := 1 + main_~i~0; 5#L23-2true [2018-12-01 21:50:50,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:50,126 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2018-12-01 21:50:50,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:50,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:50,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:50,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:50,188 INFO L82 PathProgramCache]: Analyzing trace with hash 42943, now seen corresponding path program 1 times [2018-12-01 21:50:50,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:50,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:50,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:50,195 INFO L82 PathProgramCache]: Analyzing trace with hash 29684988, now seen corresponding path program 1 times [2018-12-01 21:50:50,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:50,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:50,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:50,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,234 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:50,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:50,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:50,235 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:50,235 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 21:50:50,235 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,235 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:50,235 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:50,235 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration1_Loop [2018-12-01 21:50:50,235 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:50,236 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:50,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,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-12-01 21:50:50,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,326 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:50,326 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,336 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:50,336 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:50,354 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:50,354 INFO L448 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_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:50,357 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:50,372 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:50,373 INFO L448 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_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:50,375 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 21:50:50,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:50,484 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 21:50:50,485 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:50,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:50,486 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:50,486 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:50,486 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 21:50:50,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:50,486 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:50,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration1_Loop [2018-12-01 21:50:50,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:50,486 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:50,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-12-01 21:50:50,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,534 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:50,537 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 21:50:50,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:50,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:50,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:50,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:50,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:50,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 21:50:50,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 21:50:50,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:50:50,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:50,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:50,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:50,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:50,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:50,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 21:50:50,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 21:50:50,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:50:50,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:50,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:50,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:50:50,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:50,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:50,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:50,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:50:50,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:50:50,565 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 21:50:50,570 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 21:50:50,570 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 21:50:50,572 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 21:50:50,572 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 21:50:50,572 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 21:50:50,572 INFO L520 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-12-01 21:50:50,573 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 21:50:50,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:50,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:50,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:50:50,627 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-12-01 21:50:50,627 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2018-12-01 21:50:50,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 42 states and 62 transitions. Complement of second has 8 states. [2018-12-01 21:50:50,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 21:50:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 21:50:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-12-01 21:50:50,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 3 letters. [2018-12-01 21:50:50,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:50,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-01 21:50:50,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:50,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-01 21:50:50,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:50,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2018-12-01 21:50:50,666 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 21:50:50,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 14 states and 21 transitions. [2018-12-01 21:50:50,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 21:50:50,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 21:50:50,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2018-12-01 21:50:50,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 21:50:50,669 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2018-12-01 21:50:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2018-12-01 21:50:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-01 21:50:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-01 21:50:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-12-01 21:50:50,685 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2018-12-01 21:50:50,685 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2018-12-01 21:50:50,685 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 21:50:50,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2018-12-01 21:50:50,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 21:50:50,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 21:50:50,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 21:50:50,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 21:50:50,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-01 21:50:50,686 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY 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; 98#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 99#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 104#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 96#L28-2 [2018-12-01 21:50:50,686 INFO L796 eck$LassoCheckResult]: Loop: 96#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 96#L28-2 [2018-12-01 21:50:50,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:50,686 INFO L82 PathProgramCache]: Analyzing trace with hash 957581, now seen corresponding path program 1 times [2018-12-01 21:50:50,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:50,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:50,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:50,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:50,697 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times [2018-12-01 21:50:50,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:50,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:50,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:50,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:50,702 INFO L82 PathProgramCache]: Analyzing trace with hash 29685042, now seen corresponding path program 1 times [2018-12-01 21:50:50,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:50,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:50,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:50,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:50,721 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:50,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:50,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:50,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:50,721 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 21:50:50,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:50,722 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:50,722 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2018-12-01 21:50:50,722 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:50,722 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:50,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,758 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:50,758 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,760 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:50,760 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:50,774 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:50,774 INFO L448 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_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:50,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:50,792 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:50,792 INFO L448 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_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:50,794 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 21:50:50,810 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:50,916 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 21:50:50,918 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:50,918 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:50,918 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:50,918 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:50,918 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 21:50:50,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:50,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:50,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:50,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2018-12-01 21:50:50,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:50,918 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:50,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:50,950 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:50,950 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 21:50:50,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:50,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:50,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:50,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:50,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:50,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 21:50:50,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 21:50:50,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:50:50,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:50,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:50,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:50,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:50,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:50,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 21:50:50,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 21:50:50,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:50:50,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:50,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:50,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:50:50,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:50,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:50,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:50,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:50:50,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:50:50,963 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 21:50:50,966 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 21:50:50,966 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 21:50:50,966 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 21:50:50,966 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 21:50:50,967 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 21:50:50,967 INFO L520 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-12-01 21:50:50,967 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 21:50:50,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:50,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:50,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:50:50,990 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-12-01 21:50:50,990 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10 Second operand 2 states. [2018-12-01 21:50:51,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10. Second operand 2 states. Result 27 states and 43 transitions. Complement of second has 6 states. [2018-12-01 21:50:51,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 21:50:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-12-01 21:50:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-12-01 21:50:51,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 1 letters. [2018-12-01 21:50:51,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:51,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 1 letters. [2018-12-01 21:50:51,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:51,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-01 21:50:51,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:51,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 43 transitions. [2018-12-01 21:50:51,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 21:50:51,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 27 transitions. [2018-12-01 21:50:51,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-01 21:50:51,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-01 21:50:51,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 27 transitions. [2018-12-01 21:50:51,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 21:50:51,003 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2018-12-01 21:50:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 27 transitions. [2018-12-01 21:50:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-01 21:50:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-01 21:50:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2018-12-01 21:50:51,004 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2018-12-01 21:50:51,004 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2018-12-01 21:50:51,004 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 21:50:51,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2018-12-01 21:50:51,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 21:50:51,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 21:50:51,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 21:50:51,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 21:50:51,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 21:50:51,006 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY 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; 181#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 182#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 180#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 188#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 175#L28-3 main_~i~0 := main_~k~0; 186#L25-2 [2018-12-01 21:50:51,006 INFO L796 eck$LassoCheckResult]: Loop: 186#L25-2 assume !(main_~j~0 < main_~m~0); 187#L25-3 main_~i~0 := 1 + main_~i~0; 189#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 186#L25-2 [2018-12-01 21:50:51,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash 920236275, now seen corresponding path program 1 times [2018-12-01 21:50:51,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:51,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:51,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:51,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,013 INFO L82 PathProgramCache]: Analyzing trace with hash 50233, now seen corresponding path program 2 times [2018-12-01 21:50:51,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:51,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:51,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:51,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,017 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 1 times [2018-12-01 21:50:51,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:51,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:51,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:50:51,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,036 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:51,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:51,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:51,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:51,037 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 21:50:51,037 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:51,037 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:51,037 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:51,037 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2018-12-01 21:50:51,037 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:51,037 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:51,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:51,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:51,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:51,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:51,074 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:51,075 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:51,076 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:51,076 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:51,100 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:51,100 INFO L448 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_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:51,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:51,103 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:51,105 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:51,105 INFO L448 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_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:51,120 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:51,120 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:51,145 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:51,145 INFO L448 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_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:51,148 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:51,148 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:51,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 21:50:51,165 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:51,511 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 21:50:51,512 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:51,512 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:51,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:51,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:51,512 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 21:50:51,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:51,513 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:51,513 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:51,513 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2018-12-01 21:50:51,513 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:51,513 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:51,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:51,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-12-01 21:50:51,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-12-01 21:50:51,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-12-01 21:50:51,558 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:51,558 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 21:50:51,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:51,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:51,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:50:51,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:51,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:51,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:51,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:50:51,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:50:51,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:50:51,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:51,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:51,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:51,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:51,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:51,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 21:50:51,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 21:50:51,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:50:51,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:51,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:51,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:50:51,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:51,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:51,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:51,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:50:51,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:50:51,568 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 21:50:51,570 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 21:50:51,570 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 21:50:51,570 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 21:50:51,570 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 21:50:51,570 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 21:50:51,570 INFO L520 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-12-01 21:50:51,571 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 21:50:51,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:51,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:51,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:50:51,603 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-12-01 21:50:51,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-12-01 21:50:51,617 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 31 states and 51 transitions. Complement of second has 8 states. [2018-12-01 21:50:51,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 21:50:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 21:50:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-12-01 21:50:51,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-01 21:50:51,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:51,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-01 21:50:51,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:51,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-01 21:50:51,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:51,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 51 transitions. [2018-12-01 21:50:51,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 21:50:51,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 34 transitions. [2018-12-01 21:50:51,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-01 21:50:51,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-01 21:50:51,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 34 transitions. [2018-12-01 21:50:51,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 21:50:51,621 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 34 transitions. [2018-12-01 21:50:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 34 transitions. [2018-12-01 21:50:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-01 21:50:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-01 21:50:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-12-01 21:50:51,622 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-12-01 21:50:51,622 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-12-01 21:50:51,622 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 21:50:51,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2018-12-01 21:50:51,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 21:50:51,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 21:50:51,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 21:50:51,623 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-12-01 21:50:51,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-01 21:50:51,624 INFO L794 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY 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; 277#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 278#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 288#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 287#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 276#L28-3 main_~i~0 := main_~k~0; 286#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 273#L28-2 [2018-12-01 21:50:51,624 INFO L796 eck$LassoCheckResult]: Loop: 273#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 273#L28-2 [2018-12-01 21:50:51,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 2 times [2018-12-01 21:50:51,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:51,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:51,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:51,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,632 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times [2018-12-01 21:50:51,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:51,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:51,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:50:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,635 INFO L82 PathProgramCache]: Analyzing trace with hash -416201988, now seen corresponding path program 1 times [2018-12-01 21:50:51,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:51,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:51,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:50:51,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:50:51,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 21:50:51,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 21:50:51,671 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:51,672 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:51,672 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:51,672 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:51,672 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 21:50:51,672 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:51,672 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:51,672 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:51,672 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2018-12-01 21:50:51,672 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:51,673 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:51,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:51,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:51,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:51,704 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:51,704 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:51,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:51,706 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:51,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 21:50:51,722 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:51,831 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 21:50:51,832 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:51,832 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:51,832 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:51,832 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:51,832 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 21:50:51,832 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:51,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:51,832 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:51,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2018-12-01 21:50:51,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:51,833 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:51,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:51,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:51,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:51,870 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:51,870 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 21:50:51,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:51,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:51,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:50:51,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:51,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:51,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:51,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:50:51,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:50:51,873 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 21:50:51,874 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 21:50:51,874 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 21:50:51,875 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 21:50:51,875 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 21:50:51,875 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 21:50:51,875 INFO L520 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-12-01 21:50:51,875 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 21:50:51,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:51,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:51,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:50:51,892 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-12-01 21:50:51,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2018-12-01 21:50:51,899 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 25 states and 38 transitions. Complement of second has 5 states. [2018-12-01 21:50:51,899 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-12-01 21:50:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-12-01 21:50:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-12-01 21:50:51,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2018-12-01 21:50:51,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:51,899 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 21:50:51,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:51,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:51,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:50:51,921 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-12-01 21:50:51,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2018-12-01 21:50:51,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 25 states and 38 transitions. Complement of second has 5 states. [2018-12-01 21:50:51,927 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-12-01 21:50:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-12-01 21:50:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-12-01 21:50:51,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2018-12-01 21:50:51,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:51,927 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 21:50:51,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:51,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:51,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:50:51,941 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 1 loop predicates [2018-12-01 21:50:51,941 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2018-12-01 21:50:51,948 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 36 states and 60 transitions. Complement of second has 5 states. [2018-12-01 21:50:51,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 21:50:51,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-12-01 21:50:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-12-01 21:50:51,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 1 letters. [2018-12-01 21:50:51,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:51,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 8 letters. Loop has 1 letters. [2018-12-01 21:50:51,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:51,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-01 21:50:51,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:51,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 60 transitions. [2018-12-01 21:50:51,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 21:50:51,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 22 states and 33 transitions. [2018-12-01 21:50:51,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-01 21:50:51,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-01 21:50:51,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2018-12-01 21:50:51,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 21:50:51,952 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2018-12-01 21:50:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2018-12-01 21:50:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-01 21:50:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-01 21:50:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-12-01 21:50:51,954 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-01 21:50:51,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 21:50:51,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 21:50:51,956 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 4 states. [2018-12-01 21:50:51,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 21:50:51,976 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2018-12-01 21:50:51,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 21:50:51,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-12-01 21:50:51,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 21:50:51,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2018-12-01 21:50:51,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-01 21:50:51,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-01 21:50:51,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-12-01 21:50:51,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 21:50:51,978 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-12-01 21:50:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-12-01 21:50:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-01 21:50:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-01 21:50:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-12-01 21:50:51,979 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-12-01 21:50:51,979 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-12-01 21:50:51,979 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 21:50:51,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2018-12-01 21:50:51,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 21:50:51,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 21:50:51,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 21:50:51,980 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-12-01 21:50:51,980 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 21:50:51,981 INFO L794 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY 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; 533#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 534#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 540#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 539#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 528#L28-3 main_~i~0 := main_~k~0; 538#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 525#L28-2 [2018-12-01 21:50:51,981 INFO L796 eck$LassoCheckResult]: Loop: 525#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 526#L28-3 main_~i~0 := main_~k~0; 530#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 525#L28-2 [2018-12-01 21:50:51,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 3 times [2018-12-01 21:50:51,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:51,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:51,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:51,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash 58767, now seen corresponding path program 1 times [2018-12-01 21:50:51,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:51,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:50:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:51,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash -538152755, now seen corresponding path program 4 times [2018-12-01 21:50:51,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:51,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,015 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:52,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:52,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:52,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:52,015 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 21:50:52,015 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:52,015 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:52,015 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:52,016 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2018-12-01 21:50:52,016 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:52,016 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:52,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,059 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:52,059 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:52,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:52,061 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:52,064 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:52,064 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=1, ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~N~0=-7} Honda state: {ULTIMATE.start_main_~k~0=1, ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~N~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/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-12-01 21:50:52,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:52,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:52,094 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:52,095 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/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-12-01 21:50:52,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:52,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:52,112 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:52,112 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/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-12-01 21:50:52,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:52,115 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/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-12-01 21:50:52,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 21:50:52,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:52,248 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 21:50:52,250 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:52,250 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:52,250 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:52,250 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:52,250 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 21:50:52,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:52,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:52,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:52,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2018-12-01 21:50:52,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:52,251 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:52,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,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-12-01 21:50:52,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,291 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:52,291 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 21:50:52,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:52,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:52,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:52,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:52,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:52,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 21:50:52,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 21:50:52,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:50:52,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:52,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:52,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:52,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:52,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:52,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 21:50:52,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 21:50:52,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:50:52,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:52,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:52,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:50:52,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:52,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:52,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:52,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:50:52,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:50:52,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:50:52,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:52,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:52,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:50:52,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:52,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:52,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:52,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:50:52,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:50:52,300 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 21:50:52,301 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 21:50:52,301 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 21:50:52,301 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 21:50:52,302 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 21:50:52,302 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 21:50:52,302 INFO L520 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-12-01 21:50:52,302 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 21:50:52,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:52,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:52,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:50:52,317 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-12-01 21:50:52,317 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-01 21:50:52,322 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 37 states and 48 transitions. Complement of second has 5 states. [2018-12-01 21:50:52,323 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-12-01 21:50:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 21:50:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-01 21:50:52,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-01 21:50:52,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:52,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-01 21:50:52,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:52,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-01 21:50:52,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:52,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2018-12-01 21:50:52,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 21:50:52,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 44 transitions. [2018-12-01 21:50:52,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-01 21:50:52,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-01 21:50:52,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2018-12-01 21:50:52,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 21:50:52,324 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-01 21:50:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2018-12-01 21:50:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-12-01 21:50:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-01 21:50:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-12-01 21:50:52,326 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-01 21:50:52,326 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-01 21:50:52,326 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 21:50:52,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2018-12-01 21:50:52,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 21:50:52,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 21:50:52,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 21:50:52,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2018-12-01 21:50:52,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 21:50:52,327 INFO L794 eck$LassoCheckResult]: Stem: 640#ULTIMATE.startENTRY 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; 635#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 636#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 637#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 651#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 647#L28-3 main_~i~0 := main_~k~0; 648#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 649#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 650#L28-3 main_~i~0 := main_~k~0; 655#L25-2 assume !(main_~j~0 < main_~m~0); 641#L25-3 [2018-12-01 21:50:52,327 INFO L796 eck$LassoCheckResult]: Loop: 641#L25-3 main_~i~0 := 1 + main_~i~0; 642#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 653#L25-2 assume !(main_~j~0 < main_~m~0); 641#L25-3 [2018-12-01 21:50:52,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash -538152757, now seen corresponding path program 1 times [2018-12-01 21:50:52,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:52,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:50:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:52,334 INFO L82 PathProgramCache]: Analyzing trace with hash 67693, now seen corresponding path program 3 times [2018-12-01 21:50:52,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:52,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:52,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1004170083, now seen corresponding path program 2 times [2018-12-01 21:50:52,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:52,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:50:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 21:50:52,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 21:50:52,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 21:50:52,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 21:50:52,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 21:50:52,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 21:50:52,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 21:50:52,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 21:50:52,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-01 21:50:52,410 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:52,410 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:52,411 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:52,411 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:52,411 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 21:50:52,411 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:52,411 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:52,411 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:52,411 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2018-12-01 21:50:52,411 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:52,411 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:52,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,447 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:52,447 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:52,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:52,449 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:52,472 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:52,473 INFO L448 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_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:52,476 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:52,476 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:52,490 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:52,491 INFO L448 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_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:52,493 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:52,494 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:52,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 21:50:52,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:52,781 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 21:50:52,783 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:52,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:52,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:52,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:52,783 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 21:50:52,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:52,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:52,783 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:52,783 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2018-12-01 21:50:52,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:52,783 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:52,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,822 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:52,822 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 21:50:52,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:52,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:52,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:50:52,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:52,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:52,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:52,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:50:52,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:50:52,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:50:52,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:52,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:52,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:52,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:52,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:52,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 21:50:52,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 21:50:52,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:50:52,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:50:52,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:50:52,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:50:52,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:50:52,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:50:52,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:50:52,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:50:52,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:50:52,830 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 21:50:52,831 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 21:50:52,831 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 21:50:52,832 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 21:50:52,832 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 21:50:52,832 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 21:50:52,832 INFO L520 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-12-01 21:50:52,832 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 21:50:52,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:52,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:50:52,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:50:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:50:52,859 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-01 21:50:52,859 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-12-01 21:50:52,872 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 65 states and 90 transitions. Complement of second has 7 states. [2018-12-01 21:50:52,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 21:50:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 21:50:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-01 21:50:52,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-01 21:50:52,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:52,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2018-12-01 21:50:52,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:52,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-01 21:50:52,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:50:52,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 90 transitions. [2018-12-01 21:50:52,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 21:50:52,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 50 states and 68 transitions. [2018-12-01 21:50:52,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-01 21:50:52,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-01 21:50:52,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2018-12-01 21:50:52,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 21:50:52,876 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 68 transitions. [2018-12-01 21:50:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2018-12-01 21:50:52,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2018-12-01 21:50:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-01 21:50:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-12-01 21:50:52,879 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-12-01 21:50:52,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 21:50:52,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 21:50:52,879 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 6 states. [2018-12-01 21:50:52,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 21:50:52,895 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-12-01 21:50:52,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 21:50:52,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 49 transitions. [2018-12-01 21:50:52,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 21:50:52,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 49 transitions. [2018-12-01 21:50:52,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-01 21:50:52,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-01 21:50:52,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2018-12-01 21:50:52,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 21:50:52,898 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-01 21:50:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2018-12-01 21:50:52,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-12-01 21:50:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-01 21:50:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-12-01 21:50:52,899 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-12-01 21:50:52,899 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-12-01 21:50:52,899 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 21:50:52,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2018-12-01 21:50:52,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 21:50:52,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 21:50:52,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 21:50:52,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 21:50:52,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 21:50:52,901 INFO L794 eck$LassoCheckResult]: Stem: 909#ULTIMATE.startENTRY 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; 907#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 908#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 916#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 917#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 901#L28-3 main_~i~0 := main_~k~0; 912#L25-2 assume !(main_~j~0 < main_~m~0); 910#L25-3 [2018-12-01 21:50:52,901 INFO L796 eck$LassoCheckResult]: Loop: 910#L25-3 main_~i~0 := 1 + main_~i~0; 902#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 903#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 898#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 899#L28-3 main_~i~0 := main_~k~0; 920#L25-2 assume !(main_~j~0 < main_~m~0); 910#L25-3 [2018-12-01 21:50:52,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:52,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446527, now seen corresponding path program 2 times [2018-12-01 21:50:52,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:52,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:52,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:50:52,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2016730719, now seen corresponding path program 1 times [2018-12-01 21:50:52,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:52,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:52,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:50:52,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:50:52,911 INFO L82 PathProgramCache]: Analyzing trace with hash -504812577, now seen corresponding path program 3 times [2018-12-01 21:50:52,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:50:52,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:50:52,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 21:50:52,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:50:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:50:52,950 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:50:52,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:50:52,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:50:52,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:50:52,950 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 21:50:52,950 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:52,950 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:50:52,950 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:50:52,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2018-12-01 21:50:52,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:50:52,951 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:50:52,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:50:52,991 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:50:52,991 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/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-12-01 21:50:52,993 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:52,993 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:50:52,995 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:50:52,996 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~m~0=1} Honda state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~m~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:53,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:50:53,011 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:50:53,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 21:50:53,029 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:51:05,047 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-12-01 21:51:05,050 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:51:05,050 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:51:05,050 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:51:05,050 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:51:05,050 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 21:51:05,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:51:05,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:51:05,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:51:05,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2018-12-01 21:51:05,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:51:05,050 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:51:05,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,099 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:51:05,099 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 21:51:05,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:51:05,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:51:05,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:51:05,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:51:05,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:51:05,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:51:05,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:51:05,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:51:05,102 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 21:51:05,104 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 21:51:05,104 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 21:51:05,104 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 21:51:05,104 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 21:51:05,105 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 21:51:05,105 INFO L520 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-12-01 21:51:05,105 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 21:51:05,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:05,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:05,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:05,146 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-01 21:51:05,146 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2018-12-01 21:51:05,164 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 6 states. Result 49 states and 69 transitions. Complement of second has 7 states. [2018-12-01 21:51:05,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 21:51:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 21:51:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-01 21:51:05,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-01 21:51:05,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:51:05,165 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 21:51:05,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:05,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:05,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:05,205 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-12-01 21:51:05,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2018-12-01 21:51:05,257 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 6 states. Result 56 states and 79 transitions. Complement of second has 10 states. [2018-12-01 21:51:05,257 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-12-01 21:51:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 21:51:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-12-01 21:51:05,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-01 21:51:05,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:51:05,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2018-12-01 21:51:05,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:51:05,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 12 letters. [2018-12-01 21:51:05,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:51:05,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 79 transitions. [2018-12-01 21:51:05,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 21:51:05,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 43 states and 60 transitions. [2018-12-01 21:51:05,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-01 21:51:05,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-01 21:51:05,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 60 transitions. [2018-12-01 21:51:05,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 21:51:05,260 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 60 transitions. [2018-12-01 21:51:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 60 transitions. [2018-12-01 21:51:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-12-01 21:51:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-01 21:51:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2018-12-01 21:51:05,261 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2018-12-01 21:51:05,262 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2018-12-01 21:51:05,262 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 21:51:05,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 52 transitions. [2018-12-01 21:51:05,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 21:51:05,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 21:51:05,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 21:51:05,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 21:51:05,262 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 21:51:05,262 INFO L794 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY 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; 1158#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 1159#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1174#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1171#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1168#L28-3 main_~i~0 := main_~k~0; 1167#L25-2 assume !(main_~j~0 < main_~m~0); 1161#L25-3 main_~i~0 := 1 + main_~i~0; 1154#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1155#L25-2 [2018-12-01 21:51:05,263 INFO L796 eck$LassoCheckResult]: Loop: 1155#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1150#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1151#L28-3 main_~i~0 := main_~k~0; 1155#L25-2 [2018-12-01 21:51:05,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:05,263 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 4 times [2018-12-01 21:51:05,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:51:05,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:51:05,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:05,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:51:05,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:51:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:51:05,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:05,268 INFO L82 PathProgramCache]: Analyzing trace with hash 51867, now seen corresponding path program 2 times [2018-12-01 21:51:05,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:51:05,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:51:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:05,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:51:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:51:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:51:05,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:05,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1817399595, now seen corresponding path program 5 times [2018-12-01 21:51:05,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 21:51:05,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 21:51:05,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:05,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 21:51:05,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 21:51:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:51:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 21:51:05,288 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:51:05,288 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:51:05,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:51:05,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:51:05,288 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 21:51:05,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:51:05,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:51:05,288 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:51:05,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2018-12-01 21:51:05,288 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:51:05,288 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:51:05,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,322 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:51:05,322 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:51:05,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:51:05,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:51:05,338 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:51:05,338 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:51:05,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:51:05,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:51:05,356 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:51:05,356 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:51:05,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:51:05,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:51:05,362 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 21:51:05,362 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=-7, ULTIMATE.start_main_~i~0=-7, ULTIMATE.start_main_~N~0=-6} Honda state: {ULTIMATE.start_main_~k~0=-7, ULTIMATE.start_main_~i~0=-7, ULTIMATE.start_main_~N~0=-6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:51:05,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 21:51:05,377 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1d26ae8-4ce1-4249-a2e6-71ba490fab37/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:51:05,393 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 21:51:05,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 21:51:05,496 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 21:51:05,497 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 21:51:05,497 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 21:51:05,497 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 21:51:05,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 21:51:05,497 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 21:51:05,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 21:51:05,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 21:51:05,498 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 21:51:05,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2018-12-01 21:51:05,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 21:51:05,498 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 21:51:05,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 21:51:05,538 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 21:51:05,538 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 21:51:05,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:51:05,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:51:05,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:51:05,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:51:05,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:51:05,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 21:51:05,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 21:51:05,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:51:05,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:51:05,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:51:05,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:51:05,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:51:05,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:51:05,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:51:05,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:51:05,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:51:05,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 21:51:05,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 21:51:05,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 21:51:05,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 21:51:05,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 21:51:05,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 21:51:05,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 21:51:05,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 21:51:05,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 21:51:05,544 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 21:51:05,545 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 21:51:05,545 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 21:51:05,545 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 21:51:05,545 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 21:51:05,545 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 21:51:05,545 INFO L520 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-12-01 21:51:05,546 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 21:51:05,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:05,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:05,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:05,570 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-12-01 21:51:05,570 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2018-12-01 21:51:05,574 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 55 states and 81 transitions. Complement of second has 5 states. [2018-12-01 21:51:05,574 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-12-01 21:51:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 21:51:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-12-01 21:51:05,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-01 21:51:05,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:51:05,575 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 21:51:05,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:05,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:05,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:05,593 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-12-01 21:51:05,594 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2018-12-01 21:51:05,602 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 51 states and 75 transitions. Complement of second has 7 states. [2018-12-01 21:51:05,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 21:51:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 21:51:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-01 21:51:05,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-01 21:51:05,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:51:05,603 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 21:51:05,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 21:51:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:05,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 21:51:05,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 21:51:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 21:51:05,637 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-12-01 21:51:05,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2018-12-01 21:51:05,642 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 69 states and 104 transitions. Complement of second has 4 states. [2018-12-01 21:51:05,642 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-12-01 21:51:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 21:51:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-12-01 21:51:05,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-01 21:51:05,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:51:05,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2018-12-01 21:51:05,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:51:05,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-01 21:51:05,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 21:51:05,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 104 transitions. [2018-12-01 21:51:05,644 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 21:51:05,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-12-01 21:51:05,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 21:51:05,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 21:51:05,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 21:51:05,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 21:51:05,645 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 21:51:05,645 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 21:51:05,645 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 21:51:05,645 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 21:51:05,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 21:51:05,645 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 21:51:05,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 21:51:05,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 09:51:05 BoogieIcfgContainer [2018-12-01 21:51:05,651 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 21:51:05,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 21:51:05,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 21:51:05,651 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 21:51:05,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:50:50" (3/4) ... [2018-12-01 21:51:05,654 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 21:51:05,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 21:51:05,655 INFO L168 Benchmark]: Toolchain (without parser) took 15896.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 961.4 MB in the beginning and 906.6 MB in the end (delta: 54.8 MB). Peak memory consumption was 267.1 MB. Max. memory is 11.5 GB. [2018-12-01 21:51:05,655 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 21:51:05,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.70 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 21:51:05,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.41 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 21:51:05,656 INFO L168 Benchmark]: Boogie Preprocessor took 11.30 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 21:51:05,657 INFO L168 Benchmark]: RCFGBuilder took 141.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-01 21:51:05,657 INFO L168 Benchmark]: BuchiAutomizer took 15602.08 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 906.6 MB in the end (delta: 192.4 MB). Peak memory consumption was 285.2 MB. Max. memory is 11.5 GB. [2018-12-01 21:51:05,658 INFO L168 Benchmark]: Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 906.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 21:51:05,660 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 117.70 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.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 18.41 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.30 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 141.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15602.08 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 906.6 MB in the end (delta: 192.4 MB). Peak memory consumption was 285.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 906.6 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 (2 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + n and consists of 5 locations. One deterministic module has affine ranking function m + -1 * j and consists of 3 locations. One deterministic module has affine ranking function n + -1 * i 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 4 locations. One nondeterministic module has affine ranking function m + -1 * j and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.5s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 14.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 49 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 7. Nontrivial modules had stage [5, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 163 SDtfs, 160 SDslu, 63 SDs, 0 SdLazy, 133 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax169 hnf97 lsp41 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 13.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...