./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/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_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/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_64d87c84-3d8b-4ece-931d-78891f8b0f58/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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:14:47,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:14:47,198 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 22:14:47,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:14:47,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:14:47,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:14:47,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:14:47,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:14:47,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:14:47,262 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:14:47,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:14:47,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:14:47,263 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:14:47,266 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 22:14:47,266 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 22:14:47,267 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 22:14:47,267 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 22:14:47,268 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 22:14:47,268 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 22:14:47,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:14:47,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 22:14:47,269 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:14:47,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:14:47,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:14:47,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:14:47,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 22:14:47,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 22:14:47,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 22:14:47,272 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:14:47,273 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:14:47,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:14:47,274 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 22:14:47,274 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:14:47,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:14:47,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:14:47,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:14:47,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:14:47,276 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 22:14:47,276 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_64d87c84-3d8b-4ece-931d-78891f8b0f58/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_64d87c84-3d8b-4ece-931d-78891f8b0f58/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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2023-11-21 22:14:47,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:14:47,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:14:47,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:14:47,653 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:14:47,654 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:14:47,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/locks/test_locks_11.c [2023-11-21 22:14:50,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:14:51,177 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:14:51,178 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/sv-benchmarks/c/locks/test_locks_11.c [2023-11-21 22:14:51,187 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/data/e2d4145f7/cb51d3eafef345f2927c9e80eedf859c/FLAG7d346de80 [2023-11-21 22:14:51,201 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/data/e2d4145f7/cb51d3eafef345f2927c9e80eedf859c [2023-11-21 22:14:51,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:14:51,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:14:51,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:51,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:14:51,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:14:51,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e4ba0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51, skipping insertion in model container [2023-11-21 22:14:51,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,253 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:14:51,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:51,459 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:14:51,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:51,502 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:14:51,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51 WrapperNode [2023-11-21 22:14:51,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:51,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:51,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:14:51,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:14:51,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,542 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2023-11-21 22:14:51,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:51,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:14:51,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:14:51,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:14:51,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,556 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,566 INFO L187 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-21 22:14:51,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:14:51,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:14:51,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:14:51,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:14:51,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (1/1) ... [2023-11-21 22:14:51,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:14:51,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:51,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:14:51,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 22:14:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:14:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:14:51,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:14:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:14:51,820 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:14:51,822 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:14:52,032 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:14:52,043 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:14:52,043 INFO L308 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-21 22:14:52,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:52 BoogieIcfgContainer [2023-11-21 22:14:52,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:14:52,046 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 22:14:52,046 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 22:14:52,050 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 22:14:52,051 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:14:52,052 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 10:14:51" (1/3) ... [2023-11-21 22:14:52,053 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57cdf3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:14:52, skipping insertion in model container [2023-11-21 22:14:52,053 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:14:52,053 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:51" (2/3) ... [2023-11-21 22:14:52,054 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57cdf3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:14:52, skipping insertion in model container [2023-11-21 22:14:52,054 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:14:52,054 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:52" (3/3) ... [2023-11-21 22:14:52,055 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2023-11-21 22:14:52,112 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 22:14:52,112 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 22:14:52,112 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 22:14:52,112 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 22:14:52,112 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 22:14:52,113 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 22:14:52,113 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 22:14:52,113 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 22:14:52,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 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 22:14:52,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-11-21 22:14:52,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:52,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:52,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:52,143 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, 1, 1, 1, 1] [2023-11-21 22:14:52,143 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 22:14:52,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 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 22:14:52,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-11-21 22:14:52,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:52,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:52,149 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:52,149 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, 1, 1, 1, 1] [2023-11-21 22:14:52,158 INFO L748 eck$LassoCheckResult]: Stem: 39#$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(16, 2);call #Ultimate.allocInit(12, 3); 9#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_#t~nondet14#1, main_#t~nondet15#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_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~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_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 26#L169-1true [2023-11-21 22:14:52,159 INFO L750 eck$LassoCheckResult]: Loop: 26#L169-1true assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 14#L46true 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;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 41#L73true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 42#L73-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 27#L77-1true assume !(0 != main_~p3~0#1); 5#L81-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 23#L85-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 19#L89-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L93-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 22#L97-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 28#L101-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 36#L105-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24#L109-1true assume !(0 != main_~p11~0#1); 21#L113-1true assume !(0 != main_~p1~0#1); 37#L119-1true assume !(0 != main_~p2~0#1); 8#L124-1true assume !(0 != main_~p3~0#1); 11#L129-1true assume !(0 != main_~p4~0#1); 20#L134-1true assume !(0 != main_~p5~0#1); 10#L139-1true assume !(0 != main_~p6~0#1); 3#L144-1true assume !(0 != main_~p7~0#1); 34#L149-1true assume !(0 != main_~p8~0#1); 18#L154-1true assume !(0 != main_~p9~0#1); 7#L159-1true assume !(0 != main_~p10~0#1); 38#L164-1true assume !(0 != main_~p11~0#1); 26#L169-1true [2023-11-21 22:14:52,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:52,165 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-21 22:14:52,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:52,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921526397] [2023-11-21 22:14:52,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:52,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:52,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:52,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:52,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:52,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2023-11-21 22:14:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:52,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612165531] [2023-11-21 22:14:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:52,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,459 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 22:14:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612165531] [2023-11-21 22:14:52,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612165531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:52,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:52,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970599699] [2023-11-21 22:14:52,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:52,466 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:52,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:52,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:52,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:52,517 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 22:14:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:52,596 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2023-11-21 22:14:52,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 141 transitions. [2023-11-21 22:14:52,605 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2023-11-21 22:14:52,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 71 states and 113 transitions. [2023-11-21 22:14:52,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2023-11-21 22:14:52,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2023-11-21 22:14:52,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2023-11-21 22:14:52,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:52,621 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2023-11-21 22:14:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2023-11-21 22:14:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-21 22:14:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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 22:14:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2023-11-21 22:14:52,674 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2023-11-21 22:14:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:52,684 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2023-11-21 22:14:52,684 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 22:14:52,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2023-11-21 22:14:52,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2023-11-21 22:14:52,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:52,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:52,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:52,697 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, 1, 1, 1, 1] [2023-11-21 22:14:52,697 INFO L748 eck$LassoCheckResult]: Stem: 168#$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(16, 2);call #Ultimate.allocInit(12, 3); 144#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_#t~nondet14#1, main_#t~nondet15#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_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~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_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 145#L169-1 [2023-11-21 22:14:52,697 INFO L750 eck$LassoCheckResult]: Loop: 145#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 176#L46 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;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 175#L73 assume !(0 != main_~p1~0#1); 170#L73-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 164#L77-1 assume !(0 != main_~p3~0#1); 134#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 135#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 157#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 148#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 149#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 160#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 174#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 173#L109-1 assume !(0 != main_~p11~0#1); 171#L113-1 assume !(0 != main_~p1~0#1); 172#L119-1 assume !(0 != main_~p2~0#1); 196#L124-1 assume !(0 != main_~p3~0#1); 193#L129-1 assume !(0 != main_~p4~0#1); 190#L134-1 assume !(0 != main_~p5~0#1); 188#L139-1 assume !(0 != main_~p6~0#1); 186#L144-1 assume !(0 != main_~p7~0#1); 184#L149-1 assume !(0 != main_~p8~0#1); 182#L154-1 assume !(0 != main_~p9~0#1); 180#L159-1 assume !(0 != main_~p10~0#1); 178#L164-1 assume !(0 != main_~p11~0#1); 145#L169-1 [2023-11-21 22:14:52,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-21 22:14:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:52,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649342525] [2023-11-21 22:14:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:52,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:52,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:52,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2023-11-21 22:14:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:52,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366413962] [2023-11-21 22:14:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,847 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 22:14:52,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:52,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366413962] [2023-11-21 22:14:52,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366413962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:52,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:52,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:52,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426041234] [2023-11-21 22:14:52,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:52,849 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:52,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:52,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:52,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:52,850 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 22:14:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:52,889 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2023-11-21 22:14:52,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2023-11-21 22:14:52,899 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2023-11-21 22:14:52,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2023-11-21 22:14:52,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2023-11-21 22:14:52,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2023-11-21 22:14:52,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2023-11-21 22:14:52,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:52,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2023-11-21 22:14:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2023-11-21 22:14:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2023-11-21 22:14:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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 22:14:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2023-11-21 22:14:52,929 INFO L240 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2023-11-21 22:14:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:52,931 INFO L428 stractBuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2023-11-21 22:14:52,931 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 22:14:52,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2023-11-21 22:14:52,933 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2023-11-21 22:14:52,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:52,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:52,938 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:52,939 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, 1, 1, 1, 1] [2023-11-21 22:14:52,940 INFO L748 eck$LassoCheckResult]: Stem: 387#$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(16, 2);call #Ultimate.allocInit(12, 3); 359#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_#t~nondet14#1, main_#t~nondet15#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_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~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_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 360#L169-1 [2023-11-21 22:14:52,942 INFO L750 eck$LassoCheckResult]: Loop: 360#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 402#L46 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;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 403#L73 assume !(0 != main_~p1~0#1); 404#L73-2 assume !(0 != main_~p2~0#1); 481#L77-1 assume !(0 != main_~p3~0#1); 479#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 477#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 475#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 473#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 471#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 469#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 468#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 467#L109-1 assume !(0 != main_~p11~0#1); 465#L113-1 assume !(0 != main_~p1~0#1); 466#L119-1 assume !(0 != main_~p2~0#1); 356#L124-1 assume !(0 != main_~p3~0#1); 357#L129-1 assume !(0 != main_~p4~0#1); 352#L134-1 assume !(0 != main_~p5~0#1); 361#L139-1 assume !(0 != main_~p6~0#1); 346#L144-1 assume !(0 != main_~p7~0#1); 348#L149-1 assume !(0 != main_~p8~0#1); 370#L154-1 assume !(0 != main_~p9~0#1); 371#L159-1 assume !(0 != main_~p10~0#1); 411#L164-1 assume !(0 != main_~p11~0#1); 360#L169-1 [2023-11-21 22:14:52,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:52,945 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-21 22:14:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402566467] [2023-11-21 22:14:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:52,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:52,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:52,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2023-11-21 22:14:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:52,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250853678] [2023-11-21 22:14:52,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:52,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,036 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 22:14:53,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:53,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250853678] [2023-11-21 22:14:53,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250853678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:53,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220075864] [2023-11-21 22:14:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:53,038 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:53,040 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 22:14:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:53,066 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2023-11-21 22:14:53,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2023-11-21 22:14:53,070 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2023-11-21 22:14:53,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2023-11-21 22:14:53,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2023-11-21 22:14:53,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2023-11-21 22:14:53,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2023-11-21 22:14:53,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:53,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2023-11-21 22:14:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2023-11-21 22:14:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2023-11-21 22:14:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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 22:14:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2023-11-21 22:14:53,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2023-11-21 22:14:53,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:53,115 INFO L428 stractBuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2023-11-21 22:14:53,115 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 22:14:53,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2023-11-21 22:14:53,118 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2023-11-21 22:14:53,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:53,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:53,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:53,120 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, 1, 1, 1, 1] [2023-11-21 22:14:53,121 INFO L748 eck$LassoCheckResult]: Stem: 805#$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(16, 2);call #Ultimate.allocInit(12, 3); 773#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_#t~nondet14#1, main_#t~nondet15#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_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~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_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 774#L169-1 [2023-11-21 22:14:53,121 INFO L750 eck$LassoCheckResult]: Loop: 774#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 859#L46 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;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 853#L73 assume !(0 != main_~p1~0#1); 847#L73-2 assume !(0 != main_~p2~0#1); 848#L77-1 assume !(0 != main_~p3~0#1); 928#L81-1 assume !(0 != main_~p4~0#1); 926#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 923#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 834#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 835#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 830#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 803#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 794#L109-1 assume !(0 != main_~p11~0#1); 795#L113-1 assume !(0 != main_~p1~0#1); 905#L119-1 assume !(0 != main_~p2~0#1); 906#L124-1 assume !(0 != main_~p3~0#1); 947#L129-1 assume !(0 != main_~p4~0#1); 946#L134-1 assume !(0 != main_~p5~0#1); 944#L139-1 assume !(0 != main_~p6~0#1); 942#L144-1 assume !(0 != main_~p7~0#1); 940#L149-1 assume !(0 != main_~p8~0#1); 938#L154-1 assume !(0 != main_~p9~0#1); 936#L159-1 assume !(0 != main_~p10~0#1); 867#L164-1 assume !(0 != main_~p11~0#1); 774#L169-1 [2023-11-21 22:14:53,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:53,122 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-21 22:14:53,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000086359] [2023-11-21 22:14:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:53,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:53,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:53,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:53,155 INFO L85 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2023-11-21 22:14:53,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:53,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355610976] [2023-11-21 22:14:53,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:53,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,238 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 22:14:53,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:53,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355610976] [2023-11-21 22:14:53,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355610976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:53,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:53,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514764861] [2023-11-21 22:14:53,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:53,241 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:53,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:53,243 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 22:14:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:53,282 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2023-11-21 22:14:53,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2023-11-21 22:14:53,290 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2023-11-21 22:14:53,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2023-11-21 22:14:53,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2023-11-21 22:14:53,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2023-11-21 22:14:53,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2023-11-21 22:14:53,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:53,304 INFO L218 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2023-11-21 22:14:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2023-11-21 22:14:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2023-11-21 22:14:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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 22:14:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2023-11-21 22:14:53,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2023-11-21 22:14:53,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:53,334 INFO L428 stractBuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2023-11-21 22:14:53,335 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 22:14:53,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2023-11-21 22:14:53,339 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2023-11-21 22:14:53,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:53,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:53,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:53,340 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, 1, 1, 1, 1] [2023-11-21 22:14:53,341 INFO L748 eck$LassoCheckResult]: Stem: 1611#$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(16, 2);call #Ultimate.allocInit(12, 3); 1579#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_#t~nondet14#1, main_#t~nondet15#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_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~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_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 1580#L169-1 [2023-11-21 22:14:53,341 INFO L750 eck$LassoCheckResult]: Loop: 1580#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 1703#L46 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;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 1696#L73 assume !(0 != main_~p1~0#1); 1688#L73-2 assume !(0 != main_~p2~0#1); 1690#L77-1 assume !(0 != main_~p3~0#1); 1668#L81-1 assume !(0 != main_~p4~0#1); 1670#L85-1 assume !(0 != main_~p5~0#1); 1811#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1857#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1856#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1855#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1854#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1853#L109-1 assume !(0 != main_~p11~0#1); 1852#L113-1 assume !(0 != main_~p1~0#1); 1851#L119-1 assume !(0 != main_~p2~0#1); 1850#L124-1 assume !(0 != main_~p3~0#1); 1844#L129-1 assume !(0 != main_~p4~0#1); 1839#L134-1 assume !(0 != main_~p5~0#1); 1840#L139-1 assume !(0 != main_~p6~0#1); 1847#L144-1 assume !(0 != main_~p7~0#1); 1832#L149-1 assume !(0 != main_~p8~0#1); 1774#L154-1 assume !(0 != main_~p9~0#1); 1773#L159-1 assume !(0 != main_~p10~0#1); 1715#L164-1 assume !(0 != main_~p11~0#1); 1580#L169-1 [2023-11-21 22:14:53,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2023-11-21 22:14:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:53,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260686654] [2023-11-21 22:14:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:53,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:53,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:53,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2023-11-21 22:14:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:53,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114276419] [2023-11-21 22:14:53,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,407 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 22:14:53,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:53,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114276419] [2023-11-21 22:14:53,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114276419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:53,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:53,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:53,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252255516] [2023-11-21 22:14:53,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:53,409 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:53,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:53,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:53,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:53,411 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 22:14:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:53,438 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2023-11-21 22:14:53,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2023-11-21 22:14:53,451 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2023-11-21 22:14:53,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2023-11-21 22:14:53,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2023-11-21 22:14:53,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2023-11-21 22:14:53,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2023-11-21 22:14:53,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:53,466 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2023-11-21 22:14:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2023-11-21 22:14:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2023-11-21 22:14:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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 22:14:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2023-11-21 22:14:53,493 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2023-11-21 22:14:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:53,496 INFO L428 stractBuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2023-11-21 22:14:53,497 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 22:14:53,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2023-11-21 22:14:53,504 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2023-11-21 22:14:53,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:53,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:53,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:53,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, 1, 1, 1, 1] [2023-11-21 22:14:53,507 INFO L748 eck$LassoCheckResult]: Stem: 3187#$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(16, 2);call #Ultimate.allocInit(12, 3); 3157#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_#t~nondet14#1, main_#t~nondet15#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_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~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_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 3158#L169-1 [2023-11-21 22:14:53,507 INFO L750 eck$LassoCheckResult]: Loop: 3158#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 3278#L46 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;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 3274#L73 assume !(0 != main_~p1~0#1); 3270#L73-2 assume !(0 != main_~p2~0#1); 3268#L77-1 assume !(0 != main_~p3~0#1); 3239#L81-1 assume !(0 != main_~p4~0#1); 3237#L85-1 assume !(0 != main_~p5~0#1); 3238#L89-1 assume !(0 != main_~p6~0#1); 3375#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3371#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3368#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3363#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3362#L109-1 assume !(0 != main_~p11~0#1); 3329#L113-1 assume !(0 != main_~p1~0#1); 3325#L119-1 assume !(0 != main_~p2~0#1); 3324#L124-1 assume !(0 != main_~p3~0#1); 3321#L129-1 assume !(0 != main_~p4~0#1); 3319#L134-1 assume !(0 != main_~p5~0#1); 3317#L139-1 assume !(0 != main_~p6~0#1); 3316#L144-1 assume !(0 != main_~p7~0#1); 3314#L149-1 assume !(0 != main_~p8~0#1); 3312#L154-1 assume !(0 != main_~p9~0#1); 3310#L159-1 assume !(0 != main_~p10~0#1); 3282#L164-1 assume !(0 != main_~p11~0#1); 3158#L169-1 [2023-11-21 22:14:53,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:53,508 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2023-11-21 22:14:53,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:53,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117125662] [2023-11-21 22:14:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:53,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:53,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:53,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:53,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:53,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2023-11-21 22:14:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:53,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178814980] [2023-11-21 22:14:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,584 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 22:14:53,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178814980] [2023-11-21 22:14:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178814980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:53,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104939770] [2023-11-21 22:14:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:53,587 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:53,588 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 22:14:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:53,617 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2023-11-21 22:14:53,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2023-11-21 22:14:53,655 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2023-11-21 22:14:53,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2023-11-21 22:14:53,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2023-11-21 22:14:53,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2023-11-21 22:14:53,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2023-11-21 22:14:53,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:53,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2023-11-21 22:14:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2023-11-21 22:14:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2023-11-21 22:14:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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 22:14:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2023-11-21 22:14:53,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2023-11-21 22:14:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:53,737 INFO L428 stractBuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2023-11-21 22:14:53,737 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 22:14:53,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2023-11-21 22:14:53,753 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2023-11-21 22:14:53,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:53,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:53,754 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:53,754 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, 1, 1, 1, 1] [2023-11-21 22:14:53,754 INFO L748 eck$LassoCheckResult]: Stem: 6284#$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(16, 2);call #Ultimate.allocInit(12, 3); 6254#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_#t~nondet14#1, main_#t~nondet15#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_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~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_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 6255#L169-1 [2023-11-21 22:14:53,754 INFO L750 eck$LassoCheckResult]: Loop: 6255#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 6353#L46 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;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 6351#L73 assume !(0 != main_~p1~0#1); 6347#L73-2 assume !(0 != main_~p2~0#1); 6345#L77-1 assume !(0 != main_~p3~0#1); 6341#L81-1 assume !(0 != main_~p4~0#1); 6337#L85-1 assume !(0 != main_~p5~0#1); 6333#L89-1 assume !(0 != main_~p6~0#1); 6329#L93-1 assume !(0 != main_~p7~0#1); 6327#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6325#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6323#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6321#L109-1 assume !(0 != main_~p11~0#1); 6318#L113-1 assume !(0 != main_~p1~0#1); 6319#L119-1 assume !(0 != main_~p2~0#1); 6389#L124-1 assume !(0 != main_~p3~0#1); 6384#L129-1 assume !(0 != main_~p4~0#1); 6380#L134-1 assume !(0 != main_~p5~0#1); 6376#L139-1 assume !(0 != main_~p6~0#1); 6372#L144-1 assume !(0 != main_~p7~0#1); 6369#L149-1 assume !(0 != main_~p8~0#1); 6365#L154-1 assume !(0 != main_~p9~0#1); 6361#L159-1 assume !(0 != main_~p10~0#1); 6357#L164-1 assume !(0 != main_~p11~0#1); 6255#L169-1 [2023-11-21 22:14:53,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2023-11-21 22:14:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:53,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867435912] [2023-11-21 22:14:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:53,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:53,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:53,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2023-11-21 22:14:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:53,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24633296] [2023-11-21 22:14:53,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,807 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 22:14:53,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:53,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24633296] [2023-11-21 22:14:53,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24633296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:53,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:53,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:53,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472382765] [2023-11-21 22:14:53,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:53,809 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:53,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:53,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:53,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:53,810 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 22:14:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:53,849 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2023-11-21 22:14:53,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2023-11-21 22:14:53,887 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2023-11-21 22:14:53,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2023-11-21 22:14:53,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2023-11-21 22:14:53,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2023-11-21 22:14:53,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2023-11-21 22:14:53,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:53,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2023-11-21 22:14:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2023-11-21 22:14:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2023-11-21 22:14:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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 22:14:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2023-11-21 22:14:54,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2023-11-21 22:14:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:54,085 INFO L428 stractBuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2023-11-21 22:14:54,085 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-21 22:14:54,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2023-11-21 22:14:54,113 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2023-11-21 22:14:54,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:54,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:54,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:54,114 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, 1, 1, 1, 1] [2023-11-21 22:14:54,115 INFO L748 eck$LassoCheckResult]: Stem: 12378#$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(16, 2);call #Ultimate.allocInit(12, 3); 12344#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_#t~nondet14#1, main_#t~nondet15#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_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~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_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 12345#L169-1 [2023-11-21 22:14:54,115 INFO L750 eck$LassoCheckResult]: Loop: 12345#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 12485#L46 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;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 12481#L73 assume !(0 != main_~p1~0#1); 12474#L73-2 assume !(0 != main_~p2~0#1); 12469#L77-1 assume !(0 != main_~p3~0#1); 12462#L81-1 assume !(0 != main_~p4~0#1); 12454#L85-1 assume !(0 != main_~p5~0#1); 12446#L89-1 assume !(0 != main_~p6~0#1); 12438#L93-1 assume !(0 != main_~p7~0#1); 12432#L97-1 assume !(0 != main_~p8~0#1); 12427#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 12424#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 12420#L109-1 assume !(0 != main_~p11~0#1); 12421#L113-1 assume !(0 != main_~p1~0#1); 12410#L119-1 assume !(0 != main_~p2~0#1); 12412#L124-1 assume !(0 != main_~p3~0#1); 12562#L129-1 assume !(0 != main_~p4~0#1); 12560#L134-1 assume !(0 != main_~p5~0#1); 12550#L139-1 assume !(0 != main_~p6~0#1); 12546#L144-1 assume !(0 != main_~p7~0#1); 12543#L149-1 assume !(0 != main_~p8~0#1); 12539#L154-1 assume !(0 != main_~p9~0#1); 12508#L159-1 assume !(0 != main_~p10~0#1); 12494#L164-1 assume !(0 != main_~p11~0#1); 12345#L169-1 [2023-11-21 22:14:54,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:54,116 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2023-11-21 22:14:54,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:54,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849803379] [2023-11-21 22:14:54,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:54,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:54,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:54,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:54,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2023-11-21 22:14:54,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:54,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384696044] [2023-11-21 22:14:54,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:54,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:54,155 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 22:14:54,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:54,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384696044] [2023-11-21 22:14:54,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384696044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:54,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:54,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:54,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250393809] [2023-11-21 22:14:54,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:54,157 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:54,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:54,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:54,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:54,158 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 22:14:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:54,224 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2023-11-21 22:14:54,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2023-11-21 22:14:54,294 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2023-11-21 22:14:54,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2023-11-21 22:14:54,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2023-11-21 22:14:54,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2023-11-21 22:14:54,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2023-11-21 22:14:54,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:54,400 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2023-11-21 22:14:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2023-11-21 22:14:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2023-11-21 22:14:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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 22:14:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2023-11-21 22:14:54,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2023-11-21 22:14:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:54,675 INFO L428 stractBuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2023-11-21 22:14:54,675 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-21 22:14:54,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2023-11-21 22:14:54,713 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2023-11-21 22:14:54,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:54,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:54,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:54,715 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, 1, 1, 1, 1] [2023-11-21 22:14:54,716 INFO L748 eck$LassoCheckResult]: Stem: 24362#$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(16, 2);call #Ultimate.allocInit(12, 3); 24322#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_#t~nondet14#1, main_#t~nondet15#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_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~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_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 24323#L169-1 [2023-11-21 22:14:54,716 INFO L750 eck$LassoCheckResult]: Loop: 24323#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 24513#L46 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;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 24498#L73 assume !(0 != main_~p1~0#1); 24500#L73-2 assume !(0 != main_~p2~0#1); 24477#L77-1 assume !(0 != main_~p3~0#1); 24478#L81-1 assume !(0 != main_~p4~0#1); 24454#L85-1 assume !(0 != main_~p5~0#1); 24456#L89-1 assume !(0 != main_~p6~0#1); 24430#L93-1 assume !(0 != main_~p7~0#1); 24432#L97-1 assume !(0 != main_~p8~0#1); 24568#L101-1 assume !(0 != main_~p9~0#1); 24567#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24566#L109-1 assume !(0 != main_~p11~0#1); 24564#L113-1 assume !(0 != main_~p1~0#1); 24560#L119-1 assume !(0 != main_~p2~0#1); 24557#L124-1 assume !(0 != main_~p3~0#1); 24552#L129-1 assume !(0 != main_~p4~0#1); 24548#L134-1 assume !(0 != main_~p5~0#1); 24544#L139-1 assume !(0 != main_~p6~0#1); 24540#L144-1 assume !(0 != main_~p7~0#1); 24537#L149-1 assume !(0 != main_~p8~0#1); 24538#L154-1 assume !(0 != main_~p9~0#1); 24529#L159-1 assume !(0 != main_~p10~0#1); 24528#L164-1 assume !(0 != main_~p11~0#1); 24323#L169-1 [2023-11-21 22:14:54,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:54,717 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2023-11-21 22:14:54,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:54,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788866409] [2023-11-21 22:14:54,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:54,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:54,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:54,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:54,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2023-11-21 22:14:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:54,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231747694] [2023-11-21 22:14:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:54,771 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 22:14:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:54,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231747694] [2023-11-21 22:14:54,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231747694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:54,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:54,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:14:54,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022255076] [2023-11-21 22:14:54,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:54,773 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:54,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:54,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:14:54,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:14:54,774 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 22:14:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:54,857 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2023-11-21 22:14:54,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2023-11-21 22:14:55,061 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2023-11-21 22:14:55,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2023-11-21 22:14:55,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2023-11-21 22:14:55,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2023-11-21 22:14:55,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2023-11-21 22:14:55,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:55,206 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2023-11-21 22:14:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2023-11-21 22:14:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2023-11-21 22:14:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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 22:14:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2023-11-21 22:14:55,781 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2023-11-21 22:14:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:14:55,783 INFO L428 stractBuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2023-11-21 22:14:55,783 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-21 22:14:55,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2023-11-21 22:14:55,906 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2023-11-21 22:14:55,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:55,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:55,908 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:55,909 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, 1, 1, 1, 1] [2023-11-21 22:14:55,909 INFO L748 eck$LassoCheckResult]: Stem: 47922#$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(16, 2);call #Ultimate.allocInit(12, 3); 47883#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_#t~nondet14#1, main_#t~nondet15#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_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~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_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 47884#L169-1 [2023-11-21 22:14:55,909 INFO L750 eck$LassoCheckResult]: Loop: 47884#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 48302#L46 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;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 48299#L73 assume !(0 != main_~p1~0#1); 48295#L73-2 assume !(0 != main_~p2~0#1); 48292#L77-1 assume !(0 != main_~p3~0#1); 48289#L81-1 assume !(0 != main_~p4~0#1); 48285#L85-1 assume !(0 != main_~p5~0#1); 48280#L89-1 assume !(0 != main_~p6~0#1); 48276#L93-1 assume !(0 != main_~p7~0#1); 48272#L97-1 assume !(0 != main_~p8~0#1); 48268#L101-1 assume !(0 != main_~p9~0#1); 48269#L105-1 assume !(0 != main_~p10~0#1); 48277#L109-1 assume !(0 != main_~p11~0#1); 48274#L113-1 assume !(0 != main_~p1~0#1); 48270#L119-1 assume !(0 != main_~p2~0#1); 48266#L124-1 assume !(0 != main_~p3~0#1); 48261#L129-1 assume !(0 != main_~p4~0#1); 48258#L134-1 assume !(0 != main_~p5~0#1); 48224#L139-1 assume !(0 != main_~p6~0#1); 48211#L144-1 assume !(0 != main_~p7~0#1); 48209#L149-1 assume !(0 != main_~p8~0#1); 48205#L154-1 assume !(0 != main_~p9~0#1); 48206#L159-1 assume !(0 != main_~p10~0#1); 48307#L164-1 assume !(0 != main_~p11~0#1); 47884#L169-1 [2023-11-21 22:14:55,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:55,910 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2023-11-21 22:14:55,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:55,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419525689] [2023-11-21 22:14:55,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:55,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:55,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:55,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:55,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2023-11-21 22:14:55,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:55,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208052419] [2023-11-21 22:14:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:55,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:55,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:55,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:55,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:55,965 INFO L85 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2023-11-21 22:14:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:55,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437070663] [2023-11-21 22:14:55,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:55,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:55,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:55,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:56,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:56,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.11 10:14:56 BoogieIcfgContainer [2023-11-21 22:14:56,792 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-21 22:14:56,793 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:14:56,793 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:14:56,793 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:14:56,794 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:52" (3/4) ... [2023-11-21 22:14:56,795 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-21 22:14:56,852 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 22:14:56,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:14:56,853 INFO L158 Benchmark]: Toolchain (without parser) took 5647.21ms. Allocated memory was 153.1MB in the beginning and 377.5MB in the end (delta: 224.4MB). Free memory was 114.9MB in the beginning and 221.9MB in the end (delta: -107.1MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. [2023-11-21 22:14:56,853 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 107.0MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:14:56,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.71ms. Allocated memory is still 153.1MB. Free memory was 114.4MB in the beginning and 102.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-21 22:14:56,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.59ms. Allocated memory is still 153.1MB. Free memory was 102.9MB in the beginning and 101.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:14:56,854 INFO L158 Benchmark]: Boogie Preprocessor took 37.21ms. Allocated memory is still 153.1MB. Free memory was 101.1MB in the beginning and 99.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:14:56,855 INFO L158 Benchmark]: RCFGBuilder took 464.00ms. Allocated memory is still 153.1MB. Free memory was 99.2MB in the beginning and 115.2MB in the end (delta: -16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-21 22:14:56,855 INFO L158 Benchmark]: BuchiAutomizer took 4746.37ms. Allocated memory was 153.1MB in the beginning and 377.5MB in the end (delta: 224.4MB). Free memory was 115.2MB in the beginning and 225.1MB in the end (delta: -109.9MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. [2023-11-21 22:14:56,856 INFO L158 Benchmark]: Witness Printer took 59.38ms. Allocated memory is still 377.5MB. Free memory was 225.1MB in the beginning and 221.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 22:14:56,858 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.26ms. Allocated memory is still 107.0MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.71ms. Allocated memory is still 153.1MB. Free memory was 114.4MB in the beginning and 102.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.59ms. Allocated memory is still 153.1MB. Free memory was 102.9MB in the beginning and 101.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.21ms. Allocated memory is still 153.1MB. Free memory was 101.1MB in the beginning and 99.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.00ms. Allocated memory is still 153.1MB. Free memory was 99.2MB in the beginning and 115.2MB in the end (delta: -16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 4746.37ms. Allocated memory was 153.1MB in the beginning and 377.5MB in the end (delta: 224.4MB). Free memory was 115.2MB in the beginning and 225.1MB in the end (delta: -109.9MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. * Witness Printer took 59.38ms. Allocated memory is still 377.5MB. Free memory was 225.1MB in the beginning and 221.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. 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 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 1.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.6s 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, 409 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 1285 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 795 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 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: 44]: 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; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: 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; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-21 22:14:56,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64d87c84-3d8b-4ece-931d-78891f8b0f58/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)