./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/Flip2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Flip2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/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 cda310f9ec541637625c4cf2e3662e22b6979f61 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:33:52,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:33:52,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:33:52,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:33:52,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:33:52,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:33:52,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:33:52,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:33:52,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:33:52,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:33:52,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:33:52,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:33:52,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:33:52,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:33:52,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:33:52,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:33:52,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:33:52,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:33:52,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:33:52,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:33:52,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:33:52,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:33:52,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:33:52,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:33:52,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:33:52,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:33:52,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:33:52,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:33:52,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:33:52,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:33:52,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:33:52,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:33:52,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:33:52,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:33:52,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:33:52,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:33:52,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:33:52,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:33:52,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:33:52,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:33:52,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:33:52,496 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:33:52,527 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:33:52,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:33:52,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:33:52,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:33:52,531 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:33:52,531 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:33:52,531 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:33:52,532 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:33:52,532 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:33:52,532 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:33:52,533 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:33:52,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:33:52,534 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:33:52,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:33:52,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:33:52,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:33:52,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:33:52,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:33:52,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:33:52,537 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:33:52,537 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:33:52,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:33:52,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:33:52,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:33:52,539 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:33:52,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:33:52,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:33:52,539 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:33:52,540 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:33:52,540 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/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 -> cda310f9ec541637625c4cf2e3662e22b6979f61 [2019-11-15 23:33:52,578 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:33:52,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:33:52,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:33:52,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:33:52,594 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:33:52,595 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/../../sv-benchmarks/c/termination-restricted-15/Flip2.c [2019-11-15 23:33:52,644 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/data/3309e5a1f/0f8ec2fbf0914b54b8e4615614b5e962/FLAG4d6b9b4fe [2019-11-15 23:33:53,044 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:33:53,045 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/sv-benchmarks/c/termination-restricted-15/Flip2.c [2019-11-15 23:33:53,050 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/data/3309e5a1f/0f8ec2fbf0914b54b8e4615614b5e962/FLAG4d6b9b4fe [2019-11-15 23:33:53,062 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/data/3309e5a1f/0f8ec2fbf0914b54b8e4615614b5e962 [2019-11-15 23:33:53,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:33:53,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:33:53,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:53,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:33:53,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:33:53,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:53" (1/1) ... [2019-11-15 23:33:53,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d53c513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53, skipping insertion in model container [2019-11-15 23:33:53,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:53" (1/1) ... [2019-11-15 23:33:53,083 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:33:53,103 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:33:53,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:53,406 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:33:53,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:53,442 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:33:53,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53 WrapperNode [2019-11-15 23:33:53,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:53,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:33:53,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:33:53,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:33:53,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53" (1/1) ... [2019-11-15 23:33:53,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53" (1/1) ... [2019-11-15 23:33:53,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:33:53,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:33:53,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:33:53,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:33:53,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53" (1/1) ... [2019-11-15 23:33:53,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53" (1/1) ... [2019-11-15 23:33:53,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53" (1/1) ... [2019-11-15 23:33:53,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53" (1/1) ... [2019-11-15 23:33:53,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53" (1/1) ... [2019-11-15 23:33:53,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53" (1/1) ... [2019-11-15 23:33:53,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53" (1/1) ... [2019-11-15 23:33:53,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:33:53,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:33:53,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:33:53,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:33:53,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:33:53,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:33:53,709 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:33:53,709 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 23:33:53,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:53 BoogieIcfgContainer [2019-11-15 23:33:53,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:33:53,711 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:33:53,711 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:33:53,714 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:33:53,715 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:33:53,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:33:53" (1/3) ... [2019-11-15 23:33:53,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bbe0fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:33:53, skipping insertion in model container [2019-11-15 23:33:53,717 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:33:53,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:53" (2/3) ... [2019-11-15 23:33:53,718 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bbe0fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:33:53, skipping insertion in model container [2019-11-15 23:33:53,718 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:33:53,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:53" (3/3) ... [2019-11-15 23:33:53,720 INFO L371 chiAutomizerObserver]: Analyzing ICFG Flip2.c [2019-11-15 23:33:53,768 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:33:53,780 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:33:53,781 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:33:53,781 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:33:53,781 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:33:53,781 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:33:53,781 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:33:53,782 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:33:53,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-15 23:33:53,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:33:53,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:53,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:53,851 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 23:33:53,851 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:33:53,851 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:33:53,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-15 23:33:53,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:33:53,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:53,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:53,853 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 23:33:53,853 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:33:53,876 INFO L791 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 6#L19-2true [2019-11-15 23:33:53,876 INFO L793 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~i~0 > 0 && main_~j~0 > 0); 10#L14true assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 6#L19-2true [2019-11-15 23:33:53,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:53,882 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 23:33:53,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:53,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363101576] [2019-11-15 23:33:53,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:53,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:53,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:54,013 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:54,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:54,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-11-15 23:33:54,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:54,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807697603] [2019-11-15 23:33:54,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:54,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:54,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:54,058 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:54,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:54,060 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-11-15 23:33:54,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:54,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958225751] [2019-11-15 23:33:54,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:54,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:54,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:54,088 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:54,167 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:54,167 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:54,167 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:54,168 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:54,168 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:33:54,168 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:54,168 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:54,168 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:54,168 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2.c_Iteration1_Loop [2019-11-15 23:33:54,168 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:54,168 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:54,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:54,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:54,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:54,345 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:54,346 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/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-11-15 23:33:54,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:33:54,352 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:33:54,359 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:33:54,360 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/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-11-15 23:33:54,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:33:54,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:33:54,374 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:33:54,374 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:33:54,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:33:54,389 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:33:54,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:33:54,423 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:54,706 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:33:54,708 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:54,708 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:54,709 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:54,709 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:54,709 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:33:54,709 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:54,709 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:54,709 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:54,709 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2.c_Iteration1_Loop [2019-11-15 23:33:54,709 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:54,709 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:54,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:54,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:54,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:54,839 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:54,844 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:33:54,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:33:54,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:54,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:54,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:54,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:54,851 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:54,851 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:54,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:54,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:33:54,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:54,862 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:54,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:54,862 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:54,866 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:54,866 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:54,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:54,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:33:54,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:54,881 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:33:54,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:54,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:54,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:54,883 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:33:54,883 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:33:54,918 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:33:54,934 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:33:54,935 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:33:54,937 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:33:54,937 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:33:54,937 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:33:54,938 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-15 23:33:54,940 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:33:54,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:54,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:33:54,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:54,982 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:33:54,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:55,010 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:33:55,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-11-15 23:33:55,067 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 30 states and 43 transitions. Complement of second has 8 states. [2019-11-15 23:33:55,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:33:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:33:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-11-15 23:33:55,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-15 23:33:55,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:55,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-15 23:33:55,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:55,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-15 23:33:55,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:55,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2019-11-15 23:33:55,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:33:55,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 13 states and 19 transitions. [2019-11-15 23:33:55,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 23:33:55,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:33:55,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-15 23:33:55,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:55,083 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-15 23:33:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-15 23:33:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-15 23:33:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:33:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2019-11-15 23:33:55,109 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-11-15 23:33:55,109 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-11-15 23:33:55,109 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:33:55,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2019-11-15 23:33:55,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:33:55,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:55,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:55,110 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:33:55,111 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:33:55,111 INFO L791 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 76#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 78#L14 [2019-11-15 23:33:55,111 INFO L793 eck$LassoCheckResult]: Loop: 78#L14 assume !(main_~i~0 < main_~j~0); 84#L19 assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; 77#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 78#L14 [2019-11-15 23:33:55,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:55,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-11-15 23:33:55,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:55,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089202762] [2019-11-15 23:33:55,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,131 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash 44836, now seen corresponding path program 1 times [2019-11-15 23:33:55,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:55,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076131460] [2019-11-15 23:33:55,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,152 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:55,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:55,155 INFO L82 PathProgramCache]: Analyzing trace with hash 29865627, now seen corresponding path program 1 times [2019-11-15 23:33:55,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:55,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060502162] [2019-11-15 23:33:55,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,166 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:55,199 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:55,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:55,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:55,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:55,200 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:33:55,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:55,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:55,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:55,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2.c_Iteration2_Loop [2019-11-15 23:33:55,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:55,200 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:55,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:55,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:55,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:55,287 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:55,287 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/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) [2019-11-15 23:33:55,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:33:55,294 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:55,305 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:33:55,305 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/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) [2019-11-15 23:33:55,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:33:55,313 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:55,320 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:33:55,321 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:55,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:33:55,338 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:55,358 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:33:55,358 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:33:55,474 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:33:55,476 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:55,477 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:55,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:55,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:55,477 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:33:55,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:55,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:55,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:55,478 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2.c_Iteration2_Loop [2019-11-15 23:33:55,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:55,478 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:55,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:55,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:55,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:55,564 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:55,565 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:33:55,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:33:55,566 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:55,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:55,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:55,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:55,568 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:55,568 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:55,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:55,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:33:55,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:55,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:55,574 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:55,574 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:55,576 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:55,576 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:55,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:55,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:33:55,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:55,582 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:33:55,582 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:55,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:55,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:55,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:33:55,583 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:33:55,594 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:33:55,598 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:33:55,598 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:33:55,599 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:33:55,599 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:33:55,599 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:33:55,599 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:33:55,600 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:33:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:55,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:33:55,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:55,619 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:33:55,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:55,641 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:33:55,641 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-15 23:33:55,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 34 states and 49 transitions. Complement of second has 7 states. [2019-11-15 23:33:55,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:33:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:33:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-11-15 23:33:55,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-15 23:33:55,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:55,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 23:33:55,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:55,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-15 23:33:55,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:55,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2019-11-15 23:33:55,688 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 23:33:55,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 30 states and 44 transitions. [2019-11-15 23:33:55,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:33:55,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 23:33:55,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2019-11-15 23:33:55,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:55,690 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-11-15 23:33:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2019-11-15 23:33:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 23:33:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 23:33:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2019-11-15 23:33:55,694 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2019-11-15 23:33:55,694 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2019-11-15 23:33:55,694 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:33:55,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 37 transitions. [2019-11-15 23:33:55,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 23:33:55,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:55,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:55,699 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:33:55,699 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:33:55,700 INFO L791 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 161#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 173#L14 assume !(main_~i~0 < main_~j~0); 166#L19 [2019-11-15 23:33:55,700 INFO L793 eck$LassoCheckResult]: Loop: 166#L19 assume main_~i~0 > main_~j~0;main_~j~0 := main_~i~0; 167#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 179#L14 assume !(main_~i~0 < main_~j~0); 166#L19 [2019-11-15 23:33:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-15 23:33:55,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:55,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575387687] [2019-11-15 23:33:55,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,724 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash 47414, now seen corresponding path program 1 times [2019-11-15 23:33:55,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:55,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999300335] [2019-11-15 23:33:55,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,747 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:55,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:55,747 INFO L82 PathProgramCache]: Analyzing trace with hash 925832530, now seen corresponding path program 1 times [2019-11-15 23:33:55,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:55,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469363033] [2019-11-15 23:33:55,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:55,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:55,764 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:55,797 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:55,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:55,797 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:55,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:55,798 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:33:55,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:55,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:55,798 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:55,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2.c_Iteration3_Loop [2019-11-15 23:33:55,798 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:55,798 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:55,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:55,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:55,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:55,867 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:55,867 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:33:55,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:33:55,887 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:55,892 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:33:55,892 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:33:55,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:33:55,915 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:55,922 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:33:55,922 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/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) [2019-11-15 23:33:55,937 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:33:55,938 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:33:55,960 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:33:55,961 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 [2019-11-15 23:33:56,211 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:33:56,213 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:56,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:56,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:56,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:56,214 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:33:56,214 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:56,214 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:56,214 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:56,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2.c_Iteration3_Loop [2019-11-15 23:33:56,214 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:56,214 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:56,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:56,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:56,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:56,285 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:56,285 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:33:56,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:33:56,287 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:56,287 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:56,287 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:56,287 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:56,289 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:56,289 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:56,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:56,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:33:56,294 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:56,294 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:33:56,294 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:56,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:56,295 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:56,295 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:33:56,296 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:33:56,301 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:33:56,306 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:33:56,312 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:33:56,312 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:33:56,313 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:33:56,313 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:33:56,313 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-15 23:33:56,314 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:33:56,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:56,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:33:56,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:56,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:33:56,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:56,371 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:33:56,371 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 37 transitions. cyclomatic complexity: 19 Second operand 3 states. [2019-11-15 23:33:56,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 37 transitions. cyclomatic complexity: 19. Second operand 3 states. Result 62 states and 91 transitions. Complement of second has 5 states. [2019-11-15 23:33:56,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:33:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:33:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-11-15 23:33:56,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-15 23:33:56,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:56,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 23:33:56,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:56,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-15 23:33:56,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:56,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 91 transitions. [2019-11-15 23:33:56,396 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-11-15 23:33:56,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 55 states and 80 transitions. [2019-11-15 23:33:56,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 23:33:56,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 23:33:56,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 80 transitions. [2019-11-15 23:33:56,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:56,399 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-15 23:33:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 80 transitions. [2019-11-15 23:33:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-11-15 23:33:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 23:33:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2019-11-15 23:33:56,404 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 60 transitions. [2019-11-15 23:33:56,404 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 60 transitions. [2019-11-15 23:33:56,404 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:33:56,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 60 transitions. [2019-11-15 23:33:56,405 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-11-15 23:33:56,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:56,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:56,406 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-11-15 23:33:56,406 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:33:56,406 INFO L791 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 286#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 316#L14 assume !(main_~i~0 < main_~j~0); 291#L19 assume main_~i~0 > main_~j~0;main_~j~0 := main_~i~0; 292#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 304#L14 assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 299#L19-2 [2019-11-15 23:33:56,407 INFO L793 eck$LassoCheckResult]: Loop: 299#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 309#L14 assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 299#L19-2 [2019-11-15 23:33:56,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:56,407 INFO L82 PathProgramCache]: Analyzing trace with hash 925832528, now seen corresponding path program 1 times [2019-11-15 23:33:56,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:56,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641871353] [2019-11-15 23:33:56,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:56,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:56,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:56,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641871353] [2019-11-15 23:33:56,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:56,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:33:56,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753987019] [2019-11-15 23:33:56,442 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:33:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-11-15 23:33:56,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:56,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771100232] [2019-11-15 23:33:56,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:56,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:56,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:56,448 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:56,495 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:56,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:56,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:56,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:56,496 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:33:56,496 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:56,496 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:56,496 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:56,496 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2.c_Iteration4_Loop [2019-11-15 23:33:56,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:56,497 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:56,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:56,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:56,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:56,586 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:56,586 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:56,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:33:56,591 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:56,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:33:56,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:33:57,607 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:33:57,609 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:57,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:57,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:57,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:57,609 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:33:57,609 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:57,609 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:57,609 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:57,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2.c_Iteration4_Loop [2019-11-15 23:33:57,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:57,610 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:57,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:57,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:57,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:57,710 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:57,710 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:33:57,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:33:57,711 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:57,711 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:33:57,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:57,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:57,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:57,713 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:33:57,713 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:33:57,718 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:33:57,724 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:33:57,724 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:33:57,724 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:33:57,724 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:33:57,724 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:33:57,725 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-15 23:33:57,725 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:33:57,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:57,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:33:57,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:57,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:33:57,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:57,781 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:33:57,781 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 60 transitions. cyclomatic complexity: 29 Second operand 3 states. [2019-11-15 23:33:57,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 60 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 73 states and 104 transitions. Complement of second has 7 states. [2019-11-15 23:33:57,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:33:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:33:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-15 23:33:57,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 23:33:57,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:57,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 23:33:57,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:57,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:33:57,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:57,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 104 transitions. [2019-11-15 23:33:57,805 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-11-15 23:33:57,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 57 states and 83 transitions. [2019-11-15 23:33:57,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 23:33:57,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 23:33:57,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 83 transitions. [2019-11-15 23:33:57,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:57,807 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 83 transitions. [2019-11-15 23:33:57,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 83 transitions. [2019-11-15 23:33:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2019-11-15 23:33:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 23:33:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-11-15 23:33:57,812 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-11-15 23:33:57,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:57,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:57,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:57,815 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 3 states. [2019-11-15 23:33:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:57,832 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2019-11-15 23:33:57,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:57,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2019-11-15 23:33:57,833 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2019-11-15 23:33:57,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 46 states and 63 transitions. [2019-11-15 23:33:57,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 23:33:57,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-15 23:33:57,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 63 transitions. [2019-11-15 23:33:57,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:57,835 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-11-15 23:33:57,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 63 transitions. [2019-11-15 23:33:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-11-15 23:33:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 23:33:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2019-11-15 23:33:57,840 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 61 transitions. [2019-11-15 23:33:57,840 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 61 transitions. [2019-11-15 23:33:57,840 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:33:57,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 61 transitions. [2019-11-15 23:33:57,841 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2019-11-15 23:33:57,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:57,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:57,842 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-11-15 23:33:57,842 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:33:57,842 INFO L791 eck$LassoCheckResult]: Stem: 539#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 540#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 567#L14 assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 568#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 570#L14 assume !(main_~i~0 < main_~j~0); 581#L19 assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; 541#L19-2 [2019-11-15 23:33:57,842 INFO L793 eck$LassoCheckResult]: Loop: 541#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 542#L14 assume !(main_~i~0 < main_~j~0); 545#L19 assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; 541#L19-2 [2019-11-15 23:33:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash 925765420, now seen corresponding path program 1 times [2019-11-15 23:33:57,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:57,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377186854] [2019-11-15 23:33:57,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:57,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:57,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:57,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377186854] [2019-11-15 23:33:57,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:57,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:33:57,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907832569] [2019-11-15 23:33:57,872 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:33:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash 39886, now seen corresponding path program 2 times [2019-11-15 23:33:57,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:57,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410067257] [2019-11-15 23:33:57,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:57,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:57,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:57,878 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:57,903 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:57,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:57,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:57,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:57,904 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:33:57,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:57,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:57,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:57,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2.c_Iteration5_Loop [2019-11-15 23:33:57,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:57,904 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:57,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:57,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-11-15 23:33:57,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-11-15 23:33:57,969 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:57,969 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/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-11-15 23:33:57,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:33:57,974 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/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) [2019-11-15 23:33:57,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:33:57,989 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:58,000 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:33:58,002 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:58,002 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:58,002 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:58,002 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:58,002 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:33:58,002 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:58,002 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:58,003 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:58,003 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2.c_Iteration5_Loop [2019-11-15 23:33:58,003 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:58,003 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:58,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:58,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:58,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:33:58,052 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:58,053 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:33:58,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:33:58,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:58,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:58,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:58,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:58,056 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:58,056 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:58,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:58,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:33:58,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:58,059 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:33:58,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:58,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:58,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:58,084 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:33:58,084 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:33:58,088 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:33:58,095 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:33:58,095 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:33:58,095 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:33:58,096 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:33:58,096 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:33:58,096 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:33:58,097 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:33:58,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:58,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:33:58,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:58,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:33:58,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:58,133 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:33:58,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 61 transitions. cyclomatic complexity: 26 Second operand 3 states. [2019-11-15 23:33:58,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 61 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 81 states and 106 transitions. Complement of second has 5 states. [2019-11-15 23:33:58,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:33:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:33:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-11-15 23:33:58,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 23:33:58,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:58,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 23:33:58,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:58,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-15 23:33:58,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:58,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 106 transitions. [2019-11-15 23:33:58,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 23:33:58,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 60 states and 81 transitions. [2019-11-15 23:33:58,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 23:33:58,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 23:33:58,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2019-11-15 23:33:58,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:58,160 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-11-15 23:33:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2019-11-15 23:33:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2019-11-15 23:33:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 23:33:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2019-11-15 23:33:58,164 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 69 transitions. [2019-11-15 23:33:58,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:58,164 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand 3 states. [2019-11-15 23:33:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:58,188 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-15 23:33:58,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:58,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2019-11-15 23:33:58,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:33:58,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 49 states and 62 transitions. [2019-11-15 23:33:58,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 23:33:58,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-15 23:33:58,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 62 transitions. [2019-11-15 23:33:58,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:58,193 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 62 transitions. [2019-11-15 23:33:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 62 transitions. [2019-11-15 23:33:58,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2019-11-15 23:33:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 23:33:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-11-15 23:33:58,196 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-15 23:33:58,196 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-15 23:33:58,196 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:33:58,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2019-11-15 23:33:58,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:33:58,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:58,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:58,203 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-11-15 23:33:58,203 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1] [2019-11-15 23:33:58,203 INFO L791 eck$LassoCheckResult]: Stem: 814#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 815#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 835#L14 assume !(main_~i~0 < main_~j~0); 823#L19 assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; 824#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 817#L14 assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 828#L19-2 [2019-11-15 23:33:58,203 INFO L793 eck$LassoCheckResult]: Loop: 828#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 826#L14 assume !(main_~i~0 < main_~j~0); 827#L19 assume main_~i~0 > main_~j~0;main_~j~0 := main_~i~0; 838#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 841#L14 assume !(main_~i~0 < main_~j~0); 821#L19 assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; 822#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 840#L14 assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 828#L19-2 [2019-11-15 23:33:58,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash 925834450, now seen corresponding path program 2 times [2019-11-15 23:33:58,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:58,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714855107] [2019-11-15 23:33:58,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:58,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:58,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:58,213 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:58,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:58,214 INFO L82 PathProgramCache]: Analyzing trace with hash -606540634, now seen corresponding path program 1 times [2019-11-15 23:33:58,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:58,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211602108] [2019-11-15 23:33:58,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:58,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:58,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:58,225 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:58,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:58,225 INFO L82 PathProgramCache]: Analyzing trace with hash -66410377, now seen corresponding path program 1 times [2019-11-15 23:33:58,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:58,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074175187] [2019-11-15 23:33:58,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:58,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:58,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:58,243 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:58,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:33:58 BoogieIcfgContainer [2019-11-15 23:33:58,408 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:33:58,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:33:58,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:33:58,408 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:33:58,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:53" (3/4) ... [2019-11-15 23:33:58,411 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 23:33:58,468 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_68f3d367-17cf-481a-8e6b-519d78c16afd/bin/uautomizer/witness.graphml [2019-11-15 23:33:58,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:33:58,470 INFO L168 Benchmark]: Toolchain (without parser) took 5404.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -221.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:58,471 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:58,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:58,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:58,472 INFO L168 Benchmark]: Boogie Preprocessor took 19.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:58,473 INFO L168 Benchmark]: RCFGBuilder took 208.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:58,474 INFO L168 Benchmark]: BuchiAutomizer took 4696.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -36.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:58,474 INFO L168 Benchmark]: Witness Printer took 60.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:58,477 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 208.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4696.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -36.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Witness Printer took 60.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. 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 7 terminating modules (2 trivial, 5 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function j and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i + -1 * j and consists of 3 locations. One deterministic module has affine ranking function j and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 37 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 3.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 60 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 44 states and ocurred in iteration 4. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 33 SDslu, 6 SDs, 0 SdLazy, 81 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax176 hnf97 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf92 smp100 dnf100 smp100 tf109 neg100 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.9s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 13]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {t=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b2bb9ca=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7988f59b=0, i=2, j=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 13]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] int t; [L9] i = __VERIFIER_nondet_int() [L10] j = __VERIFIER_nondet_int() [L11] t = 0 [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t Loop: [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND TRUE i > j [L20] j = i [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...