./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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:02,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:02,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:02,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:02,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:02,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:02,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:02,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:02,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:02,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:02,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:02,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:02,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:02,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:02,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:02,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:02,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:02,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:02,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:02,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:02,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:02,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:02,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:02,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:02,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:02,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:02,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:02,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:02,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:02,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:02,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:02,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:02,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:02,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:02,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:02,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:02,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:02,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:02,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:02,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:02,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:02,435 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:58:02,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:02,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:02,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:02,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:02,456 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:02,456 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:02,456 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:02,456 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:02,456 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:02,456 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:02,457 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:02,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:02,457 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:02,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:02,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:02,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:02,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:02,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:02,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:02,459 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:02,459 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:02,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:02,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:02,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:02,460 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:02,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:02,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:02,460 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:02,461 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:02,461 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:02,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:02,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:02,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:02,501 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:02,501 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:02,502 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-10-22 08:58:02,552 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/bin/uautomizer/data/8f4da6509/91c189b9254f4a6db086f7cec2aafeab/FLAG361ebede2 [2019-10-22 08:58:02,933 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:02,933 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-10-22 08:58:02,938 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/bin/uautomizer/data/8f4da6509/91c189b9254f4a6db086f7cec2aafeab/FLAG361ebede2 [2019-10-22 08:58:03,335 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/bin/uautomizer/data/8f4da6509/91c189b9254f4a6db086f7cec2aafeab [2019-10-22 08:58:03,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:03,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:03,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:03,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:03,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:03,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc1ed8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03, skipping insertion in model container [2019-10-22 08:58:03,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,351 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:03,366 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:03,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:03,542 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:03,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:03,638 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:03,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03 WrapperNode [2019-10-22 08:58:03,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:03,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:03,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:03,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:03,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:03,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:03,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:03,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:03,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:03,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:03,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:03,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:03,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:03,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:03,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:03,872 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:03,872 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:58:03,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:03 BoogieIcfgContainer [2019-10-22 08:58:03,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:03,880 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:03,880 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:03,883 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:03,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:03,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:03" (1/3) ... [2019-10-22 08:58:03,885 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c8699a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:03, skipping insertion in model container [2019-10-22 08:58:03,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:03,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (2/3) ... [2019-10-22 08:58:03,886 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c8699a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:03, skipping insertion in model container [2019-10-22 08:58:03,886 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:03,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:03" (3/3) ... [2019-10-22 08:58:03,888 INFO L371 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2019-10-22 08:58:03,949 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:03,950 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:03,950 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:03,950 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:03,950 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:03,950 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:03,951 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:03,952 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:03,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:58:03,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:03,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:03,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:04,004 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:04,004 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:04,004 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:04,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:58:04,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:04,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:04,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:04,006 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:04,007 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:04,014 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-10-22 08:58:04,015 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-10-22 08:58:04,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,021 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-10-22 08:58:04,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144324401] [2019-10-22 08:58:04,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,133 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:04,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,134 INFO L82 PathProgramCache]: Analyzing trace with hash 42943, now seen corresponding path program 1 times [2019-10-22 08:58:04,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629436754] [2019-10-22 08:58:04,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,146 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,148 INFO L82 PathProgramCache]: Analyzing trace with hash 29684988, now seen corresponding path program 1 times [2019-10-22 08:58:04,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109601330] [2019-10-22 08:58:04,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,165 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:04,286 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:04,287 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:04,287 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:04,287 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:04,287 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:04,287 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:04,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:04,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:04,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration1_Loop [2019-10-22 08:58:04,288 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:04,288 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:04,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:04,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:04,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:04,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:04,430 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:04,431 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:04,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,444 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,444 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:04,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,451 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,457 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,458 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:04,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,465 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:04,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:04,484 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-10-22 08:58:04,580 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:04,581 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:04,581 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:04,581 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:04,582 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:04,582 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:04,582 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:04,582 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:04,582 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:04,582 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration1_Loop [2019-10-22 08:58:04,582 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:04,582 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:04,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:04,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:04,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:04,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-10-22 08:58:04,671 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:04,675 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:04,677 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-10-22 08:58:04,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:04,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:04,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:04,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:04,684 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:04,684 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:04,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:04,692 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-10-22 08:58:04,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:04,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:04,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:04,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:04,695 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:04,695 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:04,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:04,703 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-10-22 08:58:04,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:04,704 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:04,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:04,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:04,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:04,705 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:04,705 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:04,711 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:04,718 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:04,718 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:04,720 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:04,720 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:04,720 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:04,721 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-10-22 08:58:04,724 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:04,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:04,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,776 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:04,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:04,804 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-10-22 08:58:04,805 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2019-10-22 08:58:04,857 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-10-22 08:58:04,861 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-10-22 08:58:04,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-10-22 08:58:04,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 3 letters. [2019-10-22 08:58:04,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:04,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2019-10-22 08:58:04,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:04,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 6 letters. [2019-10-22 08:58:04,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:04,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2019-10-22 08:58:04,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:58:04,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 14 states and 21 transitions. [2019-10-22 08:58:04,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:58:04,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:58:04,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2019-10-22 08:58:04,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:04,875 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-10-22 08:58:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2019-10-22 08:58:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-10-22 08:58:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:58:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2019-10-22 08:58:04,901 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-10-22 08:58:04,901 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2019-10-22 08:58:04,901 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:04,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2019-10-22 08:58:04,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:58:04,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:04,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:04,904 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:58:04,904 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:58:04,905 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-10-22 08:58:04,905 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-10-22 08:58:04,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,905 INFO L82 PathProgramCache]: Analyzing trace with hash 957581, now seen corresponding path program 1 times [2019-10-22 08:58:04,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707297425] [2019-10-22 08:58:04,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,924 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times [2019-10-22 08:58:04,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391125708] [2019-10-22 08:58:04,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,931 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash 29685042, now seen corresponding path program 1 times [2019-10-22 08:58:04,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124748000] [2019-10-22 08:58:04,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,946 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:04,959 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:04,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:04,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:04,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:04,959 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:04,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:04,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:04,959 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:04,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration2_Loop [2019-10-22 08:58:04,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:04,960 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:04,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:04,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:04,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,012 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:05,012 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:05,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:05,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:05,023 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:05,023 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:05,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:05,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:05,032 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:05,032 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:05,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:05,037 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:05,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:05,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:05,151 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:05,152 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:05,153 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:05,153 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:05,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:05,153 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:05,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:05,153 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:05,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:05,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration2_Loop [2019-10-22 08:58:05,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:05,154 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:05,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-10-22 08:58:05,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,200 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:05,200 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:05,201 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-10-22 08:58:05,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:05,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:05,202 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:05,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:05,204 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:05,204 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:05,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:05,208 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-10-22 08:58:05,209 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:05,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:05,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:05,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:05,211 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:05,211 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:05,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:05,217 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-10-22 08:58:05,217 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:05,217 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:05,217 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:05,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:05,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:05,218 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:05,219 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:05,223 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:05,227 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:05,227 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:05,227 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:05,228 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:05,228 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:05,228 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-10-22 08:58:05,229 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:05,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:05,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:05,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:05,258 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-10-22 08:58:05,258 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10 Second operand 2 states. [2019-10-22 08:58:05,273 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-10-22 08:58:05,273 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-10-22 08:58:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:58:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-10-22 08:58:05,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 1 letters. [2019-10-22 08:58:05,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:05,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 1 letters. [2019-10-22 08:58:05,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:05,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:58:05,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:05,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 43 transitions. [2019-10-22 08:58:05,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:58:05,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 27 transitions. [2019-10-22 08:58:05,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:58:05,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:58:05,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 27 transitions. [2019-10-22 08:58:05,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:05,277 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-10-22 08:58:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 27 transitions. [2019-10-22 08:58:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:58:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:58:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2019-10-22 08:58:05,280 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-10-22 08:58:05,280 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-10-22 08:58:05,280 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:05,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2019-10-22 08:58:05,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:58:05,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:05,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:05,281 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:05,281 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:05,282 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-10-22 08:58:05,282 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-10-22 08:58:05,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,286 INFO L82 PathProgramCache]: Analyzing trace with hash 920236275, now seen corresponding path program 1 times [2019-10-22 08:58:05,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074946778] [2019-10-22 08:58:05,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,314 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:05,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,315 INFO L82 PathProgramCache]: Analyzing trace with hash 50233, now seen corresponding path program 2 times [2019-10-22 08:58:05,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656343070] [2019-10-22 08:58:05,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,329 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:05,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,330 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 1 times [2019-10-22 08:58:05,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349464936] [2019-10-22 08:58:05,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:05,352 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:05,382 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:05,383 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:05,383 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:05,383 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:05,383 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:05,383 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:05,383 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:05,383 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:05,383 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration3_Loop [2019-10-22 08:58:05,383 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:05,383 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:05,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,449 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:05,449 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:05,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:05,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:05,459 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:05,459 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:05,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:05,473 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:05,483 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:05,483 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:05,499 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:05,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:05,504 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:05,504 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:05,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:05,520 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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) [2019-10-22 08:58:05,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:05,532 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:05,929 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:05,930 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:05,931 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:05,931 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:05,931 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:05,931 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:05,931 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:05,931 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:05,931 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:05,931 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration3_Loop [2019-10-22 08:58:05,931 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:05,931 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:05,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,988 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:05,988 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:05,989 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-10-22 08:58:05,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:05,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:05,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:05,990 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:05,990 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:05,991 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:05,991 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:05,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:05,993 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-10-22 08:58:05,993 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:05,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:05,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:05,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:05,995 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:05,995 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:05,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:05,999 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-10-22 08:58:06,000 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,000 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,000 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,001 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,001 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,001 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,004 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:06,008 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:06,008 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:06,009 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:06,009 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:06,009 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:06,009 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-10-22 08:58:06,010 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:06,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:06,078 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-10-22 08:58:06,078 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-10-22 08:58:06,101 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-10-22 08:58:06,101 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-10-22 08:58:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-10-22 08:58:06,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 08:58:06,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:06,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:58:06,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:06,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 6 letters. [2019-10-22 08:58:06,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:06,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 51 transitions. [2019-10-22 08:58:06,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:58:06,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 34 transitions. [2019-10-22 08:58:06,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:58:06,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 08:58:06,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 34 transitions. [2019-10-22 08:58:06,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:06,105 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 34 transitions. [2019-10-22 08:58:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 34 transitions. [2019-10-22 08:58:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-10-22 08:58:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:58:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2019-10-22 08:58:06,108 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-10-22 08:58:06,108 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2019-10-22 08:58:06,108 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:06,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2019-10-22 08:58:06,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:58:06,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:06,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:06,109 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-10-22 08:58:06,109 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:58:06,109 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-10-22 08:58:06,109 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-10-22 08:58:06,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 2 times [2019-10-22 08:58:06,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:06,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576844718] [2019-10-22 08:58:06,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:06,122 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:06,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,123 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times [2019-10-22 08:58:06,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:06,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890500764] [2019-10-22 08:58:06,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:06,128 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:06,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,128 INFO L82 PathProgramCache]: Analyzing trace with hash -416201988, now seen corresponding path program 1 times [2019-10-22 08:58:06,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:06,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323977160] [2019-10-22 08:58:06,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:06,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323977160] [2019-10-22 08:58:06,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:06,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:06,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669222198] [2019-10-22 08:58:06,181 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:06,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:06,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:06,181 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:06,181 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:06,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:06,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:06,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:06,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration4_Loop [2019-10-22 08:58:06,182 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:06,182 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:06,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,222 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:06,223 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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) [2019-10-22 08:58:06,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:06,227 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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) [2019-10-22 08:58:06,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:06,243 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:06,360 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:06,361 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:06,361 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:06,361 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:06,361 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:06,361 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:06,362 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:06,362 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:06,362 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:06,362 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration4_Loop [2019-10-22 08:58:06,362 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:06,362 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:06,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,400 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:06,400 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:06,400 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-10-22 08:58:06,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,401 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,401 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,402 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,402 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,402 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,405 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:06,407 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:06,407 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:06,408 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:06,408 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:06,408 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:06,408 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-10-22 08:58:06,408 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:06,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,434 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:06,435 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-10-22 08:58:06,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2019-10-22 08:58:06,446 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-10-22 08:58:06,446 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-10-22 08:58:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:58:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-10-22 08:58:06,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2019-10-22 08:58:06,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:06,447 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:06,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,470 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:06,471 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-10-22 08:58:06,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2019-10-22 08:58:06,481 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-10-22 08:58:06,481 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-10-22 08:58:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:58:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-10-22 08:58:06,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2019-10-22 08:58:06,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:06,482 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:06,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,507 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:06,508 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-10-22 08:58:06,508 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2019-10-22 08:58:06,520 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-10-22 08:58:06,521 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-10-22 08:58:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:58:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-10-22 08:58:06,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 1 letters. [2019-10-22 08:58:06,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:06,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 8 letters. Loop has 1 letters. [2019-10-22 08:58:06,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:06,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:58:06,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:06,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 60 transitions. [2019-10-22 08:58:06,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:58:06,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 22 states and 33 transitions. [2019-10-22 08:58:06,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:58:06,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:58:06,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2019-10-22 08:58:06,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:06,526 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-10-22 08:58:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2019-10-22 08:58:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-10-22 08:58:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:58:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-10-22 08:58:06,529 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-10-22 08:58:06,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:06,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:06,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:06,533 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 4 states. [2019-10-22 08:58:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:06,579 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-10-22 08:58:06,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:06,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-10-22 08:58:06,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:06,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2019-10-22 08:58:06,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:58:06,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:58:06,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-10-22 08:58:06,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:06,582 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 08:58:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-10-22 08:58:06,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-22 08:58:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:58:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-10-22 08:58:06,584 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 08:58:06,584 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 08:58:06,584 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:58:06,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-10-22 08:58:06,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:06,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:06,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:06,585 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-10-22 08:58:06,585 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:06,585 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-10-22 08:58:06,585 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-10-22 08:58:06,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 3 times [2019-10-22 08:58:06,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:06,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693284842] [2019-10-22 08:58:06,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:06,608 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:06,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,608 INFO L82 PathProgramCache]: Analyzing trace with hash 58767, now seen corresponding path program 1 times [2019-10-22 08:58:06,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:06,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378977980] [2019-10-22 08:58:06,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:06,621 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash -538152755, now seen corresponding path program 4 times [2019-10-22 08:58:06,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:06,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349509287] [2019-10-22 08:58:06,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:06,639 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:06,656 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:06,657 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:06,657 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:06,657 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:06,657 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:06,657 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:06,657 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:06,657 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:06,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration5_Loop [2019-10-22 08:58:06,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:06,657 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:06,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,718 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:06,718 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:06,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:06,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:06,727 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:06,727 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:06,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:06,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:06,734 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:06,734 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:06,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:06,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:06,742 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:06,742 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:06,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:06,769 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:06,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:06,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:06,909 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:06,911 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:06,911 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:06,911 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:06,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:06,911 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:06,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:06,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:06,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:06,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration5_Loop [2019-10-22 08:58:06,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:06,912 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:06,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,970 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:06,970 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:06,970 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-10-22 08:58:06,971 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,971 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,972 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,973 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:06,973 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:06,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,975 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-10-22 08:58:06,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,976 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,976 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,977 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:06,977 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:06,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,980 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-10-22 08:58:06,980 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,980 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,981 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,981 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,981 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,983 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-10-22 08:58:06,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,984 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,984 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,984 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,986 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:06,989 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:06,989 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:06,989 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:06,989 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:06,989 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:06,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-10-22 08:58:06,990 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:07,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:07,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:07,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:07,018 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-10-22 08:58:07,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:58:07,026 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-10-22 08:58:07,027 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-10-22 08:58:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-10-22 08:58:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2019-10-22 08:58:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:58:07,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:07,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2019-10-22 08:58:07,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:07,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2019-10-22 08:58:07,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:07,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 44 transitions. [2019-10-22 08:58:07,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:58:07,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:58:07,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-10-22 08:58:07,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:07,030 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-10-22 08:58:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-10-22 08:58:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-10-22 08:58:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:58:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-10-22 08:58:07,032 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-10-22 08:58:07,032 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-10-22 08:58:07,032 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:58:07,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2019-10-22 08:58:07,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:07,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:07,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:07,033 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2019-10-22 08:58:07,033 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:07,034 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-10-22 08:58:07,034 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-10-22 08:58:07,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,034 INFO L82 PathProgramCache]: Analyzing trace with hash -538152757, now seen corresponding path program 1 times [2019-10-22 08:58:07,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137266435] [2019-10-22 08:58:07,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,044 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash 67693, now seen corresponding path program 3 times [2019-10-22 08:58:07,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830643733] [2019-10-22 08:58:07,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,049 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1004170083, now seen corresponding path program 2 times [2019-10-22 08:58:07,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570476764] [2019-10-22 08:58:07,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:07,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570476764] [2019-10-22 08:58:07,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402442247] [2019-10-22 08:58:07,078 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:07,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:58:07,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:58:07,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:07,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:58:07,130 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:07,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-22 08:58:07,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163743831] [2019-10-22 08:58:07,144 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:07,144 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:07,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:07,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:07,144 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:07,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:07,145 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:07,145 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:07,145 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration6_Loop [2019-10-22 08:58:07,145 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:07,145 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:07,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:07,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:07,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:07,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-10-22 08:58:07,192 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:07,192 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:07,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:07,211 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:07,214 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:07,214 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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) [2019-10-22 08:58:07,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:07,220 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:07,224 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:07,224 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:07,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:07,229 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:07,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:07,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:07,562 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:07,563 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:07,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:07,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:07,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:07,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:07,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:07,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:07,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:07,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration6_Loop [2019-10-22 08:58:07,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:07,564 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:07,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:07,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:07,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:07,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-10-22 08:58:07,615 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:07,615 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:07,616 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-10-22 08:58:07,616 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:07,616 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:07,616 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:07,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:07,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:07,617 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:07,617 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:07,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:07,618 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-10-22 08:58:07,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:07,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:07,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:07,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:07,619 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:07,619 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:07,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:07,621 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-10-22 08:58:07,621 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:07,621 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:07,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:07,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:07,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:07,622 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:07,622 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:07,624 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:07,626 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:07,626 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:07,627 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:07,627 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:07,627 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:07,627 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-10-22 08:58:07,627 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:07,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,660 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:07,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:07,678 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-10-22 08:58:07,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-10-22 08:58:07,699 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-10-22 08:58:07,703 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-10-22 08:58:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 08:58:07,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:58:07,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:07,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2019-10-22 08:58:07,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:07,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:58:07,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:07,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 90 transitions. [2019-10-22 08:58:07,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:07,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 50 states and 68 transitions. [2019-10-22 08:58:07,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 08:58:07,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-10-22 08:58:07,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2019-10-22 08:58:07,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:07,711 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 68 transitions. [2019-10-22 08:58:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2019-10-22 08:58:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-10-22 08:58:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 08:58:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-10-22 08:58:07,714 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-10-22 08:58:07,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:07,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:58:07,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:58:07,717 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 8 states. [2019-10-22 08:58:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:07,783 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2019-10-22 08:58:07,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:07,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2019-10-22 08:58:07,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-10-22 08:58:07,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 62 transitions. [2019-10-22 08:58:07,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-10-22 08:58:07,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-10-22 08:58:07,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 62 transitions. [2019-10-22 08:58:07,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:07,785 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-10-22 08:58:07,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 62 transitions. [2019-10-22 08:58:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 23. [2019-10-22 08:58:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:58:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2019-10-22 08:58:07,786 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-10-22 08:58:07,786 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-10-22 08:58:07,786 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:58:07,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2019-10-22 08:58:07,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:58:07,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:07,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:07,787 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:07,788 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:07,788 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-10-22 08:58:07,788 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-10-22 08:58:07,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446527, now seen corresponding path program 2 times [2019-10-22 08:58:07,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132608101] [2019-10-22 08:58:07,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,797 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2016730719, now seen corresponding path program 1 times [2019-10-22 08:58:07,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701944103] [2019-10-22 08:58:07,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,804 INFO L82 PathProgramCache]: Analyzing trace with hash -504812577, now seen corresponding path program 3 times [2019-10-22 08:58:07,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669382365] [2019-10-22 08:58:07,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,815 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,849 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:07,849 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:07,850 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:07,850 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:07,850 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:07,850 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:07,850 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:07,850 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:07,850 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration7_Loop [2019-10-22 08:58:07,850 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:07,850 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:07,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:07,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:07,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-10-22 08:58:07,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:07,913 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:07,913 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:07,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:07,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:07,919 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:07,920 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:07,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:07,924 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:07,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:07,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:19,947 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-10-22 08:58:19,949 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:19,949 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:19,949 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:19,949 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:19,949 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:19,949 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:19,950 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:19,950 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:19,950 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration7_Loop [2019-10-22 08:58:19,950 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:19,950 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:19,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:19,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:19,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:19,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:20,050 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:20,050 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:20,050 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-10-22 08:58:20,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:20,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:20,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:20,056 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:20,060 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:20,062 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:20,062 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:20,062 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:20,063 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:20,063 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-10-22 08:58:20,063 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:20,146 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 08:58:20,146 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2019-10-22 08:58:20,174 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-10-22 08:58:20,174 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-10-22 08:58:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:58:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 08:58:20,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2019-10-22 08:58:20,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,175 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:20,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:20,238 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-10-22 08:58:20,238 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2019-10-22 08:58:20,310 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-10-22 08:58:20,311 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-10-22 08:58:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:58:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-10-22 08:58:20,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 6 letters. [2019-10-22 08:58:20,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2019-10-22 08:58:20,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 12 letters. [2019-10-22 08:58:20,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 79 transitions. [2019-10-22 08:58:20,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:20,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 43 states and 60 transitions. [2019-10-22 08:58:20,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:58:20,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:58:20,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 60 transitions. [2019-10-22 08:58:20,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:20,314 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-10-22 08:58:20,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 60 transitions. [2019-10-22 08:58:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2019-10-22 08:58:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 08:58:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-10-22 08:58:20,317 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-10-22 08:58:20,317 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-10-22 08:58:20,317 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:58:20,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 52 transitions. [2019-10-22 08:58:20,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:20,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:20,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:20,319 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:20,319 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:20,319 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-10-22 08:58:20,319 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-10-22 08:58:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 4 times [2019-10-22 08:58:20,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778807712] [2019-10-22 08:58:20,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,329 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash 51867, now seen corresponding path program 2 times [2019-10-22 08:58:20,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271248730] [2019-10-22 08:58:20,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,334 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:20,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1817399595, now seen corresponding path program 5 times [2019-10-22 08:58:20,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383167842] [2019-10-22 08:58:20,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,345 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:20,377 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:20,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:20,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:20,377 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:20,377 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:20,377 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:20,377 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:20,377 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:20,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration8_Loop [2019-10-22 08:58:20,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:20,378 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:20,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:20,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:20,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:20,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:20,445 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:20,445 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:20,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:20,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:20,452 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:20,452 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:20,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:20,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:20,460 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:20,460 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:20,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:20,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:20,468 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:20,468 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/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:20,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:20,472 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd0ac56-1c84-45ac-83b2-faf3cf6f533c/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-10-22 08:58:20,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:20,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:20,601 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:20,602 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:20,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:20,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:20,602 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:20,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:20,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:20,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:20,603 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:20,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration8_Loop [2019-10-22 08:58:20,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:20,603 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:20,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:20,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:20,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:20,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:20,653 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:20,653 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:20,654 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-10-22 08:58:20,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,655 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:20,655 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:20,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,658 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-10-22 08:58:20,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,659 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:20,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,659 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:20,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:20,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,661 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-10-22 08:58:20,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:20,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,663 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:20,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:20,665 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:20,666 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:20,667 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:20,667 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:20,667 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:20,667 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:20,667 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-10-22 08:58:20,668 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:20,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:20,699 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-10-22 08:58:20,699 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-10-22 08:58:20,707 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-10-22 08:58:20,709 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-10-22 08:58:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-10-22 08:58:20,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:58:20,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,710 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:20,740 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-10-22 08:58:20,740 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-10-22 08:58:20,753 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-10-22 08:58:20,754 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-10-22 08:58:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-10-22 08:58:20,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:58:20,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,755 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:20,783 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-10-22 08:58:20,783 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-10-22 08:58:20,791 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-10-22 08:58:20,792 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-10-22 08:58:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-10-22 08:58:20,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:58:20,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2019-10-22 08:58:20,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 6 letters. [2019-10-22 08:58:20,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 104 transitions. [2019-10-22 08:58:20,795 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:20,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2019-10-22 08:58:20,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:20,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:20,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:20,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:20,796 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:20,796 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:20,796 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:20,796 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:58:20,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:20,797 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:20,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:20,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:20 BoogieIcfgContainer [2019-10-22 08:58:20,803 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:20,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:20,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:20,804 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:20,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:03" (3/4) ... [2019-10-22 08:58:20,808 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:20,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:20,811 INFO L168 Benchmark]: Toolchain (without parser) took 17471.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 941.8 MB in the beginning and 864.8 MB in the end (delta: 77.0 MB). Peak memory consumption was 279.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,811 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 964.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:20,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,813 INFO L168 Benchmark]: Boogie Preprocessor took 17.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,813 INFO L168 Benchmark]: RCFGBuilder took 188.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,814 INFO L168 Benchmark]: BuchiAutomizer took 16923.77 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.1 GB in the beginning and 864.8 MB in the end (delta: 222.7 MB). Peak memory consumption was 313.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,815 INFO L168 Benchmark]: Witness Printer took 4.85 ms. Allocated memory is still 1.2 GB. Free memory is still 864.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:20,818 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 964.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 188.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16923.77 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.1 GB in the beginning and 864.8 MB in the end (delta: 222.7 MB). Peak memory consumption was 313.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.85 ms. Allocated memory is still 1.2 GB. Free memory is still 864.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (2 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + n and consists of 5 locations. One deterministic module has affine ranking function m + -1 * j and consists of 3 locations. One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function n + -1 * i and consists of 6 locations. One nondeterministic module has affine ranking function -1 * k + N and consists of 4 locations. One nondeterministic module has affine ranking function m + -1 * j and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.8s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 15.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. 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: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 13.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...