./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 527bcce2 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_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx --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 32bit --witnessprinter.graph.data.programhash 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 21:03:30,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:03:30,411 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 21:03:30,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:03:30,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:03:30,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:03:30,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:03:30,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:03:30,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 21:03:30,478 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 21:03:30,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:03:30,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:03:30,480 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:03:30,482 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 21:03:30,482 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 21:03:30,483 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 21:03:30,483 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 21:03:30,484 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 21:03:30,484 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 21:03:30,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:03:30,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 21:03:30,486 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:03:30,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:03:30,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:03:30,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:03:30,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 21:03:30,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 21:03:30,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 21:03:30,489 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:03:30,489 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:03:30,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:03:30,491 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 21:03:30,491 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:03:30,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:03:30,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:03:30,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:03:30,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:03:30,493 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 21:03:30,493 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_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/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_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2023-11-21 21:03:30,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:03:30,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:03:30,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:03:30,828 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:03:30,828 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:03:30,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/locks/test_locks_9.c [2023-11-21 21:03:34,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:03:34,269 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:03:34,269 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/sv-benchmarks/c/locks/test_locks_9.c [2023-11-21 21:03:34,279 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/data/ef481dce8/5ed66f6dda204b098d9b6315b092a888/FLAG4963ca0cf [2023-11-21 21:03:34,296 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/data/ef481dce8/5ed66f6dda204b098d9b6315b092a888 [2023-11-21 21:03:34,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:03:34,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:03:34,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:03:34,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:03:34,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:03:34,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7564c332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34, skipping insertion in model container [2023-11-21 21:03:34,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,352 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:03:34,518 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:03:34,537 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:03:34,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:03:34,578 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:03:34,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34 WrapperNode [2023-11-21 21:03:34,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:03:34,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:03:34,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:03:34,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:03:34,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,622 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 127 [2023-11-21 21:03:34,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:03:34,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:03:34,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:03:34,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:03:34,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,637 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,646 INFO L187 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-21 21:03:34,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:03:34,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:03:34,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:03:34,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:03:34,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (1/1) ... [2023-11-21 21:03:34,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:03:34,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:03:34,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:03:34,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 21:03:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:03:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:03:34,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:03:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 21:03:34,821 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:03:34,824 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:03:35,035 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:03:35,064 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:03:35,065 INFO L308 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-21 21:03:35,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:03:35 BoogieIcfgContainer [2023-11-21 21:03:35,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:03:35,068 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 21:03:35,068 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 21:03:35,073 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 21:03:35,074 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 21:03:35,074 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 09:03:34" (1/3) ... [2023-11-21 21:03:35,080 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@733527ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 09:03:35, skipping insertion in model container [2023-11-21 21:03:35,081 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 21:03:35,081 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:03:34" (2/3) ... [2023-11-21 21:03:35,081 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@733527ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 09:03:35, skipping insertion in model container [2023-11-21 21:03:35,081 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 21:03:35,082 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:03:35" (3/3) ... [2023-11-21 21:03:35,083 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2023-11-21 21:03:35,174 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 21:03:35,174 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 21:03:35,175 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 21:03:35,175 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 21:03:35,176 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 21:03:35,177 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 21:03:35,177 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 21:03:35,177 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 21:03:35,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 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-21 21:03:35,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2023-11-21 21:03:35,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:03:35,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:03:35,250 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:03:35,250 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:35,251 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 21:03:35,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 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-21 21:03:35,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2023-11-21 21:03:35,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:03:35,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:03:35,266 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:03:35,266 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:35,279 INFO L748 eck$LassoCheckResult]: Stem: 32#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 12#L141-1true [2023-11-21 21:03:35,282 INFO L750 eck$LassoCheckResult]: Loop: 12#L141-1true assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 36#L40true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 3#L63true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 19#L63-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 27#L67-1true assume !(0 != main_~p3~0#1); 23#L71-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 29#L75-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 14#L79-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 37#L83-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 8#L87-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4#L91-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 34#L95-1true assume !(0 != main_~p1~0#1); 21#L101-1true assume !(0 != main_~p2~0#1); 9#L106-1true assume !(0 != main_~p3~0#1); 10#L111-1true assume !(0 != main_~p4~0#1); 33#L116-1true assume !(0 != main_~p5~0#1); 5#L121-1true assume !(0 != main_~p6~0#1); 17#L126-1true assume !(0 != main_~p7~0#1); 30#L131-1true assume !(0 != main_~p8~0#1); 18#L136-1true assume !(0 != main_~p9~0#1); 12#L141-1true [2023-11-21 21:03:35,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:35,294 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-21 21:03:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:35,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731009601] [2023-11-21 21:03:35,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:35,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:35,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:35,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:03:35,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:35,510 INFO L85 PathProgramCache]: Analyzing trace with hash 694706197, now seen corresponding path program 1 times [2023-11-21 21:03:35,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:35,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750632213] [2023-11-21 21:03:35,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:35,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:35,692 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-21 21:03:35,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:35,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750632213] [2023-11-21 21:03:35,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750632213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:35,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:35,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:03:35,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857157195] [2023-11-21 21:03:35,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:35,699 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:03:35,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:35,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:35,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:35,734 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 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 6.666666666666667) internal successors, (20), 3 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-21 21:03:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:35,774 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2023-11-21 21:03:35,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 117 transitions. [2023-11-21 21:03:35,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2023-11-21 21:03:35,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 59 states and 93 transitions. [2023-11-21 21:03:35,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2023-11-21 21:03:35,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2023-11-21 21:03:35,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 93 transitions. [2023-11-21 21:03:35,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:35,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 93 transitions. [2023-11-21 21:03:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 93 transitions. [2023-11-21 21:03:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-21 21:03:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.576271186440678) internal successors, (93), 58 states have internal predecessors, (93), 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-21 21:03:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 93 transitions. [2023-11-21 21:03:35,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 93 transitions. [2023-11-21 21:03:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:35,830 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2023-11-21 21:03:35,830 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 21:03:35,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 93 transitions. [2023-11-21 21:03:35,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2023-11-21 21:03:35,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:03:35,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:03:35,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:03:35,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:35,834 INFO L748 eck$LassoCheckResult]: Stem: 147#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 122#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 123#L141-1 [2023-11-21 21:03:35,834 INFO L750 eck$LassoCheckResult]: Loop: 123#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 130#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 149#L63 assume !(0 != main_~p1~0#1); 138#L63-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 139#L67-1 assume !(0 != main_~p3~0#1); 144#L71-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 145#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 131#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 132#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 124#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 115#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 116#L95-1 assume !(0 != main_~p1~0#1); 140#L101-1 assume !(0 != main_~p2~0#1); 125#L106-1 assume !(0 != main_~p3~0#1); 126#L111-1 assume !(0 != main_~p4~0#1); 121#L116-1 assume !(0 != main_~p5~0#1); 117#L121-1 assume !(0 != main_~p6~0#1); 119#L126-1 assume !(0 != main_~p7~0#1); 134#L131-1 assume !(0 != main_~p8~0#1); 136#L136-1 assume !(0 != main_~p9~0#1); 123#L141-1 [2023-11-21 21:03:35,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-21 21:03:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:35,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171824051] [2023-11-21 21:03:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:35,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:35,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:35,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:03:35,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1299438509, now seen corresponding path program 1 times [2023-11-21 21:03:35,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:35,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619749297] [2023-11-21 21:03:35,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:35,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:35,906 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-21 21:03:35,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619749297] [2023-11-21 21:03:35,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619749297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:35,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:35,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:03:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790465520] [2023-11-21 21:03:35,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:35,909 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:03:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:35,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:35,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:35,910 INFO L87 Difference]: Start difference. First operand 59 states and 93 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 21:03:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:35,932 INFO L93 Difference]: Finished difference Result 114 states and 178 transitions. [2023-11-21 21:03:35,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 178 transitions. [2023-11-21 21:03:35,937 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2023-11-21 21:03:35,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 178 transitions. [2023-11-21 21:03:35,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2023-11-21 21:03:35,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2023-11-21 21:03:35,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 178 transitions. [2023-11-21 21:03:35,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:35,942 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 178 transitions. [2023-11-21 21:03:35,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 178 transitions. [2023-11-21 21:03:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-11-21 21:03:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.5614035087719298) internal successors, (178), 113 states have internal predecessors, (178), 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-21 21:03:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2023-11-21 21:03:35,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114 states and 178 transitions. [2023-11-21 21:03:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:35,972 INFO L428 stractBuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2023-11-21 21:03:35,972 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 21:03:35,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 178 transitions. [2023-11-21 21:03:35,975 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2023-11-21 21:03:35,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:03:35,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:03:35,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:03:35,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:35,977 INFO L748 eck$LassoCheckResult]: Stem: 325#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 302#L141-1 [2023-11-21 21:03:35,977 INFO L750 eck$LassoCheckResult]: Loop: 302#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 336#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 333#L63 assume !(0 != main_~p1~0#1); 334#L63-2 assume !(0 != main_~p2~0#1); 376#L67-1 assume !(0 != main_~p3~0#1); 375#L71-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 374#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 373#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 372#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 371#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 370#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 369#L95-1 assume !(0 != main_~p1~0#1); 367#L101-1 assume !(0 != main_~p2~0#1); 365#L106-1 assume !(0 != main_~p3~0#1); 360#L111-1 assume !(0 != main_~p4~0#1); 357#L116-1 assume !(0 != main_~p5~0#1); 353#L121-1 assume !(0 != main_~p6~0#1); 349#L126-1 assume !(0 != main_~p7~0#1); 345#L131-1 assume !(0 != main_~p8~0#1); 341#L136-1 assume !(0 != main_~p9~0#1); 302#L141-1 [2023-11-21 21:03:35,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-21 21:03:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:35,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64051873] [2023-11-21 21:03:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:35,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:35,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:03:35,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1407180885, now seen corresponding path program 1 times [2023-11-21 21:03:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447796637] [2023-11-21 21:03:35,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:35,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:36,041 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-21 21:03:36,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:36,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447796637] [2023-11-21 21:03:36,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447796637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:36,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:36,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:03:36,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452808765] [2023-11-21 21:03:36,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:36,043 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:03:36,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:36,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:36,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:36,044 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. cyclomatic complexity: 68 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 21:03:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:36,068 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2023-11-21 21:03:36,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 342 transitions. [2023-11-21 21:03:36,076 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2023-11-21 21:03:36,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 342 transitions. [2023-11-21 21:03:36,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2023-11-21 21:03:36,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2023-11-21 21:03:36,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 342 transitions. [2023-11-21 21:03:36,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:36,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 342 transitions. [2023-11-21 21:03:36,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 342 transitions. [2023-11-21 21:03:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2023-11-21 21:03:36,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 222 states have (on average 1.5405405405405406) internal successors, (342), 221 states have internal predecessors, (342), 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-21 21:03:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2023-11-21 21:03:36,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 222 states and 342 transitions. [2023-11-21 21:03:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:36,114 INFO L428 stractBuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2023-11-21 21:03:36,114 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 21:03:36,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 342 transitions. [2023-11-21 21:03:36,117 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2023-11-21 21:03:36,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:03:36,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:03:36,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:03:36,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:36,118 INFO L748 eck$LassoCheckResult]: Stem: 671#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 643#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 644#L141-1 [2023-11-21 21:03:36,119 INFO L750 eck$LassoCheckResult]: Loop: 644#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 709#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 706#L63 assume !(0 != main_~p1~0#1); 703#L63-2 assume !(0 != main_~p2~0#1); 700#L67-1 assume !(0 != main_~p3~0#1); 697#L71-1 assume !(0 != main_~p4~0#1); 695#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 693#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 691#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 689#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 687#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 684#L95-1 assume !(0 != main_~p1~0#1); 685#L101-1 assume !(0 != main_~p2~0#1); 734#L106-1 assume !(0 != main_~p3~0#1); 729#L111-1 assume !(0 != main_~p4~0#1); 728#L116-1 assume !(0 != main_~p5~0#1); 724#L121-1 assume !(0 != main_~p6~0#1); 720#L126-1 assume !(0 != main_~p7~0#1); 716#L131-1 assume !(0 != main_~p8~0#1); 713#L136-1 assume !(0 != main_~p9~0#1); 644#L141-1 [2023-11-21 21:03:36,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:36,120 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-21 21:03:36,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:36,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653642609] [2023-11-21 21:03:36,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:36,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:36,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:36,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:03:36,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:36,136 INFO L85 PathProgramCache]: Analyzing trace with hash 127317207, now seen corresponding path program 1 times [2023-11-21 21:03:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:36,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118675587] [2023-11-21 21:03:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:36,177 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-21 21:03:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:36,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118675587] [2023-11-21 21:03:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118675587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:36,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:36,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:03:36,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200551510] [2023-11-21 21:03:36,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:36,180 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:03:36,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:36,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:36,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:36,181 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. cyclomatic complexity: 128 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 21:03:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:36,215 INFO L93 Difference]: Finished difference Result 434 states and 658 transitions. [2023-11-21 21:03:36,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 658 transitions. [2023-11-21 21:03:36,219 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2023-11-21 21:03:36,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 658 transitions. [2023-11-21 21:03:36,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2023-11-21 21:03:36,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2023-11-21 21:03:36,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 658 transitions. [2023-11-21 21:03:36,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:36,231 INFO L218 hiAutomatonCegarLoop]: Abstraction has 434 states and 658 transitions. [2023-11-21 21:03:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 658 transitions. [2023-11-21 21:03:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2023-11-21 21:03:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 434 states have (on average 1.5161290322580645) internal successors, (658), 433 states have internal predecessors, (658), 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-21 21:03:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 658 transitions. [2023-11-21 21:03:36,269 INFO L240 hiAutomatonCegarLoop]: Abstraction has 434 states and 658 transitions. [2023-11-21 21:03:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:36,271 INFO L428 stractBuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2023-11-21 21:03:36,272 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 21:03:36,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 658 transitions. [2023-11-21 21:03:36,276 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2023-11-21 21:03:36,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:03:36,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:03:36,277 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:03:36,278 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:36,278 INFO L748 eck$LassoCheckResult]: Stem: 1333#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 1306#L141-1 [2023-11-21 21:03:36,278 INFO L750 eck$LassoCheckResult]: Loop: 1306#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 1385#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 1382#L63 assume !(0 != main_~p1~0#1); 1378#L63-2 assume !(0 != main_~p2~0#1); 1375#L67-1 assume !(0 != main_~p3~0#1); 1372#L71-1 assume !(0 != main_~p4~0#1); 1366#L75-1 assume !(0 != main_~p5~0#1); 1367#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1357#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1358#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1350#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1351#L95-1 assume !(0 != main_~p1~0#1); 1414#L101-1 assume !(0 != main_~p2~0#1); 1411#L106-1 assume !(0 != main_~p3~0#1); 1406#L111-1 assume !(0 != main_~p4~0#1); 1404#L116-1 assume !(0 != main_~p5~0#1); 1402#L121-1 assume !(0 != main_~p6~0#1); 1398#L126-1 assume !(0 != main_~p7~0#1); 1394#L131-1 assume !(0 != main_~p8~0#1); 1390#L136-1 assume !(0 != main_~p9~0#1); 1306#L141-1 [2023-11-21 21:03:36,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2023-11-21 21:03:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:36,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405543951] [2023-11-21 21:03:36,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:36,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:36,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:03:36,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:36,295 INFO L85 PathProgramCache]: Analyzing trace with hash -883800043, now seen corresponding path program 1 times [2023-11-21 21:03:36,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:36,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766995804] [2023-11-21 21:03:36,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:36,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:36,348 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-21 21:03:36,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:36,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766995804] [2023-11-21 21:03:36,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766995804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:36,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:36,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:03:36,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334330189] [2023-11-21 21:03:36,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:36,350 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:03:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:36,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:36,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:36,352 INFO L87 Difference]: Start difference. First operand 434 states and 658 transitions. cyclomatic complexity: 240 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 21:03:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:36,374 INFO L93 Difference]: Finished difference Result 850 states and 1266 transitions. [2023-11-21 21:03:36,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 1266 transitions. [2023-11-21 21:03:36,384 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2023-11-21 21:03:36,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 850 states and 1266 transitions. [2023-11-21 21:03:36,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 850 [2023-11-21 21:03:36,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 850 [2023-11-21 21:03:36,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1266 transitions. [2023-11-21 21:03:36,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:36,395 INFO L218 hiAutomatonCegarLoop]: Abstraction has 850 states and 1266 transitions. [2023-11-21 21:03:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1266 transitions. [2023-11-21 21:03:36,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2023-11-21 21:03:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 850 states have (on average 1.4894117647058824) internal successors, (1266), 849 states have internal predecessors, (1266), 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-21 21:03:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1266 transitions. [2023-11-21 21:03:36,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 850 states and 1266 transitions. [2023-11-21 21:03:36,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:36,422 INFO L428 stractBuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2023-11-21 21:03:36,422 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 21:03:36,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1266 transitions. [2023-11-21 21:03:36,429 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2023-11-21 21:03:36,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:03:36,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:03:36,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:03:36,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:36,430 INFO L748 eck$LassoCheckResult]: Stem: 2624#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 2594#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 2595#L141-1 [2023-11-21 21:03:36,431 INFO L750 eck$LassoCheckResult]: Loop: 2595#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 2777#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 2774#L63 assume !(0 != main_~p1~0#1); 2775#L63-2 assume !(0 != main_~p2~0#1); 2761#L67-1 assume !(0 != main_~p3~0#1); 2762#L71-1 assume !(0 != main_~p4~0#1); 2744#L75-1 assume !(0 != main_~p5~0#1); 2746#L79-1 assume !(0 != main_~p6~0#1); 2731#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2732#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2716#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2717#L95-1 assume !(0 != main_~p1~0#1); 2800#L101-1 assume !(0 != main_~p2~0#1); 2799#L106-1 assume !(0 != main_~p3~0#1); 2796#L111-1 assume !(0 != main_~p4~0#1); 2794#L116-1 assume !(0 != main_~p5~0#1); 2792#L121-1 assume !(0 != main_~p6~0#1); 2789#L126-1 assume !(0 != main_~p7~0#1); 2785#L131-1 assume !(0 != main_~p8~0#1); 2781#L136-1 assume !(0 != main_~p9~0#1); 2595#L141-1 [2023-11-21 21:03:36,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:36,431 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2023-11-21 21:03:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:36,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962525047] [2023-11-21 21:03:36,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:36,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:36,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:36,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:03:36,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:36,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1470606057, now seen corresponding path program 1 times [2023-11-21 21:03:36,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:36,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79469163] [2023-11-21 21:03:36,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:36,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:36,495 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-21 21:03:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:36,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79469163] [2023-11-21 21:03:36,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79469163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:36,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:36,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:03:36,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944025068] [2023-11-21 21:03:36,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:36,497 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:03:36,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:36,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:36,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:36,500 INFO L87 Difference]: Start difference. First operand 850 states and 1266 transitions. cyclomatic complexity: 448 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 21:03:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:36,533 INFO L93 Difference]: Finished difference Result 1666 states and 2434 transitions. [2023-11-21 21:03:36,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1666 states and 2434 transitions. [2023-11-21 21:03:36,558 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2023-11-21 21:03:36,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1666 states to 1666 states and 2434 transitions. [2023-11-21 21:03:36,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1666 [2023-11-21 21:03:36,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1666 [2023-11-21 21:03:36,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1666 states and 2434 transitions. [2023-11-21 21:03:36,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:36,612 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2023-11-21 21:03:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states and 2434 transitions. [2023-11-21 21:03:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2023-11-21 21:03:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1666 states have (on average 1.460984393757503) internal successors, (2434), 1665 states have internal predecessors, (2434), 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-21 21:03:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2434 transitions. [2023-11-21 21:03:36,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2023-11-21 21:03:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:36,727 INFO L428 stractBuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2023-11-21 21:03:36,727 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 21:03:36,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1666 states and 2434 transitions. [2023-11-21 21:03:36,739 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2023-11-21 21:03:36,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:03:36,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:03:36,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:03:36,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:36,746 INFO L748 eck$LassoCheckResult]: Stem: 5145#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 5116#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 5117#L141-1 [2023-11-21 21:03:36,747 INFO L750 eck$LassoCheckResult]: Loop: 5117#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 5462#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 5460#L63 assume !(0 != main_~p1~0#1); 5458#L63-2 assume !(0 != main_~p2~0#1); 5456#L67-1 assume !(0 != main_~p3~0#1); 5453#L71-1 assume !(0 != main_~p4~0#1); 5450#L75-1 assume !(0 != main_~p5~0#1); 5448#L79-1 assume !(0 != main_~p6~0#1); 5444#L83-1 assume !(0 != main_~p7~0#1); 5442#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5440#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5438#L95-1 assume !(0 != main_~p1~0#1); 5432#L101-1 assume !(0 != main_~p2~0#1); 5433#L106-1 assume !(0 != main_~p3~0#1); 5418#L111-1 assume !(0 != main_~p4~0#1); 5419#L116-1 assume !(0 != main_~p5~0#1); 5469#L121-1 assume !(0 != main_~p6~0#1); 5467#L126-1 assume !(0 != main_~p7~0#1); 5466#L131-1 assume !(0 != main_~p8~0#1); 5464#L136-1 assume !(0 != main_~p9~0#1); 5117#L141-1 [2023-11-21 21:03:36,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2023-11-21 21:03:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501162351] [2023-11-21 21:03:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:36,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:36,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:03:36,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1212440619, now seen corresponding path program 1 times [2023-11-21 21:03:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:36,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005014778] [2023-11-21 21:03:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:36,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:36,785 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-21 21:03:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:36,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005014778] [2023-11-21 21:03:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005014778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:03:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329750814] [2023-11-21 21:03:36,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:36,787 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:03:36,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:36,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:36,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:36,789 INFO L87 Difference]: Start difference. First operand 1666 states and 2434 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-21 21:03:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:36,819 INFO L93 Difference]: Finished difference Result 3266 states and 4674 transitions. [2023-11-21 21:03:36,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3266 states and 4674 transitions. [2023-11-21 21:03:36,849 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2023-11-21 21:03:36,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3266 states to 3266 states and 4674 transitions. [2023-11-21 21:03:36,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3266 [2023-11-21 21:03:36,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3266 [2023-11-21 21:03:36,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3266 states and 4674 transitions. [2023-11-21 21:03:36,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:36,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2023-11-21 21:03:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states and 4674 transitions. [2023-11-21 21:03:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2023-11-21 21:03:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3266 states have (on average 1.4311083894672383) internal successors, (4674), 3265 states have internal predecessors, (4674), 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-21 21:03:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4674 transitions. [2023-11-21 21:03:36,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2023-11-21 21:03:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:36,977 INFO L428 stractBuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2023-11-21 21:03:36,977 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-21 21:03:36,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3266 states and 4674 transitions. [2023-11-21 21:03:37,001 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2023-11-21 21:03:37,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:03:37,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:03:37,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:03:37,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:37,003 INFO L748 eck$LassoCheckResult]: Stem: 10087#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 10054#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 10055#L141-1 [2023-11-21 21:03:37,003 INFO L750 eck$LassoCheckResult]: Loop: 10055#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 10201#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 10202#L63 assume !(0 != main_~p1~0#1); 10179#L63-2 assume !(0 != main_~p2~0#1); 10181#L67-1 assume !(0 != main_~p3~0#1); 10157#L71-1 assume !(0 != main_~p4~0#1); 10159#L75-1 assume !(0 != main_~p5~0#1); 10140#L79-1 assume !(0 != main_~p6~0#1); 10142#L83-1 assume !(0 != main_~p7~0#1); 10264#L87-1 assume !(0 != main_~p8~0#1); 10263#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 10261#L95-1 assume !(0 != main_~p1~0#1); 10257#L101-1 assume !(0 != main_~p2~0#1); 10254#L106-1 assume !(0 != main_~p3~0#1); 10249#L111-1 assume !(0 != main_~p4~0#1); 10245#L116-1 assume !(0 != main_~p5~0#1); 10241#L121-1 assume !(0 != main_~p6~0#1); 10238#L126-1 assume !(0 != main_~p7~0#1); 10239#L131-1 assume !(0 != main_~p8~0#1); 10218#L136-1 assume !(0 != main_~p9~0#1); 10055#L141-1 [2023-11-21 21:03:37,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2023-11-21 21:03:37,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:37,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985244222] [2023-11-21 21:03:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:37,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:37,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:03:37,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash -511376041, now seen corresponding path program 1 times [2023-11-21 21:03:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059866095] [2023-11-21 21:03:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:37,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:03:37,046 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-21 21:03:37,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:03:37,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059866095] [2023-11-21 21:03:37,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059866095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:03:37,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:03:37,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:03:37,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559954383] [2023-11-21 21:03:37,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:03:37,048 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:03:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:03:37,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:03:37,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:03:37,049 INFO L87 Difference]: Start difference. First operand 3266 states and 4674 transitions. cyclomatic complexity: 1536 Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-21 21:03:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:03:37,094 INFO L93 Difference]: Finished difference Result 6402 states and 8962 transitions. [2023-11-21 21:03:37,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6402 states and 8962 transitions. [2023-11-21 21:03:37,155 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2023-11-21 21:03:37,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6402 states to 6402 states and 8962 transitions. [2023-11-21 21:03:37,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6402 [2023-11-21 21:03:37,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6402 [2023-11-21 21:03:37,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6402 states and 8962 transitions. [2023-11-21 21:03:37,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:03:37,224 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2023-11-21 21:03:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states and 8962 transitions. [2023-11-21 21:03:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6402. [2023-11-21 21:03:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6402 states, 6402 states have (on average 1.3998750390502968) internal successors, (8962), 6401 states have internal predecessors, (8962), 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-21 21:03:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 8962 transitions. [2023-11-21 21:03:37,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2023-11-21 21:03:37,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:03:37,470 INFO L428 stractBuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2023-11-21 21:03:37,471 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-21 21:03:37,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6402 states and 8962 transitions. [2023-11-21 21:03:37,504 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2023-11-21 21:03:37,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:03:37,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:03:37,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:03:37,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:03:37,507 INFO L748 eck$LassoCheckResult]: Stem: 19763#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 19728#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 19729#L141-1 [2023-11-21 21:03:37,507 INFO L750 eck$LassoCheckResult]: Loop: 19729#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 19928#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 19925#L63 assume !(0 != main_~p1~0#1); 19926#L63-2 assume !(0 != main_~p2~0#1); 19905#L67-1 assume !(0 != main_~p3~0#1); 19906#L71-1 assume !(0 != main_~p4~0#1); 19889#L75-1 assume !(0 != main_~p5~0#1); 19891#L79-1 assume !(0 != main_~p6~0#1); 19865#L83-1 assume !(0 != main_~p7~0#1); 19867#L87-1 assume !(0 != main_~p8~0#1); 19841#L91-1 assume !(0 != main_~p9~0#1); 19843#L95-1 assume !(0 != main_~p1~0#1); 19952#L101-1 assume !(0 != main_~p2~0#1); 19951#L106-1 assume !(0 != main_~p3~0#1); 19948#L111-1 assume !(0 != main_~p4~0#1); 19946#L116-1 assume !(0 != main_~p5~0#1); 19944#L121-1 assume !(0 != main_~p6~0#1); 19940#L126-1 assume !(0 != main_~p7~0#1); 19936#L131-1 assume !(0 != main_~p8~0#1); 19932#L136-1 assume !(0 != main_~p9~0#1); 19729#L141-1 [2023-11-21 21:03:37,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2023-11-21 21:03:37,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:37,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20198942] [2023-11-21 21:03:37,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:37,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:37,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:37,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:03:37,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash -904403051, now seen corresponding path program 1 times [2023-11-21 21:03:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:37,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578887107] [2023-11-21 21:03:37,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:37,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:37,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:37,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:03:37,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:03:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash 551712343, now seen corresponding path program 1 times [2023-11-21 21:03:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:03:37,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324921476] [2023-11-21 21:03:37,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:03:37,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:03:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:37,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:37,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:03:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:38,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:03:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:03:38,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.11 09:03:38 BoogieIcfgContainer [2023-11-21 21:03:38,154 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-21 21:03:38,155 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 21:03:38,155 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 21:03:38,155 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 21:03:38,156 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:03:35" (3/4) ... [2023-11-21 21:03:38,157 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-21 21:03:38,215 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 21:03:38,215 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 21:03:38,216 INFO L158 Benchmark]: Toolchain (without parser) took 3915.15ms. Allocated memory was 142.6MB in the beginning and 195.0MB in the end (delta: 52.4MB). Free memory was 97.1MB in the beginning and 63.4MB in the end (delta: 33.8MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. [2023-11-21 21:03:38,216 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 21:03:38,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.36ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 86.0MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-21 21:03:38,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.09ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 84.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 21:03:38,221 INFO L158 Benchmark]: Boogie Preprocessor took 41.76ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 82.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 21:03:38,222 INFO L158 Benchmark]: RCFGBuilder took 400.92ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 70.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-21 21:03:38,222 INFO L158 Benchmark]: BuchiAutomizer took 3086.59ms. Allocated memory was 142.6MB in the beginning and 195.0MB in the end (delta: 52.4MB). Free memory was 70.4MB in the beginning and 65.5MB in the end (delta: 4.9MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2023-11-21 21:03:38,222 INFO L158 Benchmark]: Witness Printer took 60.19ms. Allocated memory is still 195.0MB. Free memory was 65.5MB in the beginning and 63.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 21:03:38,224 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.34ms. Allocated memory is still 142.6MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.36ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 86.0MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.09ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 84.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.76ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 82.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 400.92ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 70.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3086.59ms. Allocated memory was 142.6MB in the beginning and 195.0MB in the end (delta: 52.4MB). Free memory was 70.4MB in the beginning and 65.5MB in the end (delta: 4.9MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * Witness Printer took 60.19ms. Allocated memory is still 195.0MB. Free memory was 65.5MB in the beginning and 63.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6402 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 299 mSDsluCounter, 937 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 355 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 582 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI8 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 38]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 38]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-21 21:03:38,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ca2259-1261-4ea3-80ba-e4c588cb3629/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)