./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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.24-cad4683 [2019-11-15 20:32:22,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:32:22,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:32:22,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:32:22,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:32:22,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:32:22,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:32:22,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:32:22,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:32:22,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:32:22,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:32:22,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:32:22,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:32:22,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:32:22,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:32:22,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:32:22,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:32:22,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:32:22,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:32:22,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:32:22,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:32:22,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:32:22,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:32:22,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:32:22,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:32:22,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:32:22,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:32:22,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:32:22,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:32:22,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:32:22,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:32:22,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:32:22,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:32:22,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:32:22,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:32:22,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:32:22,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:32:22,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:32:22,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:32:22,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:32:22,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:32:22,273 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 20:32:22,290 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:32:22,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:32:22,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:32:22,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:32:22,291 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:32:22,292 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:32:22,292 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:32:22,292 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:32:22,292 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:32:22,292 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:32:22,293 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:32:22,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:32:22,293 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:32:22,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:32:22,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:32:22,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:32:22,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:32:22,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:32:22,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:32:22,294 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:32:22,294 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:32:22,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:32:22,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:32:22,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:32:22,295 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:32:22,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:32:22,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:32:22,296 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:32:22,297 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:32:22,297 INFO L138 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:22,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:32:22,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:32:22,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:32:22,349 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:32:22,350 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:32:22,350 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-15 20:32:22,398 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/data/8d8f1310e/fb1939defda940ea9254bec156d98bb1/FLAG5f5aca490 [2019-11-15 20:32:22,794 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:32:22,795 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-15 20:32:22,800 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/data/8d8f1310e/fb1939defda940ea9254bec156d98bb1/FLAG5f5aca490 [2019-11-15 20:32:22,812 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/data/8d8f1310e/fb1939defda940ea9254bec156d98bb1 [2019-11-15 20:32:22,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:32:22,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:32:22,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:32:22,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:32:22,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:32:22,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:32:22" (1/1) ... [2019-11-15 20:32:22,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69750992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:22, skipping insertion in model container [2019-11-15 20:32:22,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:32:22" (1/1) ... [2019-11-15 20:32:22,833 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:32:22,847 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:32:23,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:32:23,070 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:32:23,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:32:23,101 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:32:23,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23 WrapperNode [2019-11-15 20:32:23,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:32:23,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:32:23,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:32:23,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:32:23,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23" (1/1) ... [2019-11-15 20:32:23,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23" (1/1) ... [2019-11-15 20:32:23,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:32:23,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:32:23,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:32:23,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:32:23,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23" (1/1) ... [2019-11-15 20:32:23,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23" (1/1) ... [2019-11-15 20:32:23,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23" (1/1) ... [2019-11-15 20:32:23,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23" (1/1) ... [2019-11-15 20:32:23,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23" (1/1) ... [2019-11-15 20:32:23,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23" (1/1) ... [2019-11-15 20:32:23,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23" (1/1) ... [2019-11-15 20:32:23,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:32:23,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:32:23,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:32:23,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:32:23,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:32:23,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:32:23,491 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:32:23,491 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:32:23,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:32:23 BoogieIcfgContainer [2019-11-15 20:32:23,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:32:23,493 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:32:23,493 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:32:23,496 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:32:23,497 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:32:23,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:32:22" (1/3) ... [2019-11-15 20:32:23,498 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b79463b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:32:23, skipping insertion in model container [2019-11-15 20:32:23,498 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:32:23,498 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:32:23" (2/3) ... [2019-11-15 20:32:23,499 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b79463b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:32:23, skipping insertion in model container [2019-11-15 20:32:23,499 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:32:23,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:32:23" (3/3) ... [2019-11-15 20:32:23,513 INFO L371 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-11-15 20:32:23,561 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:32:23,561 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:32:23,561 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:32:23,562 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:32:23,562 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:32:23,562 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:32:23,562 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:32:23,563 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:32:23,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 20:32:23,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:32:23,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:32:23,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:32:23,602 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:32:23,602 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:32:23,603 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:32:23,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 20:32:23,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:32:23,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:32:23,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:32:23,606 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:32:23,606 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:32:23,613 INFO L791 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 [2019-11-15 20:32:23,614 INFO L793 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 [2019-11-15 20:32:23,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-11-15 20:32:23,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:23,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678958383] [2019-11-15 20:32:23,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:23,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:23,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:23,716 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash 42943, now seen corresponding path program 1 times [2019-11-15 20:32:23,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:23,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368688248] [2019-11-15 20:32:23,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:23,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:23,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:23,728 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:23,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:23,730 INFO L82 PathProgramCache]: Analyzing trace with hash 29684988, now seen corresponding path program 1 times [2019-11-15 20:32:23,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:23,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13415538] [2019-11-15 20:32:23,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:23,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:23,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:23,748 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:23,826 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:23,827 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:23,827 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:23,827 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:23,827 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:32:23,827 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:23,828 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:23,828 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:23,828 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration1_Loop [2019-11-15 20:32:23,828 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:23,829 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:23,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:23,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:23,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:23,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:23,952 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:23,952 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:32:23,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:23,964 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:23,975 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:23,975 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:32:23,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:23,988 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:23,995 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:23,996 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:32:24,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:24,008 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:32:24,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:32:24,025 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:24,151 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:32:24,153 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:24,153 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:24,153 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:24,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:24,154 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:32:24,154 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:24,154 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:24,154 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:24,154 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration1_Loop [2019-11-15 20:32:24,154 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:24,154 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:24,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:24,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:24,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:24,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:24,311 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:24,316 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:32:24,317 INFO L120 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 [2019-11-15 20:32:24,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:24,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:24,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:24,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:24,321 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:32:24,322 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:32:24,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:24,332 INFO L120 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 [2019-11-15 20:32:24,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:24,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:24,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:24,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:24,335 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:32:24,335 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:32:24,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:24,344 INFO L120 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 [2019-11-15 20:32:24,348 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:24,348 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:24,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:24,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:24,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:24,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:24,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:24,356 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:32:24,364 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:32:24,364 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:32:24,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:32:24,366 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:32:24,366 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:32:24,367 INFO L512 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 [] [2019-11-15 20:32:24,369 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:32:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:24,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:24,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:24,449 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:24,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:24,486 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 [2019-11-15 20:32:24,487 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2019-11-15 20:32:24,553 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. [2019-11-15 20:32:24,555 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 [2019-11-15 20:32:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:32:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-11-15 20:32:24,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-15 20:32:24,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:24,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 20:32:24,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:24,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-15 20:32:24,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:24,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2019-11-15 20:32:24,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 20:32:24,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 14 states and 21 transitions. [2019-11-15 20:32:24,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 20:32:24,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 20:32:24,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2019-11-15 20:32:24,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:32:24,578 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-11-15 20:32:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2019-11-15 20:32:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-15 20:32:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 20:32:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2019-11-15 20:32:24,607 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-11-15 20:32:24,607 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-11-15 20:32:24,607 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:32:24,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2019-11-15 20:32:24,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 20:32:24,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:32:24,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:32:24,611 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:32:24,611 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 20:32:24,611 INFO L791 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 [2019-11-15 20:32:24,611 INFO L793 eck$LassoCheckResult]: Loop: 96#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 96#L28-2 [2019-11-15 20:32:24,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:24,612 INFO L82 PathProgramCache]: Analyzing trace with hash 957581, now seen corresponding path program 1 times [2019-11-15 20:32:24,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:24,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328436112] [2019-11-15 20:32:24,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:24,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:24,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:24,640 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:24,641 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times [2019-11-15 20:32:24,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:24,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611837885] [2019-11-15 20:32:24,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:24,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:24,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:24,648 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:24,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:24,648 INFO L82 PathProgramCache]: Analyzing trace with hash 29685042, now seen corresponding path program 1 times [2019-11-15 20:32:24,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:24,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648913643] [2019-11-15 20:32:24,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:24,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:24,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:24,674 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:24,693 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:24,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:24,693 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:24,693 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:24,694 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:32:24,694 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:24,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:24,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:24,694 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration2_Loop [2019-11-15 20:32:24,694 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:24,694 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:24,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:24,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:24,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:24,752 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:24,752 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:24,761 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:24,761 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:24,764 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:24,765 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:24,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:24,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:24,774 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:24,774 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:24,779 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:24,780 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:24,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:32:24,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:24,893 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:32:24,894 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:24,895 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:24,895 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:24,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:24,895 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:32:24,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:24,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:24,895 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:24,895 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration2_Loop [2019-11-15 20:32:24,895 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:24,895 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:24,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:24,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:24,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:24,955 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:24,955 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:32:24,955 INFO L120 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 [2019-11-15 20:32:24,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:24,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:24,956 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:24,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:24,958 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:32:24,959 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:32:24,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:24,963 INFO L120 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 [2019-11-15 20:32:24,964 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:24,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:24,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:24,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:24,966 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:32:24,966 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:32:24,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:24,981 INFO L120 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 [2019-11-15 20:32:24,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:24,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:24,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:24,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:24,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:24,984 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:24,986 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:24,990 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:32:24,997 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:32:25,002 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:32:25,003 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:32:25,003 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:32:25,003 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:32:25,003 INFO L512 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 [] [2019-11-15 20:32:25,004 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:32:25,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:25,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:25,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:25,036 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:25,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:25,037 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 [2019-11-15 20:32:25,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10 Second operand 2 states. [2019-11-15 20:32:25,060 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. [2019-11-15 20:32:25,061 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 [2019-11-15 20:32:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 20:32:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-15 20:32:25,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 1 letters. [2019-11-15 20:32:25,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:25,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 1 letters. [2019-11-15 20:32:25,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:25,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 20:32:25,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:25,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 43 transitions. [2019-11-15 20:32:25,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 20:32:25,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 27 transitions. [2019-11-15 20:32:25,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 20:32:25,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 20:32:25,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 27 transitions. [2019-11-15 20:32:25,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:32:25,066 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-11-15 20:32:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 27 transitions. [2019-11-15 20:32:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 20:32:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 20:32:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2019-11-15 20:32:25,068 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-11-15 20:32:25,068 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-11-15 20:32:25,068 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:32:25,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2019-11-15 20:32:25,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 20:32:25,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:32:25,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:32:25,070 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:32:25,070 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:32:25,070 INFO L791 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 [2019-11-15 20:32:25,070 INFO L793 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 [2019-11-15 20:32:25,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:25,071 INFO L82 PathProgramCache]: Analyzing trace with hash 920236275, now seen corresponding path program 1 times [2019-11-15 20:32:25,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:25,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023281804] [2019-11-15 20:32:25,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:25,084 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:25,084 INFO L82 PathProgramCache]: Analyzing trace with hash 50233, now seen corresponding path program 2 times [2019-11-15 20:32:25,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:25,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620129268] [2019-11-15 20:32:25,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:25,091 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:25,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 1 times [2019-11-15 20:32:25,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:25,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751606819] [2019-11-15 20:32:25,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:25,106 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:25,127 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:25,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:25,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:25,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:25,127 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:32:25,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:25,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:25,127 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:25,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration3_Loop [2019-11-15 20:32:25,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:25,127 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:25,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:25,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:25,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:25,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:25,199 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:25,199 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:32:25,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:25,204 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:25,209 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:25,209 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:32:25,224 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:25,224 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:25,236 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:25,236 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:25,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:25,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:25,251 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:25,252 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:32:25,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:25,269 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:25,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:32:25,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:25,716 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:32:25,718 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:25,718 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:25,718 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:25,718 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:25,718 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:32:25,718 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:25,719 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:25,719 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:25,719 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration3_Loop [2019-11-15 20:32:25,719 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:25,719 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:25,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:25,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:25,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:25,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:25,801 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:25,801 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:32:25,801 INFO L120 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 [2019-11-15 20:32:25,802 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:25,802 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:25,802 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:25,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:25,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:25,803 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:25,803 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:25,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:25,805 INFO L120 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 [2019-11-15 20:32:25,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:25,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:25,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:25,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:25,809 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:32:25,811 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:32:25,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:25,816 INFO L120 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 [2019-11-15 20:32:25,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:25,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:25,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:25,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:25,818 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:25,818 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:25,818 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:25,822 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:32:25,826 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:32:25,827 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:32:25,827 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:32:25,827 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:32:25,828 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:32:25,828 INFO L512 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 [] [2019-11-15 20:32:25,828 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:32:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:25,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:25,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:25,867 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:25,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:25,889 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 [2019-11-15 20:32:25,889 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-11-15 20:32:25,913 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. [2019-11-15 20:32:25,915 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 [2019-11-15 20:32:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:32:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-11-15 20:32:25,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 20:32:25,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:25,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 20:32:25,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:25,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-15 20:32:25,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:25,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 51 transitions. [2019-11-15 20:32:25,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 20:32:25,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 34 transitions. [2019-11-15 20:32:25,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 20:32:25,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 20:32:25,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 34 transitions. [2019-11-15 20:32:25,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:32:25,920 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 34 transitions. [2019-11-15 20:32:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 34 transitions. [2019-11-15 20:32:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-11-15 20:32:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 20:32:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2019-11-15 20:32:25,922 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-11-15 20:32:25,922 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-11-15 20:32:25,922 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:32:25,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2019-11-15 20:32:25,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 20:32:25,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:32:25,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:32:25,924 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-15 20:32:25,924 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 20:32:25,924 INFO L791 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 [2019-11-15 20:32:25,924 INFO L793 eck$LassoCheckResult]: Loop: 273#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 273#L28-2 [2019-11-15 20:32:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:25,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 2 times [2019-11-15 20:32:25,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:25,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246274645] [2019-11-15 20:32:25,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:25,943 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times [2019-11-15 20:32:25,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:25,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004042522] [2019-11-15 20:32:25,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:25,949 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:25,949 INFO L82 PathProgramCache]: Analyzing trace with hash -416201988, now seen corresponding path program 1 times [2019-11-15 20:32:25,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:25,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105932198] [2019-11-15 20:32:25,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:25,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:25,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105932198] [2019-11-15 20:32:25,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:32:25,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:32:25,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468569326] [2019-11-15 20:32:26,012 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:26,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:26,013 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:26,013 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:26,013 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:32:26,013 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:26,013 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:26,013 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:26,013 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration4_Loop [2019-11-15 20:32:26,013 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:26,014 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:26,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,062 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:26,062 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:26,074 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:26,075 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:26,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:32:26,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:26,186 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:32:26,188 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:26,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:26,188 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:26,189 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:26,189 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:32:26,189 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:26,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:26,189 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:26,189 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration4_Loop [2019-11-15 20:32:26,189 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:26,189 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:26,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,254 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:26,254 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:32:26,254 INFO L120 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 [2019-11-15 20:32:26,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:26,255 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:26,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:26,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:26,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:26,256 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:26,256 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:26,259 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:32:26,262 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:32:26,262 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:32:26,262 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:32:26,262 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:32:26,263 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:32:26,263 INFO L512 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 [] [2019-11-15 20:32:26,263 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:32:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:26,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:26,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:26,313 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:26,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:26,314 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 [2019-11-15 20:32:26,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2019-11-15 20:32:26,326 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. [2019-11-15 20:32:26,326 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 [2019-11-15 20:32:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 20:32:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-11-15 20:32:26,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2019-11-15 20:32:26,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:26,327 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:32:26,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:26,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:26,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:26,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:26,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:26,370 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 [2019-11-15 20:32:26,370 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2019-11-15 20:32:26,381 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. [2019-11-15 20:32:26,386 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 [2019-11-15 20:32:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 20:32:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-11-15 20:32:26,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2019-11-15 20:32:26,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:26,386 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:32:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:26,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:26,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:26,413 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:26,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:26,414 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 [2019-11-15 20:32:26,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2019-11-15 20:32:26,433 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. [2019-11-15 20:32:26,433 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 [2019-11-15 20:32:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 20:32:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-11-15 20:32:26,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 1 letters. [2019-11-15 20:32:26,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:26,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 8 letters. Loop has 1 letters. [2019-11-15 20:32:26,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:26,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:32:26,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:26,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 60 transitions. [2019-11-15 20:32:26,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 20:32:26,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 22 states and 33 transitions. [2019-11-15 20:32:26,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 20:32:26,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 20:32:26,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2019-11-15 20:32:26,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:32:26,439 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-11-15 20:32:26,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2019-11-15 20:32:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-11-15 20:32:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 20:32:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-15 20:32:26,441 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-15 20:32:26,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:26,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:32:26,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:32:26,446 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 4 states. [2019-11-15 20:32:26,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:26,482 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-15 20:32:26,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:32:26,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-15 20:32:26,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:32:26,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2019-11-15 20:32:26,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 20:32:26,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 20:32:26,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-15 20:32:26,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:32:26,485 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 20:32:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-15 20:32:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-15 20:32:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 20:32:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-15 20:32:26,486 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 20:32:26,486 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 20:32:26,487 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:32:26,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-15 20:32:26,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:32:26,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:32:26,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:32:26,488 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-15 20:32:26,488 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:32:26,488 INFO L791 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 [2019-11-15 20:32:26,488 INFO L793 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 [2019-11-15 20:32:26,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:26,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 3 times [2019-11-15 20:32:26,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:26,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044122911] [2019-11-15 20:32:26,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:26,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:26,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:26,515 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:26,515 INFO L82 PathProgramCache]: Analyzing trace with hash 58767, now seen corresponding path program 1 times [2019-11-15 20:32:26,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:26,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090802916] [2019-11-15 20:32:26,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:26,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:26,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:26,522 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash -538152755, now seen corresponding path program 4 times [2019-11-15 20:32:26,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:26,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406422532] [2019-11-15 20:32:26,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:26,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:26,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:26,545 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:26,573 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:26,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:26,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:26,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:26,573 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:32:26,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:26,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:26,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:26,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration5_Loop [2019-11-15 20:32:26,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:26,574 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:26,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,641 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:26,641 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:26,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:26,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:26,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:26,665 INFO L440 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=0} Honda state: {ULTIMATE.start_main_~k~0=-1, ULTIMATE.start_main_~i~0=-1, ULTIMATE.start_main_~N~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:32:26,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:26,678 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:26,682 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:26,682 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:26,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:26,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:26,699 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:26,699 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:26,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:26,708 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:26,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:32:26,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:26,871 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:32:26,872 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:26,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:26,873 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:26,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:26,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:32:26,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:26,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:26,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:26,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration5_Loop [2019-11-15 20:32:26,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:26,873 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:26,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:26,970 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:26,970 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:32:26,971 INFO L120 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 [2019-11-15 20:32:26,971 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:26,971 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:26,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:26,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:26,972 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:32:26,972 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:32:26,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:26,974 INFO L120 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 [2019-11-15 20:32:26,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:26,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:26,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:26,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:26,975 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:32:26,975 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:32:26,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:26,979 INFO L120 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 [2019-11-15 20:32:26,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:26,979 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:26,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:26,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:26,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:26,980 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:26,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:26,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:26,982 INFO L120 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 [2019-11-15 20:32:26,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:26,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:26,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:26,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:26,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:26,984 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:26,984 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:26,987 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:32:26,989 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:32:26,989 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:32:26,990 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:32:26,990 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:32:26,990 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:32:26,990 INFO L512 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 [] [2019-11-15 20:32:26,991 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:32:27,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:27,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:27,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:27,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:27,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:27,024 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 [2019-11-15 20:32:27,024 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 20:32:27,038 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. [2019-11-15 20:32:27,039 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 [2019-11-15 20:32:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:32:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-15 20:32:27,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 20:32:27,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:27,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 20:32:27,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:27,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 20:32:27,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:27,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2019-11-15 20:32:27,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:32:27,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 44 transitions. [2019-11-15 20:32:27,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:32:27,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 20:32:27,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-11-15 20:32:27,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:32:27,043 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-15 20:32:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-11-15 20:32:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-11-15 20:32:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 20:32:27,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-11-15 20:32:27,045 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-11-15 20:32:27,045 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-11-15 20:32:27,045 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:32:27,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2019-11-15 20:32:27,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:32:27,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:32:27,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:32:27,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2019-11-15 20:32:27,047 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:32:27,047 INFO L791 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 [2019-11-15 20:32:27,047 INFO L793 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 [2019-11-15 20:32:27,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:27,047 INFO L82 PathProgramCache]: Analyzing trace with hash -538152757, now seen corresponding path program 1 times [2019-11-15 20:32:27,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:27,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255273793] [2019-11-15 20:32:27,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:27,058 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:27,059 INFO L82 PathProgramCache]: Analyzing trace with hash 67693, now seen corresponding path program 3 times [2019-11-15 20:32:27,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:27,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647887481] [2019-11-15 20:32:27,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:27,064 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:27,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1004170083, now seen corresponding path program 2 times [2019-11-15 20:32:27,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:27,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071875356] [2019-11-15 20:32:27,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:27,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071875356] [2019-11-15 20:32:27,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732372974] [2019-11-15 20:32:27,103 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:27,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:32:27,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:32:27,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:27,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:32:27,173 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:32:27,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-15 20:32:27,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178178223] [2019-11-15 20:32:27,190 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:27,190 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:27,190 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:27,190 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:27,190 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:32:27,190 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:27,190 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:27,191 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:27,191 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration6_Loop [2019-11-15 20:32:27,191 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:27,191 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:27,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:27,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:27,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:27,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:27,258 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:27,258 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:27,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:27,261 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:27,264 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:27,265 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:27,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:27,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:27,272 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:27,272 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:27,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:27,276 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:27,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:32:27,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:27,675 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:32:27,677 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:27,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:27,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:27,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:27,677 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:32:27,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:27,677 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:27,677 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:27,677 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration6_Loop [2019-11-15 20:32:27,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:27,678 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:27,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:27,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:27,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:27,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:27,729 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:27,729 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:32:27,730 INFO L120 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 [2019-11-15 20:32:27,730 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:27,730 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:27,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:27,730 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:27,730 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:27,731 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:27,731 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:27,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:27,732 INFO L120 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 [2019-11-15 20:32:27,732 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:27,732 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:27,732 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:27,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:27,733 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:32:27,733 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:32:27,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:27,734 INFO L120 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 [2019-11-15 20:32:27,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:27,735 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:27,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:27,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:27,735 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:27,736 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:27,736 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:27,738 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:32:27,740 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:32:27,740 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:32:27,741 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:32:27,741 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:32:27,741 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:32:27,741 INFO L512 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 [] [2019-11-15 20:32:27,742 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:32:27,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:27,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:27,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:27,784 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:27,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:27,806 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 [2019-11-15 20:32:27,807 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-15 20:32:27,832 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. [2019-11-15 20:32:27,834 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 [2019-11-15 20:32:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:32:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 20:32:27,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 20:32:27,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:27,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-15 20:32:27,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:27,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-15 20:32:27,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:27,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 90 transitions. [2019-11-15 20:32:27,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 20:32:27,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 50 states and 68 transitions. [2019-11-15 20:32:27,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 20:32:27,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-15 20:32:27,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2019-11-15 20:32:27,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:32:27,838 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 68 transitions. [2019-11-15 20:32:27,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2019-11-15 20:32:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-11-15 20:32:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 20:32:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-11-15 20:32:27,840 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-11-15 20:32:27,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:27,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:32:27,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:32:27,841 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 8 states. [2019-11-15 20:32:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:27,910 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2019-11-15 20:32:27,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:32:27,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2019-11-15 20:32:27,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-15 20:32:27,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 62 transitions. [2019-11-15 20:32:27,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-15 20:32:27,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 20:32:27,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 62 transitions. [2019-11-15 20:32:27,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:32:27,914 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-15 20:32:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 62 transitions. [2019-11-15 20:32:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 23. [2019-11-15 20:32:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:32:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2019-11-15 20:32:27,916 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-11-15 20:32:27,916 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-11-15 20:32:27,916 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:32:27,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2019-11-15 20:32:27,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 20:32:27,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:32:27,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:32:27,917 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:27,918 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:32:27,918 INFO L791 eck$LassoCheckResult]: Stem: 927#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; 925#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 926#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 935#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 937#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 919#L28-3 main_~i~0 := main_~k~0; 938#L25-2 assume !(main_~j~0 < main_~m~0); 928#L25-3 [2019-11-15 20:32:27,918 INFO L793 eck$LassoCheckResult]: Loop: 928#L25-3 main_~i~0 := 1 + main_~i~0; 920#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 921#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 916#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 917#L28-3 main_~i~0 := main_~k~0; 933#L25-2 assume !(main_~j~0 < main_~m~0); 928#L25-3 [2019-11-15 20:32:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:27,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446527, now seen corresponding path program 2 times [2019-11-15 20:32:27,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:27,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128433112] [2019-11-15 20:32:27,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:27,927 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:27,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:27,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2016730719, now seen corresponding path program 1 times [2019-11-15 20:32:27,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:27,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689683267] [2019-11-15 20:32:27,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:27,933 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:27,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash -504812577, now seen corresponding path program 3 times [2019-11-15 20:32:27,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:27,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215415967] [2019-11-15 20:32:27,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:27,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:27,946 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:27,993 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:27,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:27,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:27,993 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:27,993 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:32:27,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:27,994 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:27,994 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:27,994 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration7_Loop [2019-11-15 20:32:27,994 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:27,994 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:27,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:28,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:28,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:28,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:28,075 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:28,075 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:32:28,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:28,080 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:28,085 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:28,085 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:28,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:28,092 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:28,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:32:28,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:40,114 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-11-15 20:32:40,117 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:40,117 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:40,117 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:40,117 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:40,117 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:32:40,117 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:40,117 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:40,118 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:40,118 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration7_Loop [2019-11-15 20:32:40,118 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:40,118 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:40,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,209 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:40,209 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:32:40,210 INFO L120 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 [2019-11-15 20:32:40,210 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:40,210 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:40,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:40,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:40,211 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:40,211 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:40,211 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:40,215 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:32:40,228 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:32:40,229 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:32:40,229 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:32:40,229 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:32:40,229 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:32:40,230 INFO L512 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 [] [2019-11-15 20:32:40,230 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:32:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:40,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:40,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:40,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:32:40,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:40,333 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 [2019-11-15 20:32:40,334 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2019-11-15 20:32:40,367 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. [2019-11-15 20:32:40,367 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 [2019-11-15 20:32:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 20:32:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 20:32:40,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 20:32:40,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:40,368 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:32:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:40,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:40,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:40,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:32:40,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:40,434 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 [2019-11-15 20:32:40,434 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2019-11-15 20:32:40,521 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. [2019-11-15 20:32:40,523 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 [2019-11-15 20:32:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 20:32:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-11-15 20:32:40,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 20:32:40,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:40,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-15 20:32:40,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:40,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 12 letters. [2019-11-15 20:32:40,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:40,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 79 transitions. [2019-11-15 20:32:40,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:32:40,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 43 states and 60 transitions. [2019-11-15 20:32:40,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:32:40,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 20:32:40,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 60 transitions. [2019-11-15 20:32:40,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:32:40,542 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-11-15 20:32:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 60 transitions. [2019-11-15 20:32:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2019-11-15 20:32:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 20:32:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-11-15 20:32:40,549 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-11-15 20:32:40,549 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-11-15 20:32:40,549 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:32:40,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 52 transitions. [2019-11-15 20:32:40,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:32:40,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:32:40,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:32:40,550 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:40,550 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:32:40,550 INFO L791 eck$LassoCheckResult]: Stem: 1178#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; 1172#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 1173#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1192#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1189#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1186#L28-3 main_~i~0 := main_~k~0; 1185#L25-2 assume !(main_~j~0 < main_~m~0); 1179#L25-3 main_~i~0 := 1 + main_~i~0; 1174#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1175#L25-2 [2019-11-15 20:32:40,550 INFO L793 eck$LassoCheckResult]: Loop: 1175#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1168#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1169#L28-3 main_~i~0 := main_~k~0; 1175#L25-2 [2019-11-15 20:32:40,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:40,550 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 4 times [2019-11-15 20:32:40,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:40,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124660406] [2019-11-15 20:32:40,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:40,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:40,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:40,560 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:40,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:40,560 INFO L82 PathProgramCache]: Analyzing trace with hash 51867, now seen corresponding path program 2 times [2019-11-15 20:32:40,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:40,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530390874] [2019-11-15 20:32:40,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:40,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:40,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:40,565 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:40,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1817399595, now seen corresponding path program 5 times [2019-11-15 20:32:40,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:40,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747436563] [2019-11-15 20:32:40,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:40,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:40,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:40,576 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:40,598 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:40,598 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:40,598 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:40,599 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:40,599 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:32:40,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:40,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:40,599 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:40,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration8_Loop [2019-11-15 20:32:40,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:40,599 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:40,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,695 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:40,695 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:40,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:40,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:40,703 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:40,703 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:40,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:40,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:40,711 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:40,711 INFO L440 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/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:40,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:40,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:40,721 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:32:40,722 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=0, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~N~0=-7} Honda state: {ULTIMATE.start_main_~k~0=0, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~N~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:40,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:32:40,726 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4f149f7-f576-4433-8989-2248a206d371/bin/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 [2019-11-15 20:32:40,732 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:32:40,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:32:40,878 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:32:40,880 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:32:40,880 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:32:40,880 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:32:40,880 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:32:40,880 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:32:40,880 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:32:40,880 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:32:40,880 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:32:40,880 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration8_Loop [2019-11-15 20:32:40,881 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:32:40,881 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:32:40,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:32:40,955 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:32:40,955 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:32:40,956 INFO L120 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 [2019-11-15 20:32:40,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:40,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:40,956 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:40,956 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:40,957 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:32:40,957 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:32:40,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:40,958 INFO L120 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 [2019-11-15 20:32:40,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:40,959 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:40,959 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:40,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:40,959 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:40,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:40,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:40,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:32:40,961 INFO L120 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 [2019-11-15 20:32:40,961 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:32:40,961 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:32:40,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:32:40,962 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:32:40,962 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:32:40,962 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:32:40,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:32:40,964 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:32:40,965 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:32:40,965 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:32:40,966 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:32:40,966 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:32:40,966 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:32:40,966 INFO L512 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 [] [2019-11-15 20:32:40,966 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:32:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:40,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:40,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:41,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:41,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:41,011 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 [2019-11-15 20:32:41,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-11-15 20:32:41,019 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. [2019-11-15 20:32:41,019 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 [2019-11-15 20:32:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:32:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-11-15 20:32:41,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 20:32:41,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:41,020 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:32:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:41,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:41,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:41,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:41,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:41,057 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 [2019-11-15 20:32:41,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-11-15 20:32:41,073 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. [2019-11-15 20:32:41,075 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 [2019-11-15 20:32:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:32:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-15 20:32:41,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 20:32:41,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:41,076 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:32:41,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:41,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:32:41,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:41,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:32:41,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:41,118 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 [2019-11-15 20:32:41,118 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-11-15 20:32:41,125 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. [2019-11-15 20:32:41,126 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 [2019-11-15 20:32:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:32:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-11-15 20:32:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 20:32:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-15 20:32:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-15 20:32:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:32:41,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 104 transitions. [2019-11-15 20:32:41,130 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:32:41,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2019-11-15 20:32:41,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:32:41,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:32:41,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:32:41,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:32:41,131 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:32:41,131 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:32:41,131 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:32:41,131 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 20:32:41,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:32:41,131 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:32:41,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:32:41,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:32:41 BoogieIcfgContainer [2019-11-15 20:32:41,136 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:32:41,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:32:41,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:32:41,137 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:32:41,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:32:23" (3/4) ... [2019-11-15 20:32:41,139 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:32:41,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:32:41,141 INFO L168 Benchmark]: Toolchain (without parser) took 18325.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:32:41,142 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:32:41,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 939.7 MB in the beginning and 1.2 GB in the end (delta: -214.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:32:41,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:32:41,143 INFO L168 Benchmark]: Boogie Preprocessor took 30.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:32:41,144 INFO L168 Benchmark]: RCFGBuilder took 325.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:32:41,144 INFO L168 Benchmark]: BuchiAutomizer took 17643.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.1 MB). Peak memory consumption was 68.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:32:41,145 INFO L168 Benchmark]: Witness Printer took 3.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:32:41,148 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 939.7 MB in the beginning and 1.2 GB in the end (delta: -214.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 325.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17643.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.1 MB). Peak memory consumption was 68.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.5s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 16.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 61 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: 167 SDtfs, 164 SDslu, 80 SDs, 0 SdLazy, 161 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 13.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...