./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Narrowing.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --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 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:02:07,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:02:07,596 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-26 12:02:07,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:02:07,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:02:07,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:02:07,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:02:07,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:02:07,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:02:07,656 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:02:07,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:02:07,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:02:07,658 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:02:07,661 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-26 12:02:07,661 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-26 12:02:07,662 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-26 12:02:07,662 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-26 12:02:07,663 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-26 12:02:07,663 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-26 12:02:07,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:02:07,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-26 12:02:07,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:02:07,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:02:07,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-26 12:02:07,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-26 12:02:07,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-26 12:02:07,668 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:02:07,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:02:07,669 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-26 12:02:07,669 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:02:07,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:02:07,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:02:07,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:02:07,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:02:07,672 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-26 12:02:07,673 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac [2023-11-26 12:02:08,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:02:08,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:02:08,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:02:08,046 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:02:08,047 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:02:08,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2023-11-26 12:02:11,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:02:11,533 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:02:11,534 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2023-11-26 12:02:11,542 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/data/720afd4ff/75fe419cca20434185f878b8a02834df/FLAG7320e6cdc [2023-11-26 12:02:11,555 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/data/720afd4ff/75fe419cca20434185f878b8a02834df [2023-11-26 12:02:11,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:02:11,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:02:11,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:11,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:02:11,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:02:11,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703b406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11, skipping insertion in model container [2023-11-26 12:02:11,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,590 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:02:11,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:11,729 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:02:11,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:11,757 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:02:11,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11 WrapperNode [2023-11-26 12:02:11,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:11,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:11,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:02:11,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:02:11,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,788 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2023-11-26 12:02:11,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:11,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:02:11,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:02:11,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:02:11,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,809 INFO L175 MemorySlicer]: No memory access in input program. [2023-11-26 12:02:11,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:02:11,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:02:11,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:02:11,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:02:11,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:11,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:11,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:11,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-26 12:02:11,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:02:11,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:02:11,973 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:02:11,975 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:02:12,065 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:02:12,081 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:02:12,095 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 12:02:12,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:12 BoogieIcfgContainer [2023-11-26 12:02:12,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:02:12,098 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-26 12:02:12,098 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-26 12:02:12,102 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-26 12:02:12,103 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 12:02:12,103 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.11 12:02:11" (1/3) ... [2023-11-26 12:02:12,104 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f1b43a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 12:02:12, skipping insertion in model container [2023-11-26 12:02:12,104 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 12:02:12,105 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (2/3) ... [2023-11-26 12:02:12,105 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f1b43a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 12:02:12, skipping insertion in model container [2023-11-26 12:02:12,105 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 12:02:12,105 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:12" (3/3) ... [2023-11-26 12:02:12,107 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2023-11-26 12:02:12,169 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-26 12:02:12,171 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-26 12:02:12,172 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-26 12:02:12,172 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-26 12:02:12,172 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-26 12:02:12,172 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-26 12:02:12,173 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-26 12:02:12,173 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-26 12:02:12,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:12,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-26 12:02:12,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:12,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:12,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:02:12,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:02:12,202 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-26 12:02:12,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:12,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-26 12:02:12,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:12,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:12,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:02:12,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:02:12,212 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4#L26-1true [2023-11-26 12:02:12,213 INFO L750 eck$LassoCheckResult]: Loop: 4#L26-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 11#L14true assume !(0 == main_~i~0#1); 12#L14-2true assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9#L17-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 7#L20-1true assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10#L23-1true assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4#L26-1true [2023-11-26 12:02:12,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-26 12:02:12,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:12,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495645717] [2023-11-26 12:02:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:12,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:12,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:12,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2023-11-26 12:02:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:12,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243659006] [2023-11-26 12:02:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:12,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:12,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:12,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243659006] [2023-11-26 12:02:12,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243659006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:12,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:12,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:02:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333180308] [2023-11-26 12:02:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:12,510 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 12:02:12,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:12,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:12,552 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:12,586 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2023-11-26 12:02:12,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. [2023-11-26 12:02:12,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-11-26 12:02:12,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 23 transitions. [2023-11-26 12:02:12,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-26 12:02:12,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-26 12:02:12,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2023-11-26 12:02:12,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:12,598 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-11-26 12:02:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2023-11-26 12:02:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-26 12:02:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2023-11-26 12:02:12,628 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-11-26 12:02:12,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:12,633 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-11-26 12:02:12,633 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-26 12:02:12,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2023-11-26 12:02:12,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-11-26 12:02:12,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:12,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:12,635 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:02:12,635 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:02:12,636 INFO L748 eck$LassoCheckResult]: Stem: 43#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 44#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 48#L26-1 [2023-11-26 12:02:12,636 INFO L750 eck$LassoCheckResult]: Loop: 48#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 54#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 51#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 49#L17-1 assume !(1 == main_~up~0#1); 50#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 46#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 48#L26-1 [2023-11-26 12:02:12,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-26 12:02:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568380760] [2023-11-26 12:02:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:12,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:12,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2023-11-26 12:02:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:12,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349300028] [2023-11-26 12:02:12,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:12,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349300028] [2023-11-26 12:02:12,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349300028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:12,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:12,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:02:12,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773189695] [2023-11-26 12:02:12,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:12,714 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 12:02:12,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:12,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:12,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:12,716 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. cyclomatic complexity: 10 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:12,790 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2023-11-26 12:02:12,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2023-11-26 12:02:12,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-11-26 12:02:12,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2023-11-26 12:02:12,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2023-11-26 12:02:12,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-11-26 12:02:12,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2023-11-26 12:02:12,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:12,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-11-26 12:02:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2023-11-26 12:02:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-26 12:02:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 37 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2023-11-26 12:02:12,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-11-26 12:02:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:12,806 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2023-11-26 12:02:12,807 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-26 12:02:12,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2023-11-26 12:02:12,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-11-26 12:02:12,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:12,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:12,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:02:12,810 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:02:12,810 INFO L748 eck$LassoCheckResult]: Stem: 102#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 110#L26-1 [2023-11-26 12:02:12,810 INFO L750 eck$LassoCheckResult]: Loop: 110#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 125#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 119#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 115#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 116#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 121#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 110#L26-1 [2023-11-26 12:02:12,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-26 12:02:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:12,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044157463] [2023-11-26 12:02:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:12,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2023-11-26 12:02:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:12,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285228209] [2023-11-26 12:02:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:12,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:12,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285228209] [2023-11-26 12:02:12,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285228209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:12,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:12,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:02:12,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969591055] [2023-11-26 12:02:12,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:12,859 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 12:02:12,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:12,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:12,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:12,860 INFO L87 Difference]: Start difference. First operand 38 states and 61 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:12,878 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2023-11-26 12:02:12,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2023-11-26 12:02:12,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-11-26 12:02:12,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2023-11-26 12:02:12,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2023-11-26 12:02:12,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-11-26 12:02:12,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2023-11-26 12:02:12,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:12,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2023-11-26 12:02:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2023-11-26 12:02:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-11-26 12:02:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2023-11-26 12:02:12,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-11-26 12:02:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:12,890 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-11-26 12:02:12,890 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-26 12:02:12,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2023-11-26 12:02:12,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2023-11-26 12:02:12,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:12,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:12,893 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 12:02:12,893 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:02:12,893 INFO L748 eck$LassoCheckResult]: Stem: 184#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 188#L26-1 [2023-11-26 12:02:12,893 INFO L750 eck$LassoCheckResult]: Loop: 188#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 199#L14 assume !(0 == main_~i~0#1); 205#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 203#L17-1 assume !(1 == main_~up~0#1); 202#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 200#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 188#L26-1 [2023-11-26 12:02:12,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:12,894 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-26 12:02:12,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:12,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054195657] [2023-11-26 12:02:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:12,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:12,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:12,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2023-11-26 12:02:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:12,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796172043] [2023-11-26 12:02:12,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:12,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:12,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2023-11-26 12:02:12,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:12,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304358575] [2023-11-26 12:02:12,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:12,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:13,129 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 12:02:13,130 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 12:02:13,130 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 12:02:13,131 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 12:02:13,131 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-26 12:02:13,131 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:13,131 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 12:02:13,131 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 12:02:13,132 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2023-11-26 12:02:13,132 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 12:02:13,132 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 12:02:13,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:13,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:13,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:13,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:13,277 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-26 12:02:13,278 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-26 12:02:13,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:13,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:13,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:13,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-26 12:02:13,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-26 12:02:13,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 12:02:13,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-11-26 12:02:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:13,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:13,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-26 12:02:13,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-26 12:02:13,325 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 12:02:13,360 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-26 12:02:13,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:13,366 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 12:02:13,366 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 12:02:13,366 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 12:02:13,366 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 12:02:13,367 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-26 12:02:13,367 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:13,367 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 12:02:13,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 12:02:13,367 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2023-11-26 12:02:13,367 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 12:02:13,367 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 12:02:13,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:13,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:13,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:13,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:13,507 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-26 12:02:13,512 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-26 12:02:13,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:13,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:13,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:13,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-26 12:02:13,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:02:13,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:02:13,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 12:02:13,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:02:13,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:02:13,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:02:13,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 12:02:13,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 12:02:13,555 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-26 12:02:13,562 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-26 12:02:13,562 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-26 12:02:13,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:13,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:13,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:13,614 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-26 12:02:13,614 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-26 12:02:13,614 INFO L513 LassoAnalysis]: Proved termination. [2023-11-26 12:02:13,615 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-11-26 12:02:13,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-26 12:02:13,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:13,627 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-26 12:02:13,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 12:02:13,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:02:13,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:13,774 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-26 12:02:13,776 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:13,864 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 152 transitions. Complement of second has 7 states. [2023-11-26 12:02:13,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-26 12:02:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-11-26 12:02:13,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2023-11-26 12:02:13,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:02:13,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2023-11-26 12:02:13,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:02:13,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2023-11-26 12:02:13,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:02:13,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2023-11-26 12:02:13,880 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2023-11-26 12:02:13,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2023-11-26 12:02:13,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2023-11-26 12:02:13,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2023-11-26 12:02:13,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2023-11-26 12:02:13,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 12:02:13,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2023-11-26 12:02:13,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2023-11-26 12:02:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2023-11-26 12:02:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2023-11-26 12:02:13,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2023-11-26 12:02:13,909 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2023-11-26 12:02:13,910 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-26 12:02:13,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2023-11-26 12:02:13,914 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2023-11-26 12:02:13,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:13,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:13,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-26 12:02:13,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:02:13,918 INFO L748 eck$LassoCheckResult]: Stem: 365#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 366#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 376#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 384#L14 [2023-11-26 12:02:13,919 INFO L750 eck$LassoCheckResult]: Loop: 384#L14 assume !(0 == main_~i~0#1); 435#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 431#L17-1 assume !(1 == main_~up~0#1); 428#L20-1 assume !(0 == main_~up~0#1); 424#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 423#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 384#L14 [2023-11-26 12:02:13,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2023-11-26 12:02:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:13,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666279789] [2023-11-26 12:02:13,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:13,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:13,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:13,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:13,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2023-11-26 12:02:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:13,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517945721] [2023-11-26 12:02:13,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:13,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:13,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:13,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:13,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:13,941 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2023-11-26 12:02:13,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:13,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184332744] [2023-11-26 12:02:13,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:13,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:13,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:13,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184332744] [2023-11-26 12:02:13,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184332744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:13,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:13,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:02:13,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055465692] [2023-11-26 12:02:13,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:14,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:14,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:14,021 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. cyclomatic complexity: 54 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:14,035 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2023-11-26 12:02:14,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2023-11-26 12:02:14,036 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2023-11-26 12:02:14,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2023-11-26 12:02:14,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-11-26 12:02:14,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-11-26 12:02:14,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2023-11-26 12:02:14,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 12:02:14,039 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2023-11-26 12:02:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2023-11-26 12:02:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2023-11-26 12:02:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2023-11-26 12:02:14,045 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2023-11-26 12:02:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:14,046 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2023-11-26 12:02:14,047 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-26 12:02:14,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2023-11-26 12:02:14,048 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-11-26 12:02:14,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:14,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:14,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-26 12:02:14,049 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:02:14,049 INFO L748 eck$LassoCheckResult]: Stem: 539#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 540#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 550#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 568#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 582#L14-2 [2023-11-26 12:02:14,049 INFO L750 eck$LassoCheckResult]: Loop: 582#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 593#L17-1 assume !(1 == main_~up~0#1); 591#L20-1 assume !(0 == main_~up~0#1); 588#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 535#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 536#L14 assume !(0 == main_~i~0#1); 582#L14-2 [2023-11-26 12:02:14,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2023-11-26 12:02:14,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:14,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614747083] [2023-11-26 12:02:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:14,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:14,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:14,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:14,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2023-11-26 12:02:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:14,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700726108] [2023-11-26 12:02:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:14,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:14,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:14,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2023-11-26 12:02:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:14,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314557654] [2023-11-26 12:02:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:14,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:14,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:14,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314557654] [2023-11-26 12:02:14,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314557654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:14,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:14,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:02:14,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550988806] [2023-11-26 12:02:14,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:14,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:14,164 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:14,177 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2023-11-26 12:02:14,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2023-11-26 12:02:14,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-26 12:02:14,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2023-11-26 12:02:14,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-11-26 12:02:14,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-11-26 12:02:14,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2023-11-26 12:02:14,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 12:02:14,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2023-11-26 12:02:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2023-11-26 12:02:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2023-11-26 12:02:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2023-11-26 12:02:14,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2023-11-26 12:02:14,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:14,202 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2023-11-26 12:02:14,202 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-26 12:02:14,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2023-11-26 12:02:14,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-26 12:02:14,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:14,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:14,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-26 12:02:14,204 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:02:14,204 INFO L748 eck$LassoCheckResult]: Stem: 661#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 662#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 675#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 658#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 676#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 682#L17-1 [2023-11-26 12:02:14,204 INFO L750 eck$LassoCheckResult]: Loop: 682#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 663#L20-1 assume !(0 == main_~up~0#1); 664#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 689#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 690#L14 assume !(0 == main_~i~0#1); 684#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 682#L17-1 [2023-11-26 12:02:14,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:14,205 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2023-11-26 12:02:14,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:14,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883222035] [2023-11-26 12:02:14,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:14,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:14,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:14,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:14,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2023-11-26 12:02:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:14,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065242779] [2023-11-26 12:02:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:14,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:14,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:14,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:14,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2023-11-26 12:02:14,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:14,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413242057] [2023-11-26 12:02:14,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:14,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:14,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:14,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:14,307 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 12:02:14,307 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 12:02:14,307 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 12:02:14,307 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 12:02:14,308 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-26 12:02:14,308 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:14,308 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 12:02:14,308 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 12:02:14,308 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2023-11-26 12:02:14,308 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 12:02:14,308 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 12:02:14,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:14,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:14,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:14,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:14,459 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-26 12:02:14,459 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-26 12:02:14,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:14,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:14,461 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:14,479 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-26 12:02:14,479 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 12:02:14,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-26 12:02:14,505 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-26 12:02:14,505 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: [] [2023-11-26 12:02:14,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-26 12:02:14,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:14,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:14,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:14,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-26 12:02:14,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-26 12:02:14,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 12:02:14,540 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-26 12:02:14,540 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: [] [2023-11-26 12:02:14,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:14,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:14,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:14,548 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:14,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-26 12:02:14,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 12:02:14,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-26 12:02:14,584 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-26 12:02:14,584 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-26 12:02:14,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:14,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:14,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:14,595 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:14,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-26 12:02:14,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 12:02:14,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-26 12:02:14,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:14,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:14,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:14,643 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:14,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-26 12:02:14,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 12:02:14,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-26 12:02:14,995 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-26 12:02:15,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:15,001 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 12:02:15,001 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 12:02:15,002 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 12:02:15,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 12:02:15,002 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-26 12:02:15,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:15,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 12:02:15,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 12:02:15,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2023-11-26 12:02:15,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 12:02:15,002 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 12:02:15,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:15,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:15,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:15,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:15,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:15,225 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-26 12:02:15,226 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-26 12:02:15,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:15,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:15,228 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:15,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:02:15,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-26 12:02:15,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:02:15,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:02:15,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:02:15,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:02:15,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 12:02:15,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 12:02:15,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:02:15,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:15,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:15,276 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:15,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:02:15,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:02:15,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:02:15,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:02:15,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:02:15,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-26 12:02:15,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 12:02:15,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 12:02:15,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:02:15,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:15,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:15,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:15,330 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:15,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:02:15,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-26 12:02:15,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:02:15,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 12:02:15,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:02:15,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:02:15,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:02:15,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 12:02:15,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 12:02:15,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:02:15,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:15,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:15,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:15,366 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:15,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-26 12:02:15,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:02:15,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:02:15,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 12:02:15,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:02:15,394 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-26 12:02:15,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:02:15,397 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-26 12:02:15,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 12:02:15,415 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-26 12:02:15,419 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-26 12:02:15,419 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-26 12:02:15,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:15,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:15,421 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:15,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-26 12:02:15,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-26 12:02:15,426 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-26 12:02:15,426 INFO L513 LassoAnalysis]: Proved termination. [2023-11-26 12:02:15,427 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2023-11-26 12:02:15,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:15,437 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-26 12:02:15,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 12:02:15,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:02:15,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:15,561 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-26 12:02:15,562 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,628 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 124 transitions. Complement of second has 7 states. [2023-11-26 12:02:15,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-26 12:02:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2023-11-26 12:02:15,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2023-11-26 12:02:15,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:02:15,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-26 12:02:15,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:02:15,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2023-11-26 12:02:15,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:02:15,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2023-11-26 12:02:15,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-26 12:02:15,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2023-11-26 12:02:15,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-26 12:02:15,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-11-26 12:02:15,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2023-11-26 12:02:15,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 12:02:15,652 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2023-11-26 12:02:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2023-11-26 12:02:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2023-11-26 12:02:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 71 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2023-11-26 12:02:15,657 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2023-11-26 12:02:15,657 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2023-11-26 12:02:15,657 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-26 12:02:15,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2023-11-26 12:02:15,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-26 12:02:15,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:15,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:15,659 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:15,659 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-26 12:02:15,659 INFO L748 eck$LassoCheckResult]: Stem: 851#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 863#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 903#L14 assume !(0 == main_~i~0#1); 904#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 861#L17-1 assume !(1 == main_~up~0#1); 862#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 894#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 895#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 917#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 916#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 915#L17-1 [2023-11-26 12:02:15,659 INFO L750 eck$LassoCheckResult]: Loop: 915#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 914#L20-1 assume !(0 == main_~up~0#1); 857#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 858#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 882#L14 assume !(0 == main_~i~0#1); 880#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 915#L17-1 [2023-11-26 12:02:15,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2023-11-26 12:02:15,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:15,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267004584] [2023-11-26 12:02:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:15,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:15,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:15,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267004584] [2023-11-26 12:02:15,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267004584] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:02:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650983960] [2023-11-26 12:02:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:15,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:02:15,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:15,740 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:02:15,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-26 12:02:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:02:15,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:15,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:02:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:15,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650983960] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:02:15,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:02:15,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-11-26 12:02:15,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367573813] [2023-11-26 12:02:15,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:02:15,847 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 12:02:15,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2023-11-26 12:02:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:15,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997790155] [2023-11-26 12:02:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:15,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:15,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:15,933 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 12:02:15,933 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 12:02:15,934 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 12:02:15,934 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 12:02:15,934 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-26 12:02:15,934 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:15,934 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 12:02:15,934 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 12:02:15,934 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2023-11-26 12:02:15,934 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 12:02:15,935 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 12:02:15,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:15,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:15,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:15,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:16,098 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-26 12:02:16,098 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-26 12:02:16,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:16,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:16,103 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:16,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-26 12:02:16,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 12:02:16,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-26 12:02:16,129 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-26 12:02:16,129 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: [] [2023-11-26 12:02:16,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:16,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:16,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:16,139 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:16,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-26 12:02:16,153 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-26 12:02:16,153 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 12:02:16,192 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-26 12:02:16,192 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-26 12:02:16,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:16,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:16,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:16,198 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:16,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-26 12:02:16,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 12:02:16,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-26 12:02:16,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:16,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:16,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:16,240 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:16,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-26 12:02:16,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 12:02:16,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-26 12:02:16,555 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-26 12:02:16,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:16,559 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 12:02:16,559 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 12:02:16,559 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 12:02:16,559 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 12:02:16,559 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-26 12:02:16,560 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:16,560 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 12:02:16,560 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 12:02:16,560 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2023-11-26 12:02:16,560 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 12:02:16,560 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 12:02:16,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:16,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:16,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:16,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 12:02:16,712 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-26 12:02:16,713 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-26 12:02:16,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:16,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:16,715 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:16,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:02:16,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:02:16,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 12:02:16,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:02:16,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:02:16,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:02:16,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 12:02:16,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 12:02:16,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-26 12:02:16,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:02:16,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:16,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:16,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:16,751 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:16,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-26 12:02:16,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:02:16,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:02:16,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:02:16,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 12:02:16,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:02:16,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 12:02:16,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 12:02:16,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 12:02:16,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:16,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:16,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:16,794 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:16,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 12:02:16,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 12:02:16,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 12:02:16,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 12:02:16,812 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-26 12:02:16,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 12:02:16,814 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-26 12:02:16,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 12:02:16,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-26 12:02:16,843 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-26 12:02:16,847 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-26 12:02:16,847 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-26 12:02:16,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 12:02:16,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:16,851 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:16,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-26 12:02:16,855 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-26 12:02:16,855 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-26 12:02:16,855 INFO L513 LassoAnalysis]: Proved termination. [2023-11-26 12:02:16,855 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2023-11-26 12:02:16,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:16,861 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-26 12:02:16,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 12:02:16,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:02:16,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:16,965 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-26 12:02:16,965 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,012 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 96 states and 136 transitions. Complement of second has 7 states. [2023-11-26 12:02:17,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-26 12:02:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2023-11-26 12:02:17,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-26 12:02:17,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:02:17,014 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-26 12:02:17,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:17,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 12:02:17,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:17,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:02:17,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:17,099 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-26 12:02:17,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,152 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 125 states and 174 transitions. Complement of second has 9 states. [2023-11-26 12:02:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-26 12:02:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2023-11-26 12:02:17,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-26 12:02:17,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:02:17,154 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-26 12:02:17,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:17,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 12:02:17,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:17,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:02:17,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:17,244 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-26 12:02:17,244 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,285 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 113 states and 165 transitions. Complement of second has 8 states. [2023-11-26 12:02:17,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-26 12:02:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2023-11-26 12:02:17,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-26 12:02:17,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:02:17,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 17 letters. Loop has 6 letters. [2023-11-26 12:02:17,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:02:17,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 12 letters. [2023-11-26 12:02:17,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 12:02:17,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 165 transitions. [2023-11-26 12:02:17,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-11-26 12:02:17,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 85 states and 121 transitions. [2023-11-26 12:02:17,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-11-26 12:02:17,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2023-11-26 12:02:17,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 121 transitions. [2023-11-26 12:02:17,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 12:02:17,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 121 transitions. [2023-11-26 12:02:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 121 transitions. [2023-11-26 12:02:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2023-11-26 12:02:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.46) internal successors, (73), 49 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2023-11-26 12:02:17,299 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2023-11-26 12:02:17,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:02:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:02:17,300 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:17,392 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions. [2023-11-26 12:02:17,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 277 transitions. [2023-11-26 12:02:17,396 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2023-11-26 12:02:17,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 199 states and 266 transitions. [2023-11-26 12:02:17,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2023-11-26 12:02:17,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2023-11-26 12:02:17,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 266 transitions. [2023-11-26 12:02:17,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 12:02:17,400 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 266 transitions. [2023-11-26 12:02:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 266 transitions. [2023-11-26 12:02:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2023-11-26 12:02:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.3505747126436782) internal successors, (235), 173 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2023-11-26 12:02:17,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 235 transitions. [2023-11-26 12:02:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:02:17,421 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 235 transitions. [2023-11-26 12:02:17,421 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-26 12:02:17,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 235 transitions. [2023-11-26 12:02:17,422 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2023-11-26 12:02:17,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:17,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:17,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-26 12:02:17,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-26 12:02:17,424 INFO L748 eck$LassoCheckResult]: Stem: 1785#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1786#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 1791#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1869#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1868#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1851#L17-1 [2023-11-26 12:02:17,424 INFO L750 eck$LassoCheckResult]: Loop: 1851#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1864#L20-1 assume !(0 == main_~up~0#1); 1862#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1858#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1853#L14 assume !(0 == main_~i~0#1); 1850#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 1840#L17-1 assume !(1 == main_~up~0#1); 1848#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1849#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1847#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1845#L14 assume !(0 == main_~i~0#1); 1839#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1836#L17-1 assume !(1 == main_~up~0#1); 1834#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1831#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1832#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1843#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1844#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1851#L17-1 [2023-11-26 12:02:17,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 2 times [2023-11-26 12:02:17,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:17,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959203253] [2023-11-26 12:02:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:17,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:17,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:17,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:17,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2023-11-26 12:02:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:17,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582856016] [2023-11-26 12:02:17,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:17,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:17,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:17,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:17,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:17,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582856016] [2023-11-26 12:02:17,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582856016] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:02:17,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25334427] [2023-11-26 12:02:17,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:17,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:02:17,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:17,648 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:02:17,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-26 12:02:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:17,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-26 12:02:17,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:17,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:02:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:17,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25334427] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:02:17,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:02:17,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2023-11-26 12:02:17,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667802536] [2023-11-26 12:02:17,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:02:17,763 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 12:02:17,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:17,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 12:02:17,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-26 12:02:17,764 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. cyclomatic complexity: 69 Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:17,933 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2023-11-26 12:02:17,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2023-11-26 12:02:17,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-11-26 12:02:17,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 120 transitions. [2023-11-26 12:02:17,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2023-11-26 12:02:17,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2023-11-26 12:02:17,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 120 transitions. [2023-11-26 12:02:17,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 12:02:17,936 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 120 transitions. [2023-11-26 12:02:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 120 transitions. [2023-11-26 12:02:17,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-11-26 12:02:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 88 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2023-11-26 12:02:17,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-11-26 12:02:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 12:02:17,941 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2023-11-26 12:02:17,941 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-26 12:02:17,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 101 transitions. [2023-11-26 12:02:17,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-26 12:02:17,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:17,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:17,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1] [2023-11-26 12:02:17,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:17,943 INFO L748 eck$LassoCheckResult]: Stem: 2198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2204#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2230#L14 assume !(0 == main_~i~0#1); 2228#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2226#L17-1 assume !(1 == main_~up~0#1); 2224#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2219#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2196#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2197#L14 assume !(0 == main_~i~0#1); 2214#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2207#L17-1 assume !(1 == main_~up~0#1); 2208#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2217#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2248#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2258#L14 assume !(0 == main_~i~0#1); 2256#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2254#L17-1 assume !(1 == main_~up~0#1); 2251#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2246#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2247#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2242#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2243#L14-2 [2023-11-26 12:02:17,944 INFO L750 eck$LassoCheckResult]: Loop: 2243#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2205#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2206#L20-1 assume !(0 == main_~up~0#1); 2274#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2273#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2272#L14 assume !(0 == main_~i~0#1); 2270#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2269#L17-1 assume !(1 == main_~up~0#1); 2253#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2250#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2244#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2245#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2243#L14-2 [2023-11-26 12:02:17,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2020896569, now seen corresponding path program 2 times [2023-11-26 12:02:17,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:17,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804164242] [2023-11-26 12:02:17,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:17,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:18,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804164242] [2023-11-26 12:02:18,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804164242] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:02:18,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276873162] [2023-11-26 12:02:18,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 12:02:18,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:02:18,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:18,013 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:02:18,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-26 12:02:18,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 12:02:18,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:02:18,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 12:02:18,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:18,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:02:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:18,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276873162] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:02:18,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:02:18,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-26 12:02:18,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303796713] [2023-11-26 12:02:18,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:02:18,160 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 12:02:18,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 2 times [2023-11-26 12:02:18,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:18,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891532487] [2023-11-26 12:02:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:18,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:18,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:18,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:18,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 12:02:18,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-26 12:02:18,237 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. cyclomatic complexity: 16 Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:18,405 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2023-11-26 12:02:18,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2023-11-26 12:02:18,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-26 12:02:18,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 151 states and 163 transitions. [2023-11-26 12:02:18,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2023-11-26 12:02:18,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2023-11-26 12:02:18,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 163 transitions. [2023-11-26 12:02:18,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 12:02:18,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 163 transitions. [2023-11-26 12:02:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 163 transitions. [2023-11-26 12:02:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2023-11-26 12:02:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.0875912408759123) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2023-11-26 12:02:18,412 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 149 transitions. [2023-11-26 12:02:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 12:02:18,413 INFO L428 stractBuchiCegarLoop]: Abstraction has 137 states and 149 transitions. [2023-11-26 12:02:18,413 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-26 12:02:18,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 149 transitions. [2023-11-26 12:02:18,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-26 12:02:18,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:18,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:18,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1] [2023-11-26 12:02:18,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:18,416 INFO L748 eck$LassoCheckResult]: Stem: 2604#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2605#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2616#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2639#L14 assume !(0 == main_~i~0#1); 2636#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2633#L17-1 assume !(1 == main_~up~0#1); 2630#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2625#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2624#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2726#L14 assume !(0 == main_~i~0#1); 2621#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2612#L17-1 assume !(1 == main_~up~0#1); 2613#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2622#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2723#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2722#L14 assume !(0 == main_~i~0#1); 2721#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2720#L17-1 assume !(1 == main_~up~0#1); 2719#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2718#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2717#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2716#L14 assume !(0 == main_~i~0#1); 2715#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2714#L17-1 assume !(1 == main_~up~0#1); 2713#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2712#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2711#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2710#L14 assume !(0 == main_~i~0#1); 2709#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2708#L17-1 assume !(1 == main_~up~0#1); 2707#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2706#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2705#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2704#L14 assume !(0 == main_~i~0#1); 2703#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2702#L17-1 assume !(1 == main_~up~0#1); 2701#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2700#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2656#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2697#L14 assume !(0 == main_~i~0#1); 2669#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2667#L17-1 assume !(1 == main_~up~0#1); 2659#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2654#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2655#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2649#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2650#L14-2 [2023-11-26 12:02:18,417 INFO L750 eck$LassoCheckResult]: Loop: 2650#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2610#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2611#L20-1 assume !(0 == main_~up~0#1); 2665#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2664#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2663#L14 assume !(0 == main_~i~0#1); 2662#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2661#L17-1 assume !(1 == main_~up~0#1); 2660#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2657#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2651#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2652#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2650#L14-2 [2023-11-26 12:02:18,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:18,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1325721725, now seen corresponding path program 3 times [2023-11-26 12:02:18,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:18,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396651863] [2023-11-26 12:02:18,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:18,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:18,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396651863] [2023-11-26 12:02:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396651863] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:02:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425600184] [2023-11-26 12:02:18,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 12:02:18,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:02:18,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:18,565 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:02:18,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-26 12:02:18,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-26 12:02:18,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:02:18,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-26 12:02:18,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:18,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:02:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:18,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425600184] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:02:18,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:02:18,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-26 12:02:18,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439090865] [2023-11-26 12:02:18,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:02:18,888 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 12:02:18,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2023-11-26 12:02:18,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:18,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099198675] [2023-11-26 12:02:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:18,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:18,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:18,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:18,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-26 12:02:18,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2023-11-26 12:02:18,983 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. cyclomatic complexity: 16 Second operand has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:19,296 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2023-11-26 12:02:19,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 275 transitions. [2023-11-26 12:02:19,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-26 12:02:19,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 247 states and 259 transitions. [2023-11-26 12:02:19,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2023-11-26 12:02:19,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2023-11-26 12:02:19,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 259 transitions. [2023-11-26 12:02:19,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 12:02:19,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 247 states and 259 transitions. [2023-11-26 12:02:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 259 transitions. [2023-11-26 12:02:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2023-11-26 12:02:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 233 states have (on average 1.0515021459227467) internal successors, (245), 232 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 245 transitions. [2023-11-26 12:02:19,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233 states and 245 transitions. [2023-11-26 12:02:19,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-26 12:02:19,312 INFO L428 stractBuchiCegarLoop]: Abstraction has 233 states and 245 transitions. [2023-11-26 12:02:19,312 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-26 12:02:19,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 245 transitions. [2023-11-26 12:02:19,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-26 12:02:19,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:19,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:19,319 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 15, 15, 15, 15, 15, 1, 1, 1] [2023-11-26 12:02:19,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:19,319 INFO L748 eck$LassoCheckResult]: Stem: 3322#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 3333#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3348#L14 assume !(0 == main_~i~0#1); 3346#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3345#L17-1 assume !(1 == main_~up~0#1); 3344#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3341#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3340#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3335#L14 assume !(0 == main_~i~0#1); 3336#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3332#L17-1 assume !(1 == main_~up~0#1); 3326#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3327#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3538#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3537#L14 assume !(0 == main_~i~0#1); 3536#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3535#L17-1 assume !(1 == main_~up~0#1); 3534#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3533#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3532#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3531#L14 assume !(0 == main_~i~0#1); 3530#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3529#L17-1 assume !(1 == main_~up~0#1); 3528#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3527#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3526#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3525#L14 assume !(0 == main_~i~0#1); 3524#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3523#L17-1 assume !(1 == main_~up~0#1); 3522#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3521#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3520#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3519#L14 assume !(0 == main_~i~0#1); 3518#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3517#L17-1 assume !(1 == main_~up~0#1); 3516#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3515#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3514#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3513#L14 assume !(0 == main_~i~0#1); 3512#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3511#L17-1 assume !(1 == main_~up~0#1); 3510#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3509#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3508#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3507#L14 assume !(0 == main_~i~0#1); 3506#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3505#L17-1 assume !(1 == main_~up~0#1); 3504#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3503#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3502#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3501#L14 assume !(0 == main_~i~0#1); 3500#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3499#L17-1 assume !(1 == main_~up~0#1); 3498#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3497#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3496#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3495#L14 assume !(0 == main_~i~0#1); 3494#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3493#L17-1 assume !(1 == main_~up~0#1); 3492#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3491#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3490#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3489#L14 assume !(0 == main_~i~0#1); 3488#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3487#L17-1 assume !(1 == main_~up~0#1); 3486#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3485#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3484#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3483#L14 assume !(0 == main_~i~0#1); 3482#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3481#L17-1 assume !(1 == main_~up~0#1); 3480#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3479#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3478#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3477#L14 assume !(0 == main_~i~0#1); 3476#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3475#L17-1 assume !(1 == main_~up~0#1); 3474#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3473#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3472#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3471#L14 assume !(0 == main_~i~0#1); 3470#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3469#L17-1 assume !(1 == main_~up~0#1); 3468#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3467#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3371#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3390#L14 assume !(0 == main_~i~0#1); 3388#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3383#L17-1 assume !(1 == main_~up~0#1); 3375#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3370#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3372#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3366#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3367#L14-2 [2023-11-26 12:02:19,320 INFO L750 eck$LassoCheckResult]: Loop: 3367#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3330#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3331#L20-1 assume !(0 == main_~up~0#1); 3382#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3381#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3380#L14 assume !(0 == main_~i~0#1); 3379#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3378#L17-1 assume !(1 == main_~up~0#1); 3377#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3374#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3368#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3369#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3367#L14-2 [2023-11-26 12:02:19,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash -944359675, now seen corresponding path program 4 times [2023-11-26 12:02:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:19,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919111813] [2023-11-26 12:02:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:19,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:19,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919111813] [2023-11-26 12:02:19,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919111813] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:02:19,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72749799] [2023-11-26 12:02:19,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-26 12:02:19,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:02:19,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:19,812 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:02:19,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-26 12:02:19,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-26 12:02:19,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:02:19,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-26 12:02:19,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:20,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:02:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:20,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72749799] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:02:20,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:02:20,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2023-11-26 12:02:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833501252] [2023-11-26 12:02:20,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:02:20,462 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 12:02:20,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:20,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2023-11-26 12:02:20,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:20,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392331854] [2023-11-26 12:02:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:20,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:20,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:20,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:20,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-26 12:02:20,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=307, Unknown=0, NotChecked=0, Total=506 [2023-11-26 12:02:20,547 INFO L87 Difference]: Start difference. First operand 233 states and 245 transitions. cyclomatic complexity: 16 Second operand has 23 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 23 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:20,812 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions. [2023-11-26 12:02:20,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 315 transitions. [2023-11-26 12:02:20,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-26 12:02:20,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 295 states and 307 transitions. [2023-11-26 12:02:20,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2023-11-26 12:02:20,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2023-11-26 12:02:20,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 307 transitions. [2023-11-26 12:02:20,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-26 12:02:20,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 307 transitions. [2023-11-26 12:02:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 307 transitions. [2023-11-26 12:02:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281. [2023-11-26 12:02:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 281 states have (on average 1.0427046263345197) internal successors, (293), 280 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 293 transitions. [2023-11-26 12:02:20,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 281 states and 293 transitions. [2023-11-26 12:02:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-26 12:02:20,825 INFO L428 stractBuchiCegarLoop]: Abstraction has 281 states and 293 transitions. [2023-11-26 12:02:20,825 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-26 12:02:20,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 293 transitions. [2023-11-26 12:02:20,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2023-11-26 12:02:20,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 12:02:20,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 12:02:20,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1, 1] [2023-11-26 12:02:20,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:20,830 INFO L748 eck$LassoCheckResult]: Stem: 4460#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4461#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4466#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4486#L14 assume !(0 == main_~i~0#1); 4484#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4483#L17-1 assume !(1 == main_~up~0#1); 4482#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4479#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4478#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4474#L14 assume !(0 == main_~i~0#1); 4475#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4469#L17-1 assume !(1 == main_~up~0#1); 4470#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4476#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4621#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4620#L14 assume !(0 == main_~i~0#1); 4619#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4618#L17-1 assume !(1 == main_~up~0#1); 4617#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4616#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4615#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4614#L14 assume !(0 == main_~i~0#1); 4613#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4612#L17-1 assume !(1 == main_~up~0#1); 4611#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4610#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4609#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4608#L14 assume !(0 == main_~i~0#1); 4607#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4606#L17-1 assume !(1 == main_~up~0#1); 4605#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4604#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4603#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4602#L14 assume !(0 == main_~i~0#1); 4601#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4600#L17-1 assume !(1 == main_~up~0#1); 4599#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4598#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4597#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4596#L14 assume !(0 == main_~i~0#1); 4595#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4594#L17-1 assume !(1 == main_~up~0#1); 4593#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4592#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4591#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4590#L14 assume !(0 == main_~i~0#1); 4589#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4588#L17-1 assume !(1 == main_~up~0#1); 4587#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4586#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4585#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4584#L14 assume !(0 == main_~i~0#1); 4583#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4582#L17-1 assume !(1 == main_~up~0#1); 4581#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4580#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4579#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4578#L14 assume !(0 == main_~i~0#1); 4577#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4576#L17-1 assume !(1 == main_~up~0#1); 4575#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4574#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4573#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4572#L14 assume !(0 == main_~i~0#1); 4571#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4570#L17-1 assume !(1 == main_~up~0#1); 4569#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4568#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4567#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4566#L14 assume !(0 == main_~i~0#1); 4565#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4564#L17-1 assume !(1 == main_~up~0#1); 4563#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4562#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4561#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4560#L14 assume !(0 == main_~i~0#1); 4559#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4558#L17-1 assume !(1 == main_~up~0#1); 4557#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4556#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4555#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4554#L14 assume !(0 == main_~i~0#1); 4553#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4552#L17-1 assume !(1 == main_~up~0#1); 4551#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4550#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4549#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4548#L14 assume !(0 == main_~i~0#1); 4547#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4546#L17-1 assume !(1 == main_~up~0#1); 4545#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4544#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4543#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4542#L14 assume !(0 == main_~i~0#1); 4541#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4540#L17-1 assume !(1 == main_~up~0#1); 4539#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4538#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4537#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4536#L14 assume !(0 == main_~i~0#1); 4535#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4534#L17-1 assume !(1 == main_~up~0#1); 4533#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4532#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4531#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4530#L14 assume !(0 == main_~i~0#1); 4529#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4528#L17-1 assume !(1 == main_~up~0#1); 4527#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4526#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4501#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4513#L14 assume !(0 == main_~i~0#1); 4509#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4506#L17-1 assume !(1 == main_~up~0#1); 4503#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4500#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4502#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4511#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4512#L14-2 [2023-11-26 12:02:20,830 INFO L750 eck$LassoCheckResult]: Loop: 4512#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4504#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4505#L20-1 assume !(0 == main_~up~0#1); 4524#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4523#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4522#L14 assume !(0 == main_~i~0#1); 4521#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4520#L17-1 assume !(1 == main_~up~0#1); 4519#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4517#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4514#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4515#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4512#L14-2 [2023-11-26 12:02:20,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash 228527177, now seen corresponding path program 5 times [2023-11-26 12:02:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:20,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444719087] [2023-11-26 12:02:20,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:20,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:20,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:20,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:20,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2023-11-26 12:02:20,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:20,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885791005] [2023-11-26 12:02:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:20,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:20,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:20,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:20,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash 210101867, now seen corresponding path program 1 times [2023-11-26 12:02:20,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:20,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973951072] [2023-11-26 12:02:20,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:20,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:20,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:22,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:22,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.11 12:02:22 BoogieIcfgContainer [2023-11-26 12:02:22,536 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-26 12:02:22,537 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:02:22,537 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:02:22,538 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:02:22,538 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:12" (3/4) ... [2023-11-26 12:02:22,540 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-26 12:02:22,617 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 12:02:22,617 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:02:22,618 INFO L158 Benchmark]: Toolchain (without parser) took 11058.45ms. Allocated memory was 157.3MB in the beginning and 234.9MB in the end (delta: 77.6MB). Free memory was 126.2MB in the beginning and 176.7MB in the end (delta: -50.6MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2023-11-26 12:02:22,618 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 123.7MB. Free memory was 81.7MB in the beginning and 81.6MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:02:22,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.07ms. Allocated memory is still 157.3MB. Free memory was 126.2MB in the beginning and 116.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 12:02:22,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.16ms. Allocated memory is still 157.3MB. Free memory was 116.5MB in the beginning and 115.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:02:22,619 INFO L158 Benchmark]: Boogie Preprocessor took 29.36ms. Allocated memory is still 157.3MB. Free memory was 115.0MB in the beginning and 113.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:02:22,620 INFO L158 Benchmark]: RCFGBuilder took 277.71ms. Allocated memory is still 157.3MB. Free memory was 113.7MB in the beginning and 104.5MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 12:02:22,620 INFO L158 Benchmark]: BuchiAutomizer took 10438.52ms. Allocated memory was 157.3MB in the beginning and 234.9MB in the end (delta: 77.6MB). Free memory was 104.5MB in the beginning and 183.1MB in the end (delta: -78.6MB). Peak memory consumption was 739.3kB. Max. memory is 16.1GB. [2023-11-26 12:02:22,621 INFO L158 Benchmark]: Witness Printer took 79.88ms. Allocated memory is still 234.9MB. Free memory was 183.1MB in the beginning and 176.7MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 12:02:22,623 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 123.7MB. Free memory was 81.7MB in the beginning and 81.6MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.07ms. Allocated memory is still 157.3MB. Free memory was 126.2MB in the beginning and 116.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.16ms. Allocated memory is still 157.3MB. Free memory was 116.5MB in the beginning and 115.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.36ms. Allocated memory is still 157.3MB. Free memory was 115.0MB in the beginning and 113.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 277.71ms. Allocated memory is still 157.3MB. Free memory was 113.7MB in the beginning and 104.5MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10438.52ms. Allocated memory was 157.3MB in the beginning and 234.9MB in the end (delta: 77.6MB). Free memory was 104.5MB in the beginning and 183.1MB in the end (delta: -78.6MB). Peak memory consumption was 739.3kB. Max. memory is 16.1GB. * Witness Printer took 79.88ms. Allocated memory is still 234.9MB. Free memory was 183.1MB in the beginning and 176.7MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (10 trivial, 2 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function ((-1 * i) + range) and consists of 4 locations. One nondeterministic module has affine ranking function ((-1 * i) + range) and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 23 locations. The remainder module has 281 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 13 iterations. TraceHistogramMax:20. Analysis of lassos took 7.8s. Construction of modules took 0.6s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 155 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 789 IncrementalHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 169 mSDtfsCounter, 789 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT2 conc2 concLT0 SILN3 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital30 mio100 ax139 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf97 smp57 dnf135 smp95 tf106 neg100 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-26 12:02:22,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:22,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-11-26 12:02:23,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-11-26 12:02:23,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:23,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-26 12:02:23,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a87ec7cb-3d19-4734-811a-2c8d815fe475/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)