./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4fc63b2a 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_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU --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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:03:09,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:03:10,047 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-31 22:03:10,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:03:10,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:03:10,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:03:10,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:03:10,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:03:10,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:03:10,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:03:10,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:03:10,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:03:10,094 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:03:10,095 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-31 22:03:10,096 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-31 22:03:10,096 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-31 22:03:10,097 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-31 22:03:10,097 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-31 22:03:10,097 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-31 22:03:10,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:03:10,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-31 22:03:10,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:03:10,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:03:10,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:03:10,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:03:10,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-31 22:03:10,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-31 22:03:10,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-31 22:03:10,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:03:10,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:03:10,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:03:10,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:03:10,103 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-31 22:03:10,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:03:10,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:03:10,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:03:10,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:03:10,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:03:10,106 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-31 22:03:10,106 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_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/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_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2024-10-31 22:03:10,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:03:10,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:03:10,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:03:10,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:03:10,573 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:03:10,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/locks/test_locks_15-1.c Unable to find full path for "g++" [2024-10-31 22:03:12,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:03:12,894 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:03:12,894 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/sv-benchmarks/c/locks/test_locks_15-1.c [2024-10-31 22:03:12,906 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/data/b1f1ec5f1/b5e2ba7dee9442c094d620d40ee9eaff/FLAGf268ec33c [2024-10-31 22:03:12,920 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/data/b1f1ec5f1/b5e2ba7dee9442c094d620d40ee9eaff [2024-10-31 22:03:12,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:03:12,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:03:12,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:03:12,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:03:12,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:03:12,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:03:12" (1/1) ... [2024-10-31 22:03:12,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ded9ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:12, skipping insertion in model container [2024-10-31 22:03:12,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:03:12" (1/1) ... [2024-10-31 22:03:12,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:03:13,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:03:13,185 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:03:13,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:03:13,234 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:03:13,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13 WrapperNode [2024-10-31 22:03:13,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:03:13,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:03:13,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:03:13,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:03:13,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,292 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 195 [2024-10-31 22:03:13,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:03:13,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:03:13,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:03:13,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:03:13,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,319 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:03:13,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:03:13,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:03:13,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:03:13,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:03:13,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (1/1) ... [2024-10-31 22:03:13,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:03:13,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:03:13,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:03:13,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-31 22:03:13,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:03:13,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:03:13,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:03:13,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:03:13,523 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:03:13,526 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:03:13,894 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-31 22:03:13,895 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:03:13,908 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:03:13,908 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:03:13,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:03:13 BoogieIcfgContainer [2024-10-31 22:03:13,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:03:13,910 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-31 22:03:13,910 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-31 22:03:13,914 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-31 22:03:13,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:03:13,916 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.10 10:03:12" (1/3) ... [2024-10-31 22:03:13,917 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1de4c5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:03:13, skipping insertion in model container [2024-10-31 22:03:13,918 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:03:13,918 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:13" (2/3) ... [2024-10-31 22:03:13,919 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1de4c5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:03:13, skipping insertion in model container [2024-10-31 22:03:13,919 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:03:13,919 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:03:13" (3/3) ... [2024-10-31 22:03:13,921 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2024-10-31 22:03:13,998 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-31 22:03:13,999 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-31 22:03:13,999 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-31 22:03:13,999 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-31 22:03:13,999 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-31 22:03:13,999 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-31 22:03:13,999 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-31 22:03:14,000 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-31 22:03:14,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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) [2024-10-31 22:03:14,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-10-31 22:03:14,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:14,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:14,028 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:14,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:14,028 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-31 22:03:14,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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) [2024-10-31 22:03:14,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-10-31 22:03:14,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:14,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:14,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:14,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:14,041 INFO L745 eck$LassoCheckResult]: Stem: 25#$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(18, 2);call #Ultimate.allocInit(12, 3); 33#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 20#L225-1true [2024-10-31 22:03:14,042 INFO L747 eck$LassoCheckResult]: Loop: 20#L225-1true assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 32#L58true 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 28#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 26#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L97-1true assume !(0 != main_~p3~0#1); 15#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 50#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 43#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 22#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 35#L129-1true assume !(0 != main_~p11~0#1); 3#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 5#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 38#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 55#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 47#L149-1true assume !(0 != main_~p1~0#1); 45#L155-1true assume 0 != main_~p2~0#1; 7#L161true assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 18#L160true assume !(0 != main_~p3~0#1); 10#L165-1true assume !(0 != main_~p4~0#1); 41#L170-1true assume !(0 != main_~p5~0#1); 44#L175-1true assume !(0 != main_~p6~0#1); 17#L180-1true assume !(0 != main_~p7~0#1); 37#L185-1true assume !(0 != main_~p8~0#1); 24#L190-1true assume !(0 != main_~p9~0#1); 40#L195-1true assume !(0 != main_~p10~0#1); 14#L200-1true assume !(0 != main_~p11~0#1); 42#L205-1true assume !(0 != main_~p12~0#1); 23#L210-1true assume !(0 != main_~p13~0#1); 4#L215-1true assume 0 != main_~p14~0#1; 13#L221true assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 54#L220true assume !(0 != main_~p15~0#1); 20#L225-1true [2024-10-31 22:03:14,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-31 22:03:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:14,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138960760] [2024-10-31 22:03:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:14,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:14,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:14,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:14,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash -638858682, now seen corresponding path program 1 times [2024-10-31 22:03:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:14,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601677243] [2024-10-31 22:03:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:14,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:14,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601677243] [2024-10-31 22:03:14,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601677243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:14,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354327544] [2024-10-31 22:03:14,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:14,367 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:03:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:14,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:14,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:14,413 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-31 22:03:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:14,458 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2024-10-31 22:03:14,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 189 transitions. [2024-10-31 22:03:14,464 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2024-10-31 22:03:14,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 95 states and 149 transitions. [2024-10-31 22:03:14,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-10-31 22:03:14,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-10-31 22:03:14,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 149 transitions. [2024-10-31 22:03:14,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:03:14,473 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-10-31 22:03:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 149 transitions. [2024-10-31 22:03:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-31 22:03:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:03:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2024-10-31 22:03:14,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-10-31 22:03:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:14,517 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-10-31 22:03:14,517 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-31 22:03:14,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 149 transitions. [2024-10-31 22:03:14,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2024-10-31 22:03:14,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:14,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:14,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:14,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:14,522 INFO L745 eck$LassoCheckResult]: Stem: 203#$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(18, 2);call #Ultimate.allocInit(12, 3); 204#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 212#L225-1 [2024-10-31 22:03:14,522 INFO L747 eck$LassoCheckResult]: Loop: 212#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 210#L58 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 211#L93 assume !(0 != main_~p1~0#1); 205#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 184#L97-1 assume !(0 != main_~p3~0#1); 185#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 189#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 225#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 247#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 246#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 245#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 244#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 242#L129-1 assume !(0 != main_~p11~0#1); 239#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 236#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 216#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 217#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 226#L149-1 assume !(0 != main_~p1~0#1); 221#L155-1 assume 0 != main_~p2~0#1; 174#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 175#L160 assume !(0 != main_~p3~0#1); 178#L165-1 assume !(0 != main_~p4~0#1); 179#L170-1 assume !(0 != main_~p5~0#1); 215#L175-1 assume !(0 != main_~p6~0#1); 192#L180-1 assume !(0 != main_~p7~0#1); 193#L185-1 assume !(0 != main_~p8~0#1); 241#L190-1 assume !(0 != main_~p9~0#1); 238#L195-1 assume !(0 != main_~p10~0#1); 186#L200-1 assume !(0 != main_~p11~0#1); 187#L205-1 assume !(0 != main_~p12~0#1); 207#L210-1 assume !(0 != main_~p13~0#1); 231#L215-1 assume 0 != main_~p14~0#1; 230#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 229#L220 assume !(0 != main_~p15~0#1); 212#L225-1 [2024-10-31 22:03:14,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-31 22:03:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:14,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947212859] [2024-10-31 22:03:14,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:14,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:14,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:14,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:14,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash -364099068, now seen corresponding path program 1 times [2024-10-31 22:03:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:14,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786020786] [2024-10-31 22:03:14,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:14,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786020786] [2024-10-31 22:03:14,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786020786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:14,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:14,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:14,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921364302] [2024-10-31 22:03:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:14,617 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:03:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:14,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:14,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:14,619 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-31 22:03:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:14,653 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2024-10-31 22:03:14,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 290 transitions. [2024-10-31 22:03:14,658 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2024-10-31 22:03:14,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 290 transitions. [2024-10-31 22:03:14,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2024-10-31 22:03:14,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2024-10-31 22:03:14,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 290 transitions. [2024-10-31 22:03:14,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:03:14,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 290 transitions. [2024-10-31 22:03:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 290 transitions. [2024-10-31 22:03:14,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-10-31 22:03:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 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) [2024-10-31 22:03:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2024-10-31 22:03:14,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 290 transitions. [2024-10-31 22:03:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:14,686 INFO L425 stractBuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2024-10-31 22:03:14,686 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-31 22:03:14,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 290 transitions. [2024-10-31 22:03:14,691 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2024-10-31 22:03:14,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:14,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:14,696 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:14,697 INFO L745 eck$LassoCheckResult]: Stem: 492#$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(18, 2);call #Ultimate.allocInit(12, 3); 493#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 499#L225-1 [2024-10-31 22:03:14,699 INFO L747 eck$LassoCheckResult]: Loop: 499#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 528#L58 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 525#L93 assume !(0 != main_~p1~0#1); 526#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 520#L97-1 assume !(0 != main_~p3~0#1); 521#L101-1 assume !(0 != main_~p4~0#1); 595#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 594#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 593#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 592#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 591#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 590#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 589#L129-1 assume !(0 != main_~p11~0#1); 588#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 587#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 586#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 585#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 584#L149-1 assume !(0 != main_~p1~0#1); 583#L155-1 assume 0 != main_~p2~0#1; 582#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 579#L160 assume !(0 != main_~p3~0#1); 575#L165-1 assume !(0 != main_~p4~0#1); 572#L170-1 assume !(0 != main_~p5~0#1); 569#L175-1 assume !(0 != main_~p6~0#1); 565#L180-1 assume !(0 != main_~p7~0#1); 560#L185-1 assume !(0 != main_~p8~0#1); 557#L190-1 assume !(0 != main_~p9~0#1); 553#L195-1 assume !(0 != main_~p10~0#1); 549#L200-1 assume !(0 != main_~p11~0#1); 545#L205-1 assume !(0 != main_~p12~0#1); 541#L210-1 assume !(0 != main_~p13~0#1); 537#L215-1 assume 0 != main_~p14~0#1; 535#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 533#L220 assume !(0 != main_~p15~0#1); 499#L225-1 [2024-10-31 22:03:14,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-31 22:03:14,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:14,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236626092] [2024-10-31 22:03:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:14,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:14,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:14,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:14,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1022104326, now seen corresponding path program 1 times [2024-10-31 22:03:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:14,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596936009] [2024-10-31 22:03:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:14,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596936009] [2024-10-31 22:03:14,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596936009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:14,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194433796] [2024-10-31 22:03:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:14,812 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:03:14,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:14,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:14,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:14,813 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-31 22:03:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:14,839 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2024-10-31 22:03:14,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 566 transitions. [2024-10-31 22:03:14,843 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2024-10-31 22:03:14,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 566 transitions. [2024-10-31 22:03:14,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2024-10-31 22:03:14,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2024-10-31 22:03:14,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 566 transitions. [2024-10-31 22:03:14,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:03:14,852 INFO L218 hiAutomatonCegarLoop]: Abstraction has 366 states and 566 transitions. [2024-10-31 22:03:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 566 transitions. [2024-10-31 22:03:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-10-31 22:03:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 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) [2024-10-31 22:03:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 566 transitions. [2024-10-31 22:03:14,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 366 states and 566 transitions. [2024-10-31 22:03:14,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:14,876 INFO L425 stractBuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2024-10-31 22:03:14,877 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-31 22:03:14,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 566 transitions. [2024-10-31 22:03:14,879 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2024-10-31 22:03:14,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:14,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:14,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:14,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:14,881 INFO L745 eck$LassoCheckResult]: Stem: 1049#$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(18, 2);call #Ultimate.allocInit(12, 3); 1050#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1059#L225-1 [2024-10-31 22:03:14,881 INFO L747 eck$LassoCheckResult]: Loop: 1059#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1087#L58 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1088#L93 assume !(0 != main_~p1~0#1); 1214#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 1232#L97-1 assume !(0 != main_~p3~0#1); 1229#L101-1 assume !(0 != main_~p4~0#1); 1226#L105-1 assume !(0 != main_~p5~0#1); 1224#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1223#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1221#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1219#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1217#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1215#L129-1 assume !(0 != main_~p11~0#1); 1212#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1209#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1206#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1202#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1176#L149-1 assume !(0 != main_~p1~0#1); 1174#L155-1 assume 0 != main_~p2~0#1; 1171#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 1168#L160 assume !(0 != main_~p3~0#1); 1165#L165-1 assume !(0 != main_~p4~0#1); 1162#L170-1 assume !(0 != main_~p5~0#1); 1141#L175-1 assume !(0 != main_~p6~0#1); 1137#L180-1 assume !(0 != main_~p7~0#1); 1131#L185-1 assume !(0 != main_~p8~0#1); 1127#L190-1 assume !(0 != main_~p9~0#1); 1126#L195-1 assume !(0 != main_~p10~0#1); 1250#L200-1 assume !(0 != main_~p11~0#1); 1112#L205-1 assume !(0 != main_~p12~0#1); 1111#L210-1 assume !(0 != main_~p13~0#1); 1100#L215-1 assume 0 != main_~p14~0#1; 1101#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 1095#L220 assume !(0 != main_~p15~0#1); 1059#L225-1 [2024-10-31 22:03:14,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:14,882 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-31 22:03:14,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:14,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006794658] [2024-10-31 22:03:14,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:14,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:14,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:14,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:14,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:14,905 INFO L85 PathProgramCache]: Analyzing trace with hash 512631236, now seen corresponding path program 1 times [2024-10-31 22:03:14,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57624829] [2024-10-31 22:03:14,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:14,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57624829] [2024-10-31 22:03:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57624829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888628157] [2024-10-31 22:03:14,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:14,976 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:03:14,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:14,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:14,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:14,977 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-31 22:03:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:15,014 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2024-10-31 22:03:15,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1106 transitions. [2024-10-31 22:03:15,027 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2024-10-31 22:03:15,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1106 transitions. [2024-10-31 22:03:15,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2024-10-31 22:03:15,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2024-10-31 22:03:15,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1106 transitions. [2024-10-31 22:03:15,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:03:15,050 INFO L218 hiAutomatonCegarLoop]: Abstraction has 722 states and 1106 transitions. [2024-10-31 22:03:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1106 transitions. [2024-10-31 22:03:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2024-10-31 22:03:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 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) [2024-10-31 22:03:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1106 transitions. [2024-10-31 22:03:15,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 722 states and 1106 transitions. [2024-10-31 22:03:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:15,094 INFO L425 stractBuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2024-10-31 22:03:15,094 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-31 22:03:15,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1106 transitions. [2024-10-31 22:03:15,099 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2024-10-31 22:03:15,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:15,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:15,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:15,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:15,104 INFO L745 eck$LassoCheckResult]: Stem: 2143#$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(18, 2);call #Ultimate.allocInit(12, 3); 2144#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2151#L225-1 [2024-10-31 22:03:15,104 INFO L747 eck$LassoCheckResult]: Loop: 2151#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2350#L58 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 2347#L93 assume !(0 != main_~p1~0#1); 2348#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 2337#L97-1 assume !(0 != main_~p3~0#1); 2338#L101-1 assume !(0 != main_~p4~0#1); 2325#L105-1 assume !(0 != main_~p5~0#1); 2327#L109-1 assume !(0 != main_~p6~0#1); 2313#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2314#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2301#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2302#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2289#L129-1 assume !(0 != main_~p11~0#1); 2290#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2277#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2278#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2265#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2266#L149-1 assume !(0 != main_~p1~0#1); 2398#L155-1 assume 0 != main_~p2~0#1; 2397#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 2396#L160 assume !(0 != main_~p3~0#1); 2392#L165-1 assume !(0 != main_~p4~0#1); 2390#L170-1 assume !(0 != main_~p5~0#1); 2388#L175-1 assume !(0 != main_~p6~0#1); 2385#L180-1 assume !(0 != main_~p7~0#1); 2380#L185-1 assume !(0 != main_~p8~0#1); 2377#L190-1 assume !(0 != main_~p9~0#1); 2373#L195-1 assume !(0 != main_~p10~0#1); 2369#L200-1 assume !(0 != main_~p11~0#1); 2365#L205-1 assume !(0 != main_~p12~0#1); 2361#L210-1 assume !(0 != main_~p13~0#1); 2358#L215-1 assume 0 != main_~p14~0#1; 2356#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 2355#L220 assume !(0 != main_~p15~0#1); 2151#L225-1 [2024-10-31 22:03:15,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:15,106 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-31 22:03:15,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:15,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173790272] [2024-10-31 22:03:15,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:15,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:15,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:15,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:15,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:15,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1859108026, now seen corresponding path program 1 times [2024-10-31 22:03:15,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:15,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937348610] [2024-10-31 22:03:15,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:15,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:15,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937348610] [2024-10-31 22:03:15,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937348610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:15,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:15,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079422430] [2024-10-31 22:03:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:15,181 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:03:15,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:15,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:15,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:15,182 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-31 22:03:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:15,206 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2024-10-31 22:03:15,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2162 transitions. [2024-10-31 22:03:15,219 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2024-10-31 22:03:15,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2162 transitions. [2024-10-31 22:03:15,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2024-10-31 22:03:15,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2024-10-31 22:03:15,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2162 transitions. [2024-10-31 22:03:15,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:03:15,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2024-10-31 22:03:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2162 transitions. [2024-10-31 22:03:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2024-10-31 22:03:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 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) [2024-10-31 22:03:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2162 transitions. [2024-10-31 22:03:15,341 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2024-10-31 22:03:15,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:15,342 INFO L425 stractBuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2024-10-31 22:03:15,342 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-31 22:03:15,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2162 transitions. [2024-10-31 22:03:15,359 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2024-10-31 22:03:15,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:15,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:15,360 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:15,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:15,360 INFO L745 eck$LassoCheckResult]: Stem: 4298#$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(18, 2);call #Ultimate.allocInit(12, 3); 4299#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4304#L225-1 [2024-10-31 22:03:15,360 INFO L747 eck$LassoCheckResult]: Loop: 4304#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4525#L58 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 4522#L93 assume !(0 != main_~p1~0#1); 4426#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4423#L97-1 assume !(0 != main_~p3~0#1); 4419#L101-1 assume !(0 != main_~p4~0#1); 4416#L105-1 assume !(0 != main_~p5~0#1); 4380#L109-1 assume !(0 != main_~p6~0#1); 4381#L113-1 assume !(0 != main_~p7~0#1); 4664#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4660#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4656#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4652#L129-1 assume !(0 != main_~p11~0#1); 4648#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4644#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4640#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4637#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4632#L149-1 assume !(0 != main_~p1~0#1); 4629#L155-1 assume 0 != main_~p2~0#1; 4625#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 4621#L160 assume !(0 != main_~p3~0#1); 4612#L165-1 assume !(0 != main_~p4~0#1); 4608#L170-1 assume !(0 != main_~p5~0#1); 4604#L175-1 assume !(0 != main_~p6~0#1); 4605#L180-1 assume !(0 != main_~p7~0#1); 4616#L185-1 assume !(0 != main_~p8~0#1); 4595#L190-1 assume !(0 != main_~p9~0#1); 4591#L195-1 assume !(0 != main_~p10~0#1); 4564#L200-1 assume !(0 != main_~p11~0#1); 4538#L205-1 assume !(0 != main_~p12~0#1); 4534#L210-1 assume !(0 != main_~p13~0#1); 4531#L215-1 assume 0 != main_~p14~0#1; 4529#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 4527#L220 assume !(0 != main_~p15~0#1); 4304#L225-1 [2024-10-31 22:03:15,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:15,366 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-10-31 22:03:15,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:15,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448918843] [2024-10-31 22:03:15,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:15,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:15,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:15,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:15,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1797068412, now seen corresponding path program 1 times [2024-10-31 22:03:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:15,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468039244] [2024-10-31 22:03:15,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:15,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:15,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:15,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468039244] [2024-10-31 22:03:15,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468039244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:15,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:15,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:15,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376872937] [2024-10-31 22:03:15,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:15,462 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:03:15,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:15,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:15,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:15,463 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-31 22:03:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:15,500 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2024-10-31 22:03:15,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4226 transitions. [2024-10-31 22:03:15,525 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2024-10-31 22:03:15,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4226 transitions. [2024-10-31 22:03:15,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2024-10-31 22:03:15,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2024-10-31 22:03:15,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4226 transitions. [2024-10-31 22:03:15,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:03:15,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2024-10-31 22:03:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4226 transitions. [2024-10-31 22:03:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2024-10-31 22:03:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 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) [2024-10-31 22:03:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4226 transitions. [2024-10-31 22:03:15,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2024-10-31 22:03:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:15,613 INFO L425 stractBuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2024-10-31 22:03:15,614 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-31 22:03:15,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4226 transitions. [2024-10-31 22:03:15,629 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2024-10-31 22:03:15,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:15,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:15,630 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:15,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:15,630 INFO L745 eck$LassoCheckResult]: Stem: 8550#$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(18, 2);call #Ultimate.allocInit(12, 3); 8551#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8555#L225-1 [2024-10-31 22:03:15,631 INFO L747 eck$LassoCheckResult]: Loop: 8555#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8710#L58 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 8711#L93 assume !(0 != main_~p1~0#1); 8826#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 8825#L97-1 assume !(0 != main_~p3~0#1); 8823#L101-1 assume !(0 != main_~p4~0#1); 8820#L105-1 assume !(0 != main_~p5~0#1); 8816#L109-1 assume !(0 != main_~p6~0#1); 8812#L113-1 assume !(0 != main_~p7~0#1); 8808#L117-1 assume !(0 != main_~p8~0#1); 8806#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8804#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8802#L129-1 assume !(0 != main_~p11~0#1); 8800#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8798#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8796#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8794#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8791#L149-1 assume !(0 != main_~p1~0#1); 8792#L155-1 assume 0 != main_~p2~0#1; 8780#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 8781#L160 assume !(0 != main_~p3~0#1); 8770#L165-1 assume !(0 != main_~p4~0#1); 8771#L170-1 assume !(0 != main_~p5~0#1); 8759#L175-1 assume !(0 != main_~p6~0#1); 8761#L180-1 assume !(0 != main_~p7~0#1); 8751#L185-1 assume !(0 != main_~p8~0#1); 8752#L190-1 assume !(0 != main_~p9~0#1); 8744#L195-1 assume !(0 != main_~p10~0#1); 8743#L200-1 assume !(0 != main_~p11~0#1); 8734#L205-1 assume !(0 != main_~p12~0#1); 8733#L210-1 assume !(0 != main_~p13~0#1); 8723#L215-1 assume 0 != main_~p14~0#1; 8724#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 8718#L220 assume !(0 != main_~p15~0#1); 8555#L225-1 [2024-10-31 22:03:15,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-10-31 22:03:15,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:15,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055305799] [2024-10-31 22:03:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:15,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:15,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:15,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1656519802, now seen corresponding path program 1 times [2024-10-31 22:03:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:15,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199766248] [2024-10-31 22:03:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:15,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:15,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:15,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199766248] [2024-10-31 22:03:15,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199766248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:15,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:15,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:15,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957641610] [2024-10-31 22:03:15,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:15,703 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:03:15,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:15,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:15,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:15,704 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-31 22:03:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:15,744 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2024-10-31 22:03:15,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8258 transitions. [2024-10-31 22:03:15,780 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2024-10-31 22:03:15,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8258 transitions. [2024-10-31 22:03:15,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2024-10-31 22:03:15,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2024-10-31 22:03:15,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8258 transitions. [2024-10-31 22:03:15,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:03:15,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2024-10-31 22:03:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8258 transitions. [2024-10-31 22:03:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2024-10-31 22:03:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 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) [2024-10-31 22:03:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8258 transitions. [2024-10-31 22:03:15,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2024-10-31 22:03:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:15,974 INFO L425 stractBuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2024-10-31 22:03:15,974 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-31 22:03:15,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8258 transitions. [2024-10-31 22:03:16,001 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2024-10-31 22:03:16,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:16,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:16,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:16,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:16,003 INFO L745 eck$LassoCheckResult]: Stem: 16938#$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(18, 2);call #Ultimate.allocInit(12, 3); 16939#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16944#L225-1 [2024-10-31 22:03:16,003 INFO L747 eck$LassoCheckResult]: Loop: 16944#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17264#L58 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 17258#L93 assume !(0 != main_~p1~0#1); 17255#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 17248#L97-1 assume !(0 != main_~p3~0#1); 17249#L101-1 assume !(0 != main_~p4~0#1); 17250#L105-1 assume !(0 != main_~p5~0#1); 17359#L109-1 assume !(0 != main_~p6~0#1); 17334#L113-1 assume !(0 != main_~p7~0#1); 17332#L117-1 assume !(0 != main_~p8~0#1); 17330#L121-1 assume !(0 != main_~p9~0#1); 17329#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17328#L129-1 assume !(0 != main_~p11~0#1); 17327#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17326#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17325#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17324#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17322#L149-1 assume !(0 != main_~p1~0#1); 17320#L155-1 assume 0 != main_~p2~0#1; 17319#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 17154#L160 assume !(0 != main_~p3~0#1); 17153#L165-1 assume !(0 != main_~p4~0#1); 17137#L170-1 assume !(0 != main_~p5~0#1); 17138#L175-1 assume !(0 != main_~p6~0#1); 17115#L180-1 assume !(0 != main_~p7~0#1); 17116#L185-1 assume !(0 != main_~p8~0#1); 17305#L190-1 assume !(0 != main_~p9~0#1); 17300#L195-1 assume !(0 != main_~p10~0#1); 17294#L200-1 assume !(0 != main_~p11~0#1); 17288#L205-1 assume !(0 != main_~p12~0#1); 17282#L210-1 assume !(0 != main_~p13~0#1); 17278#L215-1 assume 0 != main_~p14~0#1; 17275#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 17270#L220 assume !(0 != main_~p15~0#1); 16944#L225-1 [2024-10-31 22:03:16,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-10-31 22:03:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361819002] [2024-10-31 22:03:16,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:16,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:16,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:16,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:16,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:16,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1790533308, now seen corresponding path program 1 times [2024-10-31 22:03:16,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:16,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682035343] [2024-10-31 22:03:16,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:16,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:16,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:16,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682035343] [2024-10-31 22:03:16,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682035343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:16,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:16,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:16,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973198841] [2024-10-31 22:03:16,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:16,053 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:03:16,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:16,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:16,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:16,055 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-31 22:03:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:16,108 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2024-10-31 22:03:16,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16130 transitions. [2024-10-31 22:03:16,162 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2024-10-31 22:03:16,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16130 transitions. [2024-10-31 22:03:16,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2024-10-31 22:03:16,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2024-10-31 22:03:16,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16130 transitions. [2024-10-31 22:03:16,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:03:16,235 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2024-10-31 22:03:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16130 transitions. [2024-10-31 22:03:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2024-10-31 22:03:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 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) [2024-10-31 22:03:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16130 transitions. [2024-10-31 22:03:16,553 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2024-10-31 22:03:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:16,554 INFO L425 stractBuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2024-10-31 22:03:16,555 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-31 22:03:16,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16130 transitions. [2024-10-31 22:03:16,602 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2024-10-31 22:03:16,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:16,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:16,603 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:16,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:16,603 INFO L745 eck$LassoCheckResult]: Stem: 33526#$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(18, 2);call #Ultimate.allocInit(12, 3); 33527#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33536#L225-1 [2024-10-31 22:03:16,603 INFO L747 eck$LassoCheckResult]: Loop: 33536#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33840#L58 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 33838#L93 assume !(0 != main_~p1~0#1); 33837#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 33836#L97-1 assume !(0 != main_~p3~0#1); 33834#L101-1 assume !(0 != main_~p4~0#1); 33832#L105-1 assume !(0 != main_~p5~0#1); 33830#L109-1 assume !(0 != main_~p6~0#1); 33829#L113-1 assume !(0 != main_~p7~0#1); 33827#L117-1 assume !(0 != main_~p8~0#1); 33823#L121-1 assume !(0 != main_~p9~0#1); 33820#L125-1 assume !(0 != main_~p10~0#1); 33814#L129-1 assume !(0 != main_~p11~0#1); 33815#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 33806#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 33807#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 33798#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 33799#L149-1 assume !(0 != main_~p1~0#1); 33788#L155-1 assume 0 != main_~p2~0#1; 33789#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 33780#L160 assume !(0 != main_~p3~0#1); 33779#L165-1 assume !(0 != main_~p4~0#1); 33719#L170-1 assume !(0 != main_~p5~0#1); 33720#L175-1 assume !(0 != main_~p6~0#1); 33710#L180-1 assume !(0 != main_~p7~0#1); 33711#L185-1 assume !(0 != main_~p8~0#1); 33698#L190-1 assume !(0 != main_~p9~0#1); 33700#L195-1 assume !(0 != main_~p10~0#1); 33850#L200-1 assume !(0 != main_~p11~0#1); 33848#L205-1 assume !(0 != main_~p12~0#1); 33846#L210-1 assume !(0 != main_~p13~0#1); 33844#L215-1 assume 0 != main_~p14~0#1; 33843#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 33842#L220 assume !(0 != main_~p15~0#1); 33536#L225-1 [2024-10-31 22:03:16,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-10-31 22:03:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:16,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073344481] [2024-10-31 22:03:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:16,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:16,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:16,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:16,619 INFO L85 PathProgramCache]: Analyzing trace with hash 698995654, now seen corresponding path program 1 times [2024-10-31 22:03:16,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:16,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854558856] [2024-10-31 22:03:16,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:16,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:16,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854558856] [2024-10-31 22:03:16,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854558856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:16,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:16,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:16,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504745525] [2024-10-31 22:03:16,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:16,661 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:03:16,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:16,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:16,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:16,663 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-31 22:03:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:16,891 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2024-10-31 22:03:16,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 31490 transitions. [2024-10-31 22:03:16,998 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2024-10-31 22:03:17,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 31490 transitions. [2024-10-31 22:03:17,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2024-10-31 22:03:17,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2024-10-31 22:03:17,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 31490 transitions. [2024-10-31 22:03:17,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:03:17,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2024-10-31 22:03:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 31490 transitions. [2024-10-31 22:03:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2024-10-31 22:03:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 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) [2024-10-31 22:03:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 31490 transitions. [2024-10-31 22:03:17,663 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2024-10-31 22:03:17,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:17,665 INFO L425 stractBuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2024-10-31 22:03:17,666 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-31 22:03:17,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 31490 transitions. [2024-10-31 22:03:17,844 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2024-10-31 22:03:17,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:17,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:17,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:17,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:17,852 INFO L745 eck$LassoCheckResult]: Stem: 66304#$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(18, 2);call #Ultimate.allocInit(12, 3); 66305#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66309#L225-1 [2024-10-31 22:03:17,853 INFO L747 eck$LassoCheckResult]: Loop: 66309#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66490#L58 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 66486#L93 assume !(0 != main_~p1~0#1); 66484#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 66482#L97-1 assume !(0 != main_~p3~0#1); 66478#L101-1 assume !(0 != main_~p4~0#1); 66474#L105-1 assume !(0 != main_~p5~0#1); 66472#L109-1 assume !(0 != main_~p6~0#1); 66468#L113-1 assume !(0 != main_~p7~0#1); 66464#L117-1 assume !(0 != main_~p8~0#1); 66460#L121-1 assume !(0 != main_~p9~0#1); 66456#L125-1 assume !(0 != main_~p10~0#1); 66454#L129-1 assume !(0 != main_~p11~0#1); 66450#L133-1 assume !(0 != main_~p12~0#1); 66448#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66446#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66444#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66440#L149-1 assume !(0 != main_~p1~0#1); 66438#L155-1 assume 0 != main_~p2~0#1; 66436#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 66433#L160 assume !(0 != main_~p3~0#1); 66428#L165-1 assume !(0 != main_~p4~0#1); 66424#L170-1 assume !(0 != main_~p5~0#1); 66421#L175-1 assume !(0 != main_~p6~0#1); 66422#L180-1 assume !(0 != main_~p7~0#1); 66521#L185-1 assume !(0 != main_~p8~0#1); 66517#L190-1 assume !(0 != main_~p9~0#1); 66513#L195-1 assume !(0 != main_~p10~0#1); 66510#L200-1 assume !(0 != main_~p11~0#1); 66505#L205-1 assume !(0 != main_~p12~0#1); 66502#L210-1 assume !(0 != main_~p13~0#1); 66499#L215-1 assume 0 != main_~p14~0#1; 66497#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 66494#L220 assume !(0 != main_~p15~0#1); 66309#L225-1 [2024-10-31 22:03:17,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-10-31 22:03:17,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:17,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61001244] [2024-10-31 22:03:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:17,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:17,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:17,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:17,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:17,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1121697480, now seen corresponding path program 1 times [2024-10-31 22:03:17,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:17,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98249853] [2024-10-31 22:03:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:17,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:17,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98249853] [2024-10-31 22:03:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98249853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:17,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:17,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:17,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657472888] [2024-10-31 22:03:17,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:17,933 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:03:17,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:17,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:17,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:17,936 INFO L87 Difference]: Start difference. First operand 21762 states and 31490 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-31 22:03:18,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:18,199 INFO L93 Difference]: Finished difference Result 43010 states and 61442 transitions. [2024-10-31 22:03:18,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 61442 transitions. [2024-10-31 22:03:18,543 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2024-10-31 22:03:18,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 61442 transitions. [2024-10-31 22:03:18,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2024-10-31 22:03:18,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2024-10-31 22:03:18,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 61442 transitions. [2024-10-31 22:03:18,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:03:18,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2024-10-31 22:03:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 61442 transitions. [2024-10-31 22:03:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2024-10-31 22:03:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4285514996512438) internal successors, (61442), 43009 states have internal predecessors, (61442), 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) [2024-10-31 22:03:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 61442 transitions. [2024-10-31 22:03:19,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2024-10-31 22:03:19,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:19,693 INFO L425 stractBuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2024-10-31 22:03:19,693 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-31 22:03:19,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 61442 transitions. [2024-10-31 22:03:19,984 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2024-10-31 22:03:19,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:19,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:19,985 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:19,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:19,985 INFO L745 eck$LassoCheckResult]: Stem: 131082#$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(18, 2);call #Ultimate.allocInit(12, 3); 131083#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131091#L225-1 [2024-10-31 22:03:19,985 INFO L747 eck$LassoCheckResult]: Loop: 131091#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 132067#L58 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 132025#L93 assume !(0 != main_~p1~0#1); 132027#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 132019#L97-1 assume !(0 != main_~p3~0#1); 132020#L101-1 assume !(0 != main_~p4~0#1); 132010#L105-1 assume !(0 != main_~p5~0#1); 132012#L109-1 assume !(0 != main_~p6~0#1); 132004#L113-1 assume !(0 != main_~p7~0#1); 132006#L117-1 assume !(0 != main_~p8~0#1); 132192#L121-1 assume !(0 != main_~p9~0#1); 132188#L125-1 assume !(0 != main_~p10~0#1); 132147#L129-1 assume !(0 != main_~p11~0#1); 132145#L133-1 assume !(0 != main_~p12~0#1); 132141#L137-1 assume !(0 != main_~p13~0#1); 132138#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 132137#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 132122#L149-1 assume !(0 != main_~p1~0#1); 132121#L155-1 assume 0 != main_~p2~0#1; 132120#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 132119#L160 assume !(0 != main_~p3~0#1); 132116#L165-1 assume !(0 != main_~p4~0#1); 132114#L170-1 assume !(0 != main_~p5~0#1); 132113#L175-1 assume !(0 != main_~p6~0#1); 132111#L180-1 assume !(0 != main_~p7~0#1); 132109#L185-1 assume !(0 != main_~p8~0#1); 132107#L190-1 assume !(0 != main_~p9~0#1); 132105#L195-1 assume !(0 != main_~p10~0#1); 131936#L200-1 assume !(0 != main_~p11~0#1); 131935#L205-1 assume !(0 != main_~p12~0#1); 132094#L210-1 assume !(0 != main_~p13~0#1); 132089#L215-1 assume 0 != main_~p14~0#1; 132084#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 132077#L220 assume !(0 != main_~p15~0#1); 131091#L225-1 [2024-10-31 22:03:19,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-10-31 22:03:19,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:19,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659596245] [2024-10-31 22:03:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:19,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:19,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:19,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash 304049030, now seen corresponding path program 1 times [2024-10-31 22:03:19,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:19,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596272435] [2024-10-31 22:03:19,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:19,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:20,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:20,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596272435] [2024-10-31 22:03:20,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596272435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:20,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:20,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:03:20,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484089625] [2024-10-31 22:03:20,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:20,054 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:03:20,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:20,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:20,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:20,055 INFO L87 Difference]: Start difference. First operand 43010 states and 61442 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-10-31 22:03:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:20,399 INFO L93 Difference]: Finished difference Result 84994 states and 119810 transitions. [2024-10-31 22:03:20,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 119810 transitions. [2024-10-31 22:03:20,907 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2024-10-31 22:03:21,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 119810 transitions. [2024-10-31 22:03:21,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2024-10-31 22:03:21,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2024-10-31 22:03:21,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 119810 transitions. [2024-10-31 22:03:21,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:03:21,474 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2024-10-31 22:03:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 119810 transitions. [2024-10-31 22:03:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2024-10-31 22:03:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.409628914982234) internal successors, (119810), 84993 states have internal predecessors, (119810), 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) [2024-10-31 22:03:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 119810 transitions. [2024-10-31 22:03:22,836 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2024-10-31 22:03:22,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:22,837 INFO L425 stractBuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2024-10-31 22:03:22,837 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-31 22:03:22,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 119810 transitions. [2024-10-31 22:03:23,045 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2024-10-31 22:03:23,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:03:23,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:03:23,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:03:23,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:23,047 INFO L745 eck$LassoCheckResult]: Stem: 259095#$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(18, 2);call #Ultimate.allocInit(12, 3); 259096#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_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259107#L225-1 [2024-10-31 22:03:23,047 INFO L747 eck$LassoCheckResult]: Loop: 259107#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 260516#L58 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;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 260513#L93 assume !(0 != main_~p1~0#1); 260510#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 260508#L97-1 assume !(0 != main_~p3~0#1); 260505#L101-1 assume !(0 != main_~p4~0#1); 260501#L105-1 assume !(0 != main_~p5~0#1); 260497#L109-1 assume !(0 != main_~p6~0#1); 260493#L113-1 assume !(0 != main_~p7~0#1); 260489#L117-1 assume !(0 != main_~p8~0#1); 260485#L121-1 assume !(0 != main_~p9~0#1); 260481#L125-1 assume !(0 != main_~p10~0#1); 260478#L129-1 assume !(0 != main_~p11~0#1); 260475#L133-1 assume !(0 != main_~p12~0#1); 260476#L137-1 assume !(0 != main_~p13~0#1); 260580#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 260576#L145-1 assume !(0 != main_~p15~0#1); 260572#L149-1 assume !(0 != main_~p1~0#1); 260570#L155-1 assume 0 != main_~p2~0#1; 260568#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 260565#L160 assume !(0 != main_~p3~0#1); 260560#L165-1 assume !(0 != main_~p4~0#1); 260556#L170-1 assume !(0 != main_~p5~0#1); 260552#L175-1 assume !(0 != main_~p6~0#1); 260548#L180-1 assume !(0 != main_~p7~0#1); 260544#L185-1 assume !(0 != main_~p8~0#1); 260540#L190-1 assume !(0 != main_~p9~0#1); 260536#L195-1 assume !(0 != main_~p10~0#1); 260533#L200-1 assume !(0 != main_~p11~0#1); 260530#L205-1 assume !(0 != main_~p12~0#1); 260527#L210-1 assume !(0 != main_~p13~0#1); 260525#L215-1 assume 0 != main_~p14~0#1; 260523#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 260520#L220 assume !(0 != main_~p15~0#1); 259107#L225-1 [2024-10-31 22:03:23,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2024-10-31 22:03:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:23,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897871818] [2024-10-31 22:03:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:23,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:23,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:23,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:23,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1690095676, now seen corresponding path program 1 times [2024-10-31 22:03:23,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:23,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864026978] [2024-10-31 22:03:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:23,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:23,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:23,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash 365150982, now seen corresponding path program 1 times [2024-10-31 22:03:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213504167] [2024-10-31 22:03:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:23,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:23,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:23,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:24,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:24,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 31.10 10:03:24 BoogieIcfgContainer [2024-10-31 22:03:24,382 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-31 22:03:24,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:03:24,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:03:24,384 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:03:24,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:03:13" (3/4) ... [2024-10-31 22:03:24,388 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-31 22:03:24,441 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:03:24,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:03:24,442 INFO L158 Benchmark]: Toolchain (without parser) took 11517.93ms. Allocated memory was 159.4MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 94.7MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 624.4MB. Max. memory is 16.1GB. [2024-10-31 22:03:24,442 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 159.4MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:03:24,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.65ms. Allocated memory is still 159.4MB. Free memory was 94.5MB in the beginning and 80.8MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-31 22:03:24,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.99ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 80.8MB in the beginning and 205.1MB in the end (delta: -124.3MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-10-31 22:03:24,444 INFO L158 Benchmark]: Boogie Preprocessor took 41.40ms. Allocated memory is still 237.0MB. Free memory was 205.1MB in the beginning and 202.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:03:24,444 INFO L158 Benchmark]: RCFGBuilder took 573.87ms. Allocated memory is still 237.0MB. Free memory was 202.9MB in the beginning and 193.0MB in the end (delta: 9.8MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-10-31 22:03:24,445 INFO L158 Benchmark]: BuchiAutomizer took 10472.28ms. Allocated memory was 237.0MB in the beginning and 8.5GB in the end (delta: 8.3GB). Free memory was 193.0MB in the beginning and 7.9GB in the end (delta: -7.7GB). Peak memory consumption was 644.7MB. Max. memory is 16.1GB. [2024-10-31 22:03:24,445 INFO L158 Benchmark]: Witness Printer took 58.27ms. Allocated memory is still 8.5GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:03:24,447 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.28ms. Allocated memory is still 159.4MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.65ms. Allocated memory is still 159.4MB. Free memory was 94.5MB in the beginning and 80.8MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.99ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 80.8MB in the beginning and 205.1MB in the end (delta: -124.3MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.40ms. Allocated memory is still 237.0MB. Free memory was 205.1MB in the beginning and 202.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 573.87ms. Allocated memory is still 237.0MB. Free memory was 202.9MB in the beginning and 193.0MB in the end (delta: 9.8MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 10472.28ms. Allocated memory was 237.0MB in the beginning and 8.5GB in the end (delta: 8.3GB). Free memory was 193.0MB in the beginning and 7.9GB in the end (delta: -7.7GB). Peak memory consumption was 644.7MB. Max. memory is 16.1GB. * Witness Printer took 58.27ms. Allocated memory is still 8.5GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 84994 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.3s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 6.9s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 3.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.9s Buchi closure took 0.1s. 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, 646 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 2070 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 800 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1270 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI11 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: 56]: 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; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND TRUE p2 != 0 [L98] lk2 = 1 [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND TRUE p14 != 0 [L146] lk14 = 1 [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND TRUE p2 != 0 [L161] COND FALSE !(lk2 != 1) [L162] lk2 = 0 [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND TRUE p14 != 0 [L221] COND FALSE !(lk14 != 1) [L222] lk14 = 0 [L225] COND FALSE !(p15 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: 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; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND TRUE p2 != 0 [L98] lk2 = 1 [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND TRUE p14 != 0 [L146] lk14 = 1 [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND TRUE p2 != 0 [L161] COND FALSE !(lk2 != 1) [L162] lk2 = 0 [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND TRUE p14 != 0 [L221] COND FALSE !(lk14 != 1) [L222] lk14 = 0 [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-31 22:03:24,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc522ce3-03c4-4287-a8c7-22851f9a7706/bin/uautomizer-verify-4GaUIPS5ZU/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)