./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/safe029_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_tso.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/safe029_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 22:53:27,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:53:27,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:53:27,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:53:27,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:53:27,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:53:27,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:53:27,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:53:27,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:53:27,750 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:53:27,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:53:27,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:53:27,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:53:27,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:53:27,752 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:53:27,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:53:27,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:53:27,752 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:53:27,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:53:27,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:53:27,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:53:27,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:53:27,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:53:27,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:53:27,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:53:27,757 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:53:27,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:53:27,757 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:53:27,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:53:27,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:53:27,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:53:27,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:53:27,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:53:27,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:53:27,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:53:27,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:53:27,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:53:27,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:53:27,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:53:27,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:53:27,761 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:53:27,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:53:27,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:53:27,761 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 22:53:27,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:53:27,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:53:27,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:53:27,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:53:27,988 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:53:27,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_tso.i [2024-01-29 22:53:29,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:53:29,342 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:53:29,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_tso.i [2024-01-29 22:53:29,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd8d427d/50b051e37c7642f396b199b07a4ef1a3/FLAG739df754f [2024-01-29 22:53:29,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd8d427d/50b051e37c7642f396b199b07a4ef1a3 [2024-01-29 22:53:29,363 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:53:29,364 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:53:29,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/safe029_tso.yml/witness.yml [2024-01-29 22:53:29,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:53:29,520 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:53:29,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:53:29,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:53:29,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:53:29,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:53:29" (1/2) ... [2024-01-29 22:53:29,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c68ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:53:29, skipping insertion in model container [2024-01-29 22:53:29,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:53:29" (1/2) ... [2024-01-29 22:53:29,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1c4cc675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:53:29, skipping insertion in model container [2024-01-29 22:53:29,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:53:29" (2/2) ... [2024-01-29 22:53:29,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c68ceb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:29, skipping insertion in model container [2024-01-29 22:53:29,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:53:29" (2/2) ... [2024-01-29 22:53:29,528 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:53:29,666 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:53:29,667 INFO L98 nessWitnessExtractor]: Location invariant before [L725-L725] (unsigned long )arg == 0UL [2024-01-29 22:53:29,668 INFO L98 nessWitnessExtractor]: Location invariant before [L737-L737] (0 <= __unbuffered_cnt) && (x <= 2) [2024-01-29 22:53:29,668 INFO L98 nessWitnessExtractor]: Location invariant before [L737-L737] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,668 INFO L98 nessWitnessExtractor]: Location invariant before [L737-L737] ((0 <= __unbuffered_cnt) && (x <= 2)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,668 INFO L98 nessWitnessExtractor]: Location invariant before [L737-L737] ((0 <= __unbuffered_cnt) && (x <= 2)) && (x <= 127) [2024-01-29 22:53:29,669 INFO L98 nessWitnessExtractor]: Location invariant before [L737-L737] ((0 <= __unbuffered_cnt) && (x <= 2)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,669 INFO L98 nessWitnessExtractor]: Location invariant before [L737-L737] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,669 INFO L98 nessWitnessExtractor]: Location invariant before [L737-L737] ((0 <= __unbuffered_cnt) && (x <= 2)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,669 INFO L98 nessWitnessExtractor]: Location invariant before [L737-L737] ((0 <= __unbuffered_cnt) && (x <= 2)) && (y == 1) [2024-01-29 22:53:29,669 INFO L98 nessWitnessExtractor]: Location invariant before [L737-L737] ((0 <= __unbuffered_cnt) && (x <= 2)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,669 INFO L98 nessWitnessExtractor]: Location invariant before [L735-L735] (unsigned long )arg == 0UL [2024-01-29 22:53:29,669 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,670 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] ((0 <= __unbuffered_cnt) && (0 <= x)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,670 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2) [2024-01-29 22:53:29,670 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] ((0 <= __unbuffered_cnt) && (0 <= x)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,670 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] ((0 <= __unbuffered_cnt) && (0 <= x)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,670 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] ((0 <= __unbuffered_cnt) && (0 <= x)) && (y == 2) [2024-01-29 22:53:29,670 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127) [2024-01-29 22:53:29,671 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] ((0 <= __unbuffered_cnt) && (0 <= x)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,671 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,671 INFO L98 nessWitnessExtractor]: Location invariant before [L723-L723] (unsigned long )arg == 0UL [2024-01-29 22:53:29,671 INFO L98 nessWitnessExtractor]: Location invariant before [L734-L734] (0 <= __unbuffered_cnt) && (0 <= y) [2024-01-29 22:53:29,671 INFO L98 nessWitnessExtractor]: Location invariant before [L734-L734] ((0 <= __unbuffered_cnt) && (0 <= y)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,671 INFO L98 nessWitnessExtractor]: Location invariant before [L734-L734] ((0 <= __unbuffered_cnt) && (0 <= y)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,672 INFO L98 nessWitnessExtractor]: Location invariant before [L734-L734] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,672 INFO L98 nessWitnessExtractor]: Location invariant before [L734-L734] ((0 <= __unbuffered_cnt) && (0 <= y)) && (y <= 127) [2024-01-29 22:53:29,672 INFO L98 nessWitnessExtractor]: Location invariant before [L734-L734] ((0 <= __unbuffered_cnt) && (0 <= y)) && (x == 2) [2024-01-29 22:53:29,672 INFO L98 nessWitnessExtractor]: Location invariant before [L734-L734] ((0 <= __unbuffered_cnt) && (0 <= y)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,672 INFO L98 nessWitnessExtractor]: Location invariant before [L734-L734] ((0 <= __unbuffered_cnt) && (0 <= y)) && (y <= 2) [2024-01-29 22:53:29,672 INFO L98 nessWitnessExtractor]: Location invariant before [L734-L734] ((0 <= __unbuffered_cnt) && (0 <= y)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,672 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,672 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] ((0 <= __unbuffered_cnt) && (0 <= x)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,673 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] ((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y) [2024-01-29 22:53:29,673 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,673 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127) [2024-01-29 22:53:29,673 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] ((0 <= __unbuffered_cnt) && (0 <= x)) && (y <= 2) [2024-01-29 22:53:29,673 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] ((0 <= __unbuffered_cnt) && (0 <= x)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,673 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] ((0 <= __unbuffered_cnt) && (0 <= x)) && (y <= 127) [2024-01-29 22:53:29,674 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] ((0 <= __unbuffered_cnt) && (0 <= x)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,674 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] ((0 <= __unbuffered_cnt) && (0 <= x)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,675 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2) [2024-01-29 22:53:29,675 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] ((0 <= x) && (0 <= y)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,675 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] (0 <= x) && (0 <= y) [2024-01-29 22:53:29,675 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] ((0 <= x) && (0 <= y)) && (1 <= __unbuffered_cnt) [2024-01-29 22:53:29,675 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] ((0 <= x) && (0 <= y)) && (x <= 2) [2024-01-29 22:53:29,675 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] ((0 <= x) && (0 <= y)) && (x <= 127) [2024-01-29 22:53:29,676 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] (((0 <= x) && (0 <= y)) && ((unsigned long )arg == 0UL)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,676 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] ((0 <= x) && (0 <= y)) && (y <= 2) [2024-01-29 22:53:29,676 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] ((0 <= x) && (0 <= y)) && (y <= 127) [2024-01-29 22:53:29,676 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] (((0 <= x) && (0 <= y)) && ((unsigned long )arg == 0UL)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,676 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] (((0 <= x) && (0 <= y)) && ((unsigned long )arg == 0UL)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,677 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] 0 <= x [2024-01-29 22:53:29,677 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] (((0 <= x) && (0 <= y)) && ((unsigned long )arg == 0UL)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,677 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,677 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] ((0 <= __unbuffered_cnt) && (0 <= x)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,678 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,678 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] ((0 <= __unbuffered_cnt) && (0 <= x)) && (y <= 127) [2024-01-29 22:53:29,678 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] ((0 <= __unbuffered_cnt) && (0 <= x)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,678 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] ((0 <= __unbuffered_cnt) && (0 <= x)) && (y <= 2) [2024-01-29 22:53:29,679 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] ((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y) [2024-01-29 22:53:29,679 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127) [2024-01-29 22:53:29,679 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2) [2024-01-29 22:53:29,680 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] ((0 <= __unbuffered_cnt) && (0 <= x)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,680 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] ((0 <= __unbuffered_cnt) && (0 <= x)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,680 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] ((0 <= __unbuffered_cnt) && (0 <= x)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,680 INFO L98 nessWitnessExtractor]: Location invariant before [L743-L743] (unsigned long )arg == 0UL [2024-01-29 22:53:29,680 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127) [2024-01-29 22:53:29,680 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,681 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,681 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2) [2024-01-29 22:53:29,681 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,681 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] ((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y) [2024-01-29 22:53:29,681 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,681 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && (y <= 2) [2024-01-29 22:53:29,681 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,681 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,681 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && (y <= 127) [2024-01-29 22:53:29,682 INFO L98 nessWitnessExtractor]: Location invariant before [L741-L741] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,682 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127) [2024-01-29 22:53:29,682 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,682 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,683 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,683 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,683 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] ((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y) [2024-01-29 22:53:29,683 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,683 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && (y <= 2) [2024-01-29 22:53:29,683 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,683 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2) [2024-01-29 22:53:29,683 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && (y <= 127) [2024-01-29 22:53:29,683 INFO L98 nessWitnessExtractor]: Location invariant before [L739-L739] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,684 INFO L98 nessWitnessExtractor]: Location invariant before [L767-L767] (((0 <= __unbuffered_cnt) && (0 <= y)) && (y <= 2)) && (x == 2) [2024-01-29 22:53:29,684 INFO L98 nessWitnessExtractor]: Location invariant before [L767-L767] ((((0 <= __unbuffered_cnt) && (0 <= y)) && (y <= 2)) && (x == 2)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,684 INFO L98 nessWitnessExtractor]: Location invariant before [L767-L767] ((0 <= __unbuffered_cnt) && (0 <= y)) && (y <= 2) [2024-01-29 22:53:29,684 INFO L98 nessWitnessExtractor]: Location invariant before [L767-L767] ((((0 <= __unbuffered_cnt) && (0 <= y)) && (y <= 2)) && (x == 2)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,684 INFO L98 nessWitnessExtractor]: Location invariant before [L767-L767] (0 <= __unbuffered_cnt) && (0 <= y) [2024-01-29 22:53:29,684 INFO L98 nessWitnessExtractor]: Location invariant before [L767-L767] ((((0 <= __unbuffered_cnt) && (0 <= y)) && (y <= 2)) && (x == 2)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,684 INFO L98 nessWitnessExtractor]: Location invariant before [L767-L767] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,685 INFO L98 nessWitnessExtractor]: Location invariant before [L767-L767] (((0 <= __unbuffered_cnt) && (0 <= y)) && (y <= 2)) && (y <= 127) [2024-01-29 22:53:29,685 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] (((0 <= __unbuffered_cnt) && (x <= 2)) && (x <= 127)) && (y <= 2) [2024-01-29 22:53:29,685 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] ((((0 <= __unbuffered_cnt) && (x <= 2)) && (x <= 127)) && (y <= 2)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,685 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] ((0 <= __unbuffered_cnt) && (x <= 2)) && (x <= 127) [2024-01-29 22:53:29,686 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] ((((0 <= __unbuffered_cnt) && (x <= 2)) && (x <= 127)) && (y <= 2)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,686 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] ((((0 <= __unbuffered_cnt) && (x <= 2)) && (x <= 127)) && (y <= 2)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,686 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] ((((0 <= __unbuffered_cnt) && (x <= 2)) && (x <= 127)) && (y <= 2)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,686 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] (0 <= __unbuffered_cnt) && (x <= 2) [2024-01-29 22:53:29,686 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] ((((0 <= __unbuffered_cnt) && (x <= 2)) && (x <= 127)) && (y <= 2)) && (y <= 127) [2024-01-29 22:53:29,687 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,687 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,687 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] (0 <= __unbuffered_cnt) && (0 <= y) [2024-01-29 22:53:29,688 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] ((((0 <= __unbuffered_cnt) && (x <= 2)) && (x <= 127)) && (y <= 2)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,688 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] (unsigned long )arg == 0UL [2024-01-29 22:53:29,688 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] (0 <= x) && (0 <= y) [2024-01-29 22:53:29,688 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] ((0 <= x) && (0 <= y)) && (1 <= __unbuffered_cnt) [2024-01-29 22:53:29,688 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] ((0 <= x) && (0 <= y)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,688 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] ((0 <= x) && (0 <= y)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,689 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] ((0 <= x) && (0 <= y)) && (y <= 127) [2024-01-29 22:53:29,689 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] ((0 <= x) && (0 <= y)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,689 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] ((0 <= x) && (0 <= y)) && (x <= 2) [2024-01-29 22:53:29,689 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] ((0 <= x) && (0 <= y)) && (y <= 2) [2024-01-29 22:53:29,689 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] ((0 <= x) && (0 <= y)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] 0 <= x [2024-01-29 22:53:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] ((0 <= x) && (0 <= y)) && (x <= 127) [2024-01-29 22:53:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L727] ((0 <= x) && (0 <= y)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] (0 <= __unbuffered_cnt) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] (0 <= __unbuffered_cnt) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] (0 <= __unbuffered_cnt) && (x <= 127) [2024-01-29 22:53:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] (0 <= __unbuffered_cnt) && (x <= 2) [2024-01-29 22:53:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] (0 <= __unbuffered_cnt) && (y <= 127) [2024-01-29 22:53:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] (0 <= __unbuffered_cnt) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] (0 <= __unbuffered_cnt) && (0 <= y) [2024-01-29 22:53:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] (0 <= __unbuffered_cnt) && (y <= 2) [2024-01-29 22:53:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L762-L762] (0 <= __unbuffered_cnt) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] (unsigned long )arg == 0UL [2024-01-29 22:53:29,692 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] ((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y) [2024-01-29 22:53:29,692 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,692 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,692 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,692 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (y <= 2) [2024-01-29 22:53:29,692 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (y <= 127) [2024-01-29 22:53:29,692 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,692 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (x <= 2) [2024-01-29 22:53:29,693 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,693 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,693 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (x <= 127) [2024-01-29 22:53:29,693 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,693 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] (expression == 0) && (expression <= 1) [2024-01-29 22:53:29,693 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] ((expression == 0) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-01-29 22:53:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] ((expression == 0) && (expression <= 1)) && (expression == 1) [2024-01-29 22:53:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-29 22:53:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] (expression == 0) && (0 <= expression) [2024-01-29 22:53:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] (((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2)) && (x <= 127) [2024-01-29 22:53:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2)) && (x <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2)) && (x <= 127)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2)) && (x <= 127)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2) [2024-01-29 22:53:29,695 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2)) && (x <= 127)) && (y <= 127) [2024-01-29 22:53:29,695 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,695 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2)) && (x <= 127)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,695 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,695 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] ((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y) [2024-01-29 22:53:29,695 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2)) && (x <= 127)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,695 INFO L98 nessWitnessExtractor]: Location invariant before [L736-L736] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2)) && (x <= 127)) && (y <= 2) [2024-01-29 22:53:29,696 INFO L98 nessWitnessExtractor]: Location invariant before [L765-L765] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,696 INFO L98 nessWitnessExtractor]: Location invariant before [L765-L765] ((0 <= __unbuffered_cnt) && (0 <= x)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,696 INFO L98 nessWitnessExtractor]: Location invariant before [L765-L765] ((0 <= __unbuffered_cnt) && (0 <= x)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,696 INFO L98 nessWitnessExtractor]: Location invariant before [L765-L765] ((0 <= __unbuffered_cnt) && (0 <= x)) && (y <= 2) [2024-01-29 22:53:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L765-L765] ((0 <= __unbuffered_cnt) && (0 <= x)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L765-L765] ((0 <= __unbuffered_cnt) && (0 <= x)) && (y <= 127) [2024-01-29 22:53:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L765-L765] ((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y) [2024-01-29 22:53:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L765-L765] ((0 <= __unbuffered_cnt) && (0 <= x)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L765-L765] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2) [2024-01-29 22:53:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L765-L765] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127) [2024-01-29 22:53:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L765-L765] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,698 INFO L98 nessWitnessExtractor]: Location invariant before [L732-L732] (unsigned long )arg == 0UL [2024-01-29 22:53:29,698 INFO L98 nessWitnessExtractor]: Location invariant before [L768-L768] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,698 INFO L98 nessWitnessExtractor]: Location invariant before [L768-L768] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 127) [2024-01-29 22:53:29,698 INFO L98 nessWitnessExtractor]: Location invariant before [L768-L768] ((0 <= __unbuffered_cnt) && (0 <= x)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,699 INFO L98 nessWitnessExtractor]: Location invariant before [L768-L768] ((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y) [2024-01-29 22:53:29,699 INFO L98 nessWitnessExtractor]: Location invariant before [L768-L768] ((0 <= __unbuffered_cnt) && (0 <= x)) && (y <= 2) [2024-01-29 22:53:29,701 INFO L98 nessWitnessExtractor]: Location invariant before [L768-L768] ((0 <= __unbuffered_cnt) && (0 <= x)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,702 INFO L98 nessWitnessExtractor]: Location invariant before [L768-L768] ((0 <= __unbuffered_cnt) && (0 <= x)) && (x <= 2) [2024-01-29 22:53:29,702 INFO L98 nessWitnessExtractor]: Location invariant before [L768-L768] ((0 <= __unbuffered_cnt) && (0 <= x)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,702 INFO L98 nessWitnessExtractor]: Location invariant before [L768-L768] ((0 <= __unbuffered_cnt) && (0 <= x)) && (y <= 127) [2024-01-29 22:53:29,706 INFO L98 nessWitnessExtractor]: Location invariant before [L768-L768] ((0 <= __unbuffered_cnt) && (0 <= x)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,707 INFO L98 nessWitnessExtractor]: Location invariant before [L768-L768] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,707 INFO L98 nessWitnessExtractor]: Location invariant before [L738-L738] (unsigned long )arg == 0UL [2024-01-29 22:53:29,707 INFO L98 nessWitnessExtractor]: Location invariant before [L722-L722] (0 <= __unbuffered_cnt) && (y <= 127) [2024-01-29 22:53:29,707 INFO L98 nessWitnessExtractor]: Location invariant before [L722-L722] ((0 <= __unbuffered_cnt) && (y <= 127)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,707 INFO L98 nessWitnessExtractor]: Location invariant before [L722-L722] ((0 <= __unbuffered_cnt) && (y <= 127)) && (x == 1) [2024-01-29 22:53:29,707 INFO L98 nessWitnessExtractor]: Location invariant before [L722-L722] ((0 <= __unbuffered_cnt) && (y <= 127)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,707 INFO L98 nessWitnessExtractor]: Location invariant before [L722-L722] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,707 INFO L98 nessWitnessExtractor]: Location invariant before [L722-L722] ((0 <= __unbuffered_cnt) && (y <= 127)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,707 INFO L98 nessWitnessExtractor]: Location invariant before [L722-L722] ((0 <= __unbuffered_cnt) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,708 INFO L98 nessWitnessExtractor]: Location invariant before [L722-L722] (0 <= __unbuffered_cnt) && (0 <= y) [2024-01-29 22:53:29,708 INFO L98 nessWitnessExtractor]: Location invariant before [L722-L722] (0 <= __unbuffered_cnt) && (y <= 2) [2024-01-29 22:53:29,708 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] (((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (x <= 2) [2024-01-29 22:53:29,708 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] ((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y) [2024-01-29 22:53:29,708 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (x <= 2)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,708 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (x <= 2)) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,708 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (x <= 2)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,708 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,708 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (x <= 2)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,708 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (x <= 2)) && (x <= 127) [2024-01-29 22:53:29,709 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (x <= 2)) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,709 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,709 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (x <= 2)) && (y <= 2) [2024-01-29 22:53:29,709 INFO L98 nessWitnessExtractor]: Location invariant before [L724-L724] ((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (x <= 2)) && (y <= 127) [2024-01-29 22:53:29,709 INFO L98 nessWitnessExtractor]: Location invariant before [L740-L740] (unsigned long )arg == 0UL [2024-01-29 22:53:29,710 INFO L98 nessWitnessExtractor]: Location invariant before [L757-L757] __unbuffered_cnt == 0 [2024-01-29 22:53:29,710 INFO L98 nessWitnessExtractor]: Location invariant before [L757-L757] (__unbuffered_cnt == 0) && (main$tmp_guard0 == (_Bool)0) [2024-01-29 22:53:29,710 INFO L98 nessWitnessExtractor]: Location invariant before [L757-L757] (__unbuffered_cnt == 0) && (main$tmp_guard1 == (_Bool)0) [2024-01-29 22:53:29,710 INFO L98 nessWitnessExtractor]: Location invariant before [L757-L757] (__unbuffered_cnt == 0) && (y == 0) [2024-01-29 22:53:29,711 INFO L98 nessWitnessExtractor]: Location invariant before [L757-L757] (__unbuffered_cnt == 0) && (x == 0) [2024-01-29 22:53:29,711 INFO L98 nessWitnessExtractor]: Location invariant before [L728-L728] (unsigned long )arg == 0UL [2024-01-29 22:53:29,711 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (0 <= __unbuffered_cnt) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1) [2024-01-29 22:53:29,711 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] ((0 <= __unbuffered_cnt) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1)) && ((x == 0 || x == 1) || x == 2) [2024-01-29 22:53:29,711 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] 0 <= __unbuffered_cnt [2024-01-29 22:53:29,711 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (0 <= __unbuffered_cnt) && (x <= 127) [2024-01-29 22:53:29,711 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (0 <= __unbuffered_cnt) && (y <= 127) [2024-01-29 22:53:29,711 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] ((0 <= __unbuffered_cnt) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1)) && (main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1) [2024-01-29 22:53:29,711 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (0 <= __unbuffered_cnt) && ((unsigned long )arg == 0UL) [2024-01-29 22:53:29,712 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (0 <= __unbuffered_cnt) && (0 <= y) [2024-01-29 22:53:29,712 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (0 <= __unbuffered_cnt) && (x <= 2) [2024-01-29 22:53:29,712 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (0 <= __unbuffered_cnt) && (0 <= x) [2024-01-29 22:53:29,712 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (0 <= __unbuffered_cnt) && (y <= 2) [2024-01-29 22:53:29,712 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] ((0 <= __unbuffered_cnt) && (main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1)) && ((y == 0 || y == 1) || y == 2) [2024-01-29 22:53:29,758 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:53:29,883 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_tso.i[945,958] [2024-01-29 22:53:30,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:53:30,008 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:53:30,017 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_tso.i[945,958] [2024-01-29 22:53:30,018 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int expression) { if (!expression) { ERROR: {reach_error();abort();} }; return; } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:53:30,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:53:30,221 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:53:30,222 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30 WrapperNode [2024-01-29 22:53:30,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:53:30,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:53:30,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:53:30,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:53:30,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,290 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2024-01-29 22:53:30,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:53:30,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:53:30,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:53:30,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:53:30,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,339 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-29 22:53:30,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:53:30,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:53:30,366 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:53:30,366 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:53:30,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (1/1) ... [2024-01-29 22:53:30,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:53:30,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:53:30,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 22:53:30,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 22:53:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:53:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:53:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:53:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 22:53:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:53:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:53:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:53:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-29 22:53:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-29 22:53:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-29 22:53:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-29 22:53:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:53:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:53:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:53:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 22:53:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:53:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:53:30,444 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:53:30,535 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:53:30,537 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:53:31,265 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:53:31,265 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:53:32,915 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:53:32,917 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:53:32,917 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:53:32 BoogieIcfgContainer [2024-01-29 22:53:32,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:53:32,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:53:32,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:53:32,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:53:32,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:53:29" (1/4) ... [2024-01-29 22:53:32,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653fe449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:53:32, skipping insertion in model container [2024-01-29 22:53:32,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:53:29" (2/4) ... [2024-01-29 22:53:32,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653fe449 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:53:32, skipping insertion in model container [2024-01-29 22:53:32,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:53:30" (3/4) ... [2024-01-29 22:53:32,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653fe449 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:53:32, skipping insertion in model container [2024-01-29 22:53:32,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:53:32" (4/4) ... [2024-01-29 22:53:32,929 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_tso.i [2024-01-29 22:53:32,946 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:53:32,946 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 224 error locations. [2024-01-29 22:53:32,947 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:53:33,108 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-29 22:53:33,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 271 places, 265 transitions, 538 flow [2024-01-29 22:53:33,262 INFO L124 PetriNetUnfolderBase]: 1/263 cut-off events. [2024-01-29 22:53:33,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:53:33,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 263 events. 1/263 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1983 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 253. Up to 2 conditions per place. [2024-01-29 22:53:33,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 271 places, 265 transitions, 538 flow [2024-01-29 22:53:33,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 269 places, 263 transitions, 532 flow [2024-01-29 22:53:33,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:53:33,346 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@535318a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:53:33,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 392 error locations. [2024-01-29 22:53:33,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:53:33,348 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:53:33,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:53:33,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:33,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:53:33,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:33,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:33,353 INFO L85 PathProgramCache]: Analyzing trace with hash 94316, now seen corresponding path program 1 times [2024-01-29 22:53:33,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:33,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76847895] [2024-01-29 22:53:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:33,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76847895] [2024-01-29 22:53:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76847895] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:33,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:33,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:53:33,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819842599] [2024-01-29 22:53:33,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:33,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:53:33,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:33,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:53:33,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:53:33,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 265 [2024-01-29 22:53:33,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 263 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-01-29 22:53:33,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:33,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 265 [2024-01-29 22:53:33,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:38,453 INFO L124 PetriNetUnfolderBase]: 32246/54479 cut-off events. [2024-01-29 22:53:38,453 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-29 22:53:38,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103968 conditions, 54479 events. 32246/54479 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4863. Compared 562666 event pairs, 15664 based on Foata normal form. 706/15151 useless extension candidates. Maximal degree in co-relation 103948. Up to 46994 conditions per place. [2024-01-29 22:53:38,816 INFO L140 encePairwiseOnDemand]: 100/265 looper letters, 112 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2024-01-29 22:53:38,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 144 transitions, 527 flow [2024-01-29 22:53:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:53:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:53:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2024-01-29 22:53:38,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5685534591194968 [2024-01-29 22:53:38,836 INFO L175 Difference]: Start difference. First operand has 269 places, 263 transitions, 532 flow. Second operand 3 states and 452 transitions. [2024-01-29 22:53:38,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 144 transitions, 527 flow [2024-01-29 22:53:38,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 144 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:53:38,848 INFO L231 Difference]: Finished difference. Result has 120 places, 114 transitions, 267 flow [2024-01-29 22:53:38,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=120, PETRI_TRANSITIONS=114} [2024-01-29 22:53:38,853 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -149 predicate places. [2024-01-29 22:53:38,854 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 114 transitions, 267 flow [2024-01-29 22:53:38,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-01-29 22:53:38,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:38,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:53:38,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:53:38,855 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:38,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2926639, now seen corresponding path program 1 times [2024-01-29 22:53:38,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:38,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784233777] [2024-01-29 22:53:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:38,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:38,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784233777] [2024-01-29 22:53:38,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784233777] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:38,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:38,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:53:38,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729947571] [2024-01-29 22:53:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:38,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:53:38,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:38,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:53:38,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:53:38,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 265 [2024-01-29 22:53:38,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 114 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-01-29 22:53:38,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:38,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 265 [2024-01-29 22:53:38,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:42,659 INFO L124 PetriNetUnfolderBase]: 31224/51878 cut-off events. [2024-01-29 22:53:42,659 INFO L125 PetriNetUnfolderBase]: For 3214/3214 co-relation queries the response was YES. [2024-01-29 22:53:42,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107326 conditions, 51878 events. 31224/51878 cut-off events. For 3214/3214 co-relation queries the response was YES. Maximal size of possible extension queue 4459. Compared 524089 event pairs, 18396 based on Foata normal form. 0/17153 useless extension candidates. Maximal degree in co-relation 107306. Up to 46141 conditions per place. [2024-01-29 22:53:42,926 INFO L140 encePairwiseOnDemand]: 252/265 looper letters, 115 selfloop transitions, 3 changer transitions 0/146 dead transitions. [2024-01-29 22:53:42,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 146 transitions, 586 flow [2024-01-29 22:53:42,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:53:42,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:53:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2024-01-29 22:53:42,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27547169811320754 [2024-01-29 22:53:42,928 INFO L175 Difference]: Start difference. First operand has 120 places, 114 transitions, 267 flow. Second operand 3 states and 219 transitions. [2024-01-29 22:53:42,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 146 transitions, 586 flow [2024-01-29 22:53:42,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 146 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:53:42,934 INFO L231 Difference]: Finished difference. Result has 121 places, 115 transitions, 297 flow [2024-01-29 22:53:42,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=121, PETRI_TRANSITIONS=115} [2024-01-29 22:53:42,936 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -148 predicate places. [2024-01-29 22:53:42,936 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 115 transitions, 297 flow [2024-01-29 22:53:42,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-01-29 22:53:42,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:42,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:53:42,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:53:42,937 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:42,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash 90728731, now seen corresponding path program 1 times [2024-01-29 22:53:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:42,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486985626] [2024-01-29 22:53:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:42,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:43,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:43,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486985626] [2024-01-29 22:53:43,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486985626] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:43,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:43,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:53:43,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535989854] [2024-01-29 22:53:43,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:43,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:53:43,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:43,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:53:43,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:53:43,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 265 [2024-01-29 22:53:43,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 115 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:53:43,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:43,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 265 [2024-01-29 22:53:43,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:45,782 INFO L124 PetriNetUnfolderBase]: 22989/38247 cut-off events. [2024-01-29 22:53:45,783 INFO L125 PetriNetUnfolderBase]: For 3469/3469 co-relation queries the response was YES. [2024-01-29 22:53:45,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84390 conditions, 38247 events. 22989/38247 cut-off events. For 3469/3469 co-relation queries the response was YES. Maximal size of possible extension queue 3197. Compared 377879 event pairs, 15478 based on Foata normal form. 442/17984 useless extension candidates. Maximal degree in co-relation 84370. Up to 23375 conditions per place. [2024-01-29 22:53:46,005 INFO L140 encePairwiseOnDemand]: 251/265 looper letters, 150 selfloop transitions, 4 changer transitions 0/182 dead transitions. [2024-01-29 22:53:46,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 182 transitions, 791 flow [2024-01-29 22:53:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:53:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:53:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2024-01-29 22:53:46,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31949685534591193 [2024-01-29 22:53:46,007 INFO L175 Difference]: Start difference. First operand has 121 places, 115 transitions, 297 flow. Second operand 3 states and 254 transitions. [2024-01-29 22:53:46,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 182 transitions, 791 flow [2024-01-29 22:53:46,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 182 transitions, 786 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:53:46,028 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 336 flow [2024-01-29 22:53:46,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=122, PETRI_TRANSITIONS=117} [2024-01-29 22:53:46,029 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -147 predicate places. [2024-01-29 22:53:46,029 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 336 flow [2024-01-29 22:53:46,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:53:46,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:46,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:53:46,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:53:46,030 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:46,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1482373651, now seen corresponding path program 1 times [2024-01-29 22:53:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:46,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686219028] [2024-01-29 22:53:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:46,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:46,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686219028] [2024-01-29 22:53:46,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686219028] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:46,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:46,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:53:46,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968068621] [2024-01-29 22:53:46,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:46,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:53:46,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:46,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:53:46,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:53:46,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 265 [2024-01-29 22:53:46,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:53:46,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:46,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 265 [2024-01-29 22:53:46,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:47,153 INFO L124 PetriNetUnfolderBase]: 6766/11756 cut-off events. [2024-01-29 22:53:47,153 INFO L125 PetriNetUnfolderBase]: For 1906/1906 co-relation queries the response was YES. [2024-01-29 22:53:47,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27411 conditions, 11756 events. 6766/11756 cut-off events. For 1906/1906 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 103437 event pairs, 4398 based on Foata normal form. 355/7654 useless extension candidates. Maximal degree in co-relation 27390. Up to 6378 conditions per place. [2024-01-29 22:53:47,206 INFO L140 encePairwiseOnDemand]: 252/265 looper letters, 129 selfloop transitions, 3 changer transitions 0/159 dead transitions. [2024-01-29 22:53:47,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 159 transitions, 709 flow [2024-01-29 22:53:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:53:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:53:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2024-01-29 22:53:47,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2943396226415094 [2024-01-29 22:53:47,207 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 336 flow. Second operand 3 states and 234 transitions. [2024-01-29 22:53:47,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 159 transitions, 709 flow [2024-01-29 22:53:47,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 159 transitions, 706 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:53:47,214 INFO L231 Difference]: Finished difference. Result has 123 places, 115 transitions, 351 flow [2024-01-29 22:53:47,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=123, PETRI_TRANSITIONS=115} [2024-01-29 22:53:47,215 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -146 predicate places. [2024-01-29 22:53:47,215 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 115 transitions, 351 flow [2024-01-29 22:53:47,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:53:47,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:47,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:47,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:53:47,216 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:47,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:47,216 INFO L85 PathProgramCache]: Analyzing trace with hash 537151321, now seen corresponding path program 1 times [2024-01-29 22:53:47,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:47,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929360690] [2024-01-29 22:53:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:47,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:47,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:47,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929360690] [2024-01-29 22:53:47,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929360690] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:47,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:47,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:53:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542808805] [2024-01-29 22:53:47,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:47,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:53:47,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:47,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:53:47,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:53:47,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 265 [2024-01-29 22:53:47,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 115 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-01-29 22:53:47,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:47,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 265 [2024-01-29 22:53:47,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:48,314 INFO L124 PetriNetUnfolderBase]: 6018/10607 cut-off events. [2024-01-29 22:53:48,314 INFO L125 PetriNetUnfolderBase]: For 2978/2978 co-relation queries the response was YES. [2024-01-29 22:53:48,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25446 conditions, 10607 events. 6018/10607 cut-off events. For 2978/2978 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 91349 event pairs, 4209 based on Foata normal form. 566/7930 useless extension candidates. Maximal degree in co-relation 25423. Up to 9662 conditions per place. [2024-01-29 22:53:48,359 INFO L140 encePairwiseOnDemand]: 254/265 looper letters, 124 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2024-01-29 22:53:48,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 147 transitions, 714 flow [2024-01-29 22:53:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:53:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:53:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2024-01-29 22:53:48,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22735849056603774 [2024-01-29 22:53:48,361 INFO L175 Difference]: Start difference. First operand has 123 places, 115 transitions, 351 flow. Second operand 4 states and 241 transitions. [2024-01-29 22:53:48,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 147 transitions, 714 flow [2024-01-29 22:53:48,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 147 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:53:48,368 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 331 flow [2024-01-29 22:53:48,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2024-01-29 22:53:48,369 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -154 predicate places. [2024-01-29 22:53:48,369 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 331 flow [2024-01-29 22:53:48,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-01-29 22:53:48,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:48,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:48,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:53:48,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:48,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash -528175179, now seen corresponding path program 1 times [2024-01-29 22:53:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150415851] [2024-01-29 22:53:48,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:48,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:48,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:48,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150415851] [2024-01-29 22:53:48,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150415851] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:48,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:48,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:53:48,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856200880] [2024-01-29 22:53:48,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:48,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:53:48,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:48,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:53:48,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:53:48,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:53:48,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 331 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-01-29 22:53:48,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:48,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:53:48,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:49,236 INFO L124 PetriNetUnfolderBase]: 5786/10216 cut-off events. [2024-01-29 22:53:49,237 INFO L125 PetriNetUnfolderBase]: For 2553/2553 co-relation queries the response was YES. [2024-01-29 22:53:49,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24406 conditions, 10216 events. 5786/10216 cut-off events. For 2553/2553 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 88076 event pairs, 4006 based on Foata normal form. 18/7068 useless extension candidates. Maximal degree in co-relation 24381. Up to 9402 conditions per place. [2024-01-29 22:53:49,309 INFO L140 encePairwiseOnDemand]: 261/265 looper letters, 94 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2024-01-29 22:53:49,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 117 transitions, 557 flow [2024-01-29 22:53:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:53:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:53:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2024-01-29 22:53:49,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22767295597484277 [2024-01-29 22:53:49,311 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 331 flow. Second operand 3 states and 181 transitions. [2024-01-29 22:53:49,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 117 transitions, 557 flow [2024-01-29 22:53:49,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 117 transitions, 554 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:53:49,320 INFO L231 Difference]: Finished difference. Result has 116 places, 106 transitions, 339 flow [2024-01-29 22:53:49,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=116, PETRI_TRANSITIONS=106} [2024-01-29 22:53:49,321 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -153 predicate places. [2024-01-29 22:53:49,321 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 106 transitions, 339 flow [2024-01-29 22:53:49,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-01-29 22:53:49,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:49,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:49,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:53:49,322 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:49,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash 798787291, now seen corresponding path program 1 times [2024-01-29 22:53:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:49,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734463466] [2024-01-29 22:53:49,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:49,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:49,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:49,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734463466] [2024-01-29 22:53:49,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734463466] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:49,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:49,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:53:49,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822918897] [2024-01-29 22:53:49,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:49,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:53:49,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:49,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:53:49,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:53:49,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 265 [2024-01-29 22:53:49,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 106 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-01-29 22:53:49,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:49,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 265 [2024-01-29 22:53:49,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:50,074 INFO L124 PetriNetUnfolderBase]: 5349/9305 cut-off events. [2024-01-29 22:53:50,074 INFO L125 PetriNetUnfolderBase]: For 2704/2704 co-relation queries the response was YES. [2024-01-29 22:53:50,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22724 conditions, 9305 events. 5349/9305 cut-off events. For 2704/2704 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 77058 event pairs, 3150 based on Foata normal form. 450/7205 useless extension candidates. Maximal degree in co-relation 22700. Up to 8587 conditions per place. [2024-01-29 22:53:50,115 INFO L140 encePairwiseOnDemand]: 255/265 looper letters, 126 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-01-29 22:53:50,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 144 transitions, 727 flow [2024-01-29 22:53:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:53:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:53:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2024-01-29 22:53:50,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22830188679245284 [2024-01-29 22:53:50,117 INFO L175 Difference]: Start difference. First operand has 116 places, 106 transitions, 339 flow. Second operand 4 states and 242 transitions. [2024-01-29 22:53:50,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 144 transitions, 727 flow [2024-01-29 22:53:50,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 144 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:53:50,121 INFO L231 Difference]: Finished difference. Result has 109 places, 98 transitions, 321 flow [2024-01-29 22:53:50,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=109, PETRI_TRANSITIONS=98} [2024-01-29 22:53:50,122 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -160 predicate places. [2024-01-29 22:53:50,122 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 98 transitions, 321 flow [2024-01-29 22:53:50,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-01-29 22:53:50,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:50,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:50,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:53:50,123 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:50,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:50,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1007394608, now seen corresponding path program 1 times [2024-01-29 22:53:50,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:50,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024887568] [2024-01-29 22:53:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:50,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024887568] [2024-01-29 22:53:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024887568] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:50,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:53:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856121684] [2024-01-29 22:53:50,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:50,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:53:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:53:50,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:53:50,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 265 [2024-01-29 22:53:50,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 98 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-01-29 22:53:50,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:50,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 265 [2024-01-29 22:53:50,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:50,908 INFO L124 PetriNetUnfolderBase]: 6089/10287 cut-off events. [2024-01-29 22:53:50,908 INFO L125 PetriNetUnfolderBase]: For 2742/2742 co-relation queries the response was YES. [2024-01-29 22:53:50,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25344 conditions, 10287 events. 6089/10287 cut-off events. For 2742/2742 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 79339 event pairs, 4896 based on Foata normal form. 3/7576 useless extension candidates. Maximal degree in co-relation 25321. Up to 9965 conditions per place. [2024-01-29 22:53:50,975 INFO L140 encePairwiseOnDemand]: 260/265 looper letters, 92 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2024-01-29 22:53:50,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 109 transitions, 551 flow [2024-01-29 22:53:50,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:53:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:53:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2024-01-29 22:53:50,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1660377358490566 [2024-01-29 22:53:50,977 INFO L175 Difference]: Start difference. First operand has 109 places, 98 transitions, 321 flow. Second operand 4 states and 176 transitions. [2024-01-29 22:53:50,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 109 transitions, 551 flow [2024-01-29 22:53:50,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 545 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:53:50,982 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 358 flow [2024-01-29 22:53:50,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=358, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2024-01-29 22:53:50,983 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -157 predicate places. [2024-01-29 22:53:50,983 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 358 flow [2024-01-29 22:53:50,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-01-29 22:53:50,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:50,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:50,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:53:50,984 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err29ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:50,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:50,984 INFO L85 PathProgramCache]: Analyzing trace with hash -770088431, now seen corresponding path program 1 times [2024-01-29 22:53:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:50,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229944014] [2024-01-29 22:53:50,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:50,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229944014] [2024-01-29 22:53:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229944014] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:53:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578009615] [2024-01-29 22:53:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:51,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:53:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:51,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:53:51,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:53:51,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:53:51,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:53:51,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:51,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:53:51,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:51,750 INFO L124 PetriNetUnfolderBase]: 5097/8795 cut-off events. [2024-01-29 22:53:51,750 INFO L125 PetriNetUnfolderBase]: For 2535/2535 co-relation queries the response was YES. [2024-01-29 22:53:51,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21761 conditions, 8795 events. 5097/8795 cut-off events. For 2535/2535 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 72803 event pairs, 4021 based on Foata normal form. 10/6315 useless extension candidates. Maximal degree in co-relation 21733. Up to 8348 conditions per place. [2024-01-29 22:53:51,804 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 90 selfloop transitions, 6 changer transitions 0/112 dead transitions. [2024-01-29 22:53:51,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 112 transitions, 576 flow [2024-01-29 22:53:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:53:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:53:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2024-01-29 22:53:51,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2037735849056604 [2024-01-29 22:53:51,806 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 358 flow. Second operand 4 states and 216 transitions. [2024-01-29 22:53:51,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 112 transitions, 576 flow [2024-01-29 22:53:51,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 576 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 22:53:51,811 INFO L231 Difference]: Finished difference. Result has 116 places, 102 transitions, 384 flow [2024-01-29 22:53:51,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=384, PETRI_PLACES=116, PETRI_TRANSITIONS=102} [2024-01-29 22:53:51,811 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -153 predicate places. [2024-01-29 22:53:51,812 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 384 flow [2024-01-29 22:53:51,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:53:51,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:51,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:51,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:53:51,812 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err23ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:51,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash -770088437, now seen corresponding path program 1 times [2024-01-29 22:53:51,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:51,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584696978] [2024-01-29 22:53:51,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:51,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584696978] [2024-01-29 22:53:51,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584696978] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:51,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:51,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:53:51,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296754844] [2024-01-29 22:53:51,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:51,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:53:51,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:51,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:53:51,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:53:51,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:53:51,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 102 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-01-29 22:53:51,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:51,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:53:51,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:52,657 INFO L124 PetriNetUnfolderBase]: 5624/9381 cut-off events. [2024-01-29 22:53:52,657 INFO L125 PetriNetUnfolderBase]: For 3723/3723 co-relation queries the response was YES. [2024-01-29 22:53:52,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24336 conditions, 9381 events. 5624/9381 cut-off events. For 3723/3723 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 74559 event pairs, 4160 based on Foata normal form. 8/6776 useless extension candidates. Maximal degree in co-relation 24305. Up to 8951 conditions per place. [2024-01-29 22:53:52,730 INFO L140 encePairwiseOnDemand]: 261/265 looper letters, 87 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2024-01-29 22:53:52,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 107 transitions, 580 flow [2024-01-29 22:53:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:53:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:53:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2024-01-29 22:53:52,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21761006289308177 [2024-01-29 22:53:52,731 INFO L175 Difference]: Start difference. First operand has 116 places, 102 transitions, 384 flow. Second operand 3 states and 173 transitions. [2024-01-29 22:53:52,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 107 transitions, 580 flow [2024-01-29 22:53:52,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 107 transitions, 568 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:53:52,738 INFO L231 Difference]: Finished difference. Result has 116 places, 102 transitions, 386 flow [2024-01-29 22:53:52,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=116, PETRI_TRANSITIONS=102} [2024-01-29 22:53:52,739 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -153 predicate places. [2024-01-29 22:53:52,739 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 386 flow [2024-01-29 22:53:52,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-01-29 22:53:52,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:52,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:52,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:53:52,740 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:52,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:52,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1910311960, now seen corresponding path program 1 times [2024-01-29 22:53:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:52,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943332614] [2024-01-29 22:53:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:52,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943332614] [2024-01-29 22:53:52,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943332614] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:52,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:52,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:53:52,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100734202] [2024-01-29 22:53:52,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:52,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:53:52,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:52,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:53:52,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:53:52,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:53:52,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 102 transitions, 386 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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-01-29 22:53:52,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:52,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:53:52,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:53,732 INFO L124 PetriNetUnfolderBase]: 5536/9321 cut-off events. [2024-01-29 22:53:53,732 INFO L125 PetriNetUnfolderBase]: For 3693/3783 co-relation queries the response was YES. [2024-01-29 22:53:53,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24134 conditions, 9321 events. 5536/9321 cut-off events. For 3693/3783 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 75508 event pairs, 2648 based on Foata normal form. 150/6853 useless extension candidates. Maximal degree in co-relation 24101. Up to 6031 conditions per place. [2024-01-29 22:53:53,794 INFO L140 encePairwiseOnDemand]: 253/265 looper letters, 131 selfloop transitions, 9 changer transitions 0/154 dead transitions. [2024-01-29 22:53:53,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 154 transitions, 824 flow [2024-01-29 22:53:53,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:53:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:53:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2024-01-29 22:53:53,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24339622641509434 [2024-01-29 22:53:53,796 INFO L175 Difference]: Start difference. First operand has 116 places, 102 transitions, 386 flow. Second operand 4 states and 258 transitions. [2024-01-29 22:53:53,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 154 transitions, 824 flow [2024-01-29 22:53:53,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 154 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:53:53,804 INFO L231 Difference]: Finished difference. Result has 119 places, 106 transitions, 445 flow [2024-01-29 22:53:53,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=445, PETRI_PLACES=119, PETRI_TRANSITIONS=106} [2024-01-29 22:53:53,804 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -150 predicate places. [2024-01-29 22:53:53,805 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 106 transitions, 445 flow [2024-01-29 22:53:53,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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-01-29 22:53:53,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:53,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:53,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:53:53,805 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P1Err23ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:53,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:53,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1738456058, now seen corresponding path program 1 times [2024-01-29 22:53:53,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:53,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218737964] [2024-01-29 22:53:53,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:53,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:53,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218737964] [2024-01-29 22:53:53,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218737964] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:53,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:53,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:53:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893859526] [2024-01-29 22:53:53,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:53,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:53:53,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:53,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:53:53,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:53:53,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:53:53,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 106 transitions, 445 flow. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-01-29 22:53:53,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:53,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:53:53,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:54,761 INFO L124 PetriNetUnfolderBase]: 4992/8720 cut-off events. [2024-01-29 22:53:54,761 INFO L125 PetriNetUnfolderBase]: For 4903/4903 co-relation queries the response was YES. [2024-01-29 22:53:54,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23494 conditions, 8720 events. 4992/8720 cut-off events. For 4903/4903 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 73196 event pairs, 4024 based on Foata normal form. 3/6799 useless extension candidates. Maximal degree in co-relation 23461. Up to 8279 conditions per place. [2024-01-29 22:53:54,827 INFO L140 encePairwiseOnDemand]: 260/265 looper letters, 90 selfloop transitions, 6 changer transitions 0/112 dead transitions. [2024-01-29 22:53:54,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 112 transitions, 651 flow [2024-01-29 22:53:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:53:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:53:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2024-01-29 22:53:54,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19622641509433963 [2024-01-29 22:53:54,828 INFO L175 Difference]: Start difference. First operand has 119 places, 106 transitions, 445 flow. Second operand 4 states and 208 transitions. [2024-01-29 22:53:54,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 112 transitions, 651 flow [2024-01-29 22:53:54,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 112 transitions, 639 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-29 22:53:54,839 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 450 flow [2024-01-29 22:53:54,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=450, PETRI_PLACES=121, PETRI_TRANSITIONS=106} [2024-01-29 22:53:54,840 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -148 predicate places. [2024-01-29 22:53:54,840 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 450 flow [2024-01-29 22:53:54,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-01-29 22:53:54,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:54,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:54,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:53:54,841 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err45ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:54,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1320494623, now seen corresponding path program 1 times [2024-01-29 22:53:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:54,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552890546] [2024-01-29 22:53:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:54,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552890546] [2024-01-29 22:53:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552890546] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:54,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:53:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879772797] [2024-01-29 22:53:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:54,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:53:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:54,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:53:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:53:54,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:53:54,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 106 transitions, 450 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-01-29 22:53:54,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:54,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:53:54,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:55,707 INFO L124 PetriNetUnfolderBase]: 4435/7807 cut-off events. [2024-01-29 22:53:55,707 INFO L125 PetriNetUnfolderBase]: For 4230/4230 co-relation queries the response was YES. [2024-01-29 22:53:55,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20782 conditions, 7807 events. 4435/7807 cut-off events. For 4230/4230 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 65009 event pairs, 2729 based on Foata normal form. 230/6389 useless extension candidates. Maximal degree in co-relation 20746. Up to 5596 conditions per place. [2024-01-29 22:53:55,770 INFO L140 encePairwiseOnDemand]: 238/265 looper letters, 126 selfloop transitions, 18 changer transitions 0/158 dead transitions. [2024-01-29 22:53:55,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 158 transitions, 904 flow [2024-01-29 22:53:55,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:53:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:53:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 309 transitions. [2024-01-29 22:53:55,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23320754716981132 [2024-01-29 22:53:55,772 INFO L175 Difference]: Start difference. First operand has 121 places, 106 transitions, 450 flow. Second operand 5 states and 309 transitions. [2024-01-29 22:53:55,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 158 transitions, 904 flow [2024-01-29 22:53:55,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 158 transitions, 884 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-29 22:53:55,782 INFO L231 Difference]: Finished difference. Result has 124 places, 114 transitions, 593 flow [2024-01-29 22:53:55,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=593, PETRI_PLACES=124, PETRI_TRANSITIONS=114} [2024-01-29 22:53:55,783 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -145 predicate places. [2024-01-29 22:53:55,783 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 114 transitions, 593 flow [2024-01-29 22:53:55,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-01-29 22:53:55,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:55,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:55,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:53:55,784 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:55,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash -808754654, now seen corresponding path program 1 times [2024-01-29 22:53:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329599348] [2024-01-29 22:53:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:55,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:55,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329599348] [2024-01-29 22:53:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329599348] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:55,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:55,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:53:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832522195] [2024-01-29 22:53:55,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:55,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:53:55,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:55,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:53:55,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:53:55,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 265 [2024-01-29 22:53:55,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 114 transitions, 593 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-01-29 22:53:55,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:55,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 265 [2024-01-29 22:53:55,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:56,711 INFO L124 PetriNetUnfolderBase]: 5167/8998 cut-off events. [2024-01-29 22:53:56,711 INFO L125 PetriNetUnfolderBase]: For 8304/8304 co-relation queries the response was YES. [2024-01-29 22:53:56,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27625 conditions, 8998 events. 5167/8998 cut-off events. For 8304/8304 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 70131 event pairs, 4027 based on Foata normal form. 3/7753 useless extension candidates. Maximal degree in co-relation 27590. Up to 8567 conditions per place. [2024-01-29 22:53:56,784 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 111 selfloop transitions, 9 changer transitions 0/130 dead transitions. [2024-01-29 22:53:56,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 130 transitions, 893 flow [2024-01-29 22:53:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:53:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:53:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2024-01-29 22:53:56,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.15396226415094338 [2024-01-29 22:53:56,786 INFO L175 Difference]: Start difference. First operand has 124 places, 114 transitions, 593 flow. Second operand 5 states and 204 transitions. [2024-01-29 22:53:56,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 130 transitions, 893 flow [2024-01-29 22:53:56,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 130 transitions, 887 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-01-29 22:53:56,798 INFO L231 Difference]: Finished difference. Result has 130 places, 117 transitions, 643 flow [2024-01-29 22:53:56,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=643, PETRI_PLACES=130, PETRI_TRANSITIONS=117} [2024-01-29 22:53:56,799 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -139 predicate places. [2024-01-29 22:53:56,799 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 643 flow [2024-01-29 22:53:56,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-01-29 22:53:56,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:56,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:56,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:53:56,800 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:56,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:56,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1938839206, now seen corresponding path program 2 times [2024-01-29 22:53:56,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:56,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330903210] [2024-01-29 22:53:56,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:56,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:56,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330903210] [2024-01-29 22:53:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330903210] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:56,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:56,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:53:56,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069469879] [2024-01-29 22:53:56,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:56,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:53:56,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:56,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:53:56,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:53:56,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 265 [2024-01-29 22:53:56,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 117 transitions, 643 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-01-29 22:53:56,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:56,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 265 [2024-01-29 22:53:56,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:58,085 INFO L124 PetriNetUnfolderBase]: 5162/8983 cut-off events. [2024-01-29 22:53:58,085 INFO L125 PetriNetUnfolderBase]: For 8596/8596 co-relation queries the response was YES. [2024-01-29 22:53:58,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27722 conditions, 8983 events. 5162/8983 cut-off events. For 8596/8596 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 70097 event pairs, 4034 based on Foata normal form. 3/7737 useless extension candidates. Maximal degree in co-relation 27683. Up to 8564 conditions per place. [2024-01-29 22:53:58,163 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 107 selfloop transitions, 10 changer transitions 0/127 dead transitions. [2024-01-29 22:53:58,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 127 transitions, 911 flow [2024-01-29 22:53:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:53:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:53:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2024-01-29 22:53:58,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1509433962264151 [2024-01-29 22:53:58,165 INFO L175 Difference]: Start difference. First operand has 130 places, 117 transitions, 643 flow. Second operand 5 states and 200 transitions. [2024-01-29 22:53:58,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 127 transitions, 911 flow [2024-01-29 22:53:58,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 127 transitions, 887 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-01-29 22:53:58,179 INFO L231 Difference]: Finished difference. Result has 132 places, 118 transitions, 657 flow [2024-01-29 22:53:58,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=657, PETRI_PLACES=132, PETRI_TRANSITIONS=118} [2024-01-29 22:53:58,180 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -137 predicate places. [2024-01-29 22:53:58,180 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 118 transitions, 657 flow [2024-01-29 22:53:58,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-01-29 22:53:58,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:58,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:58,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:53:58,181 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:58,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1858456397, now seen corresponding path program 1 times [2024-01-29 22:53:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664660508] [2024-01-29 22:53:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:58,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664660508] [2024-01-29 22:53:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664660508] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:58,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:58,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:53:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112044939] [2024-01-29 22:53:58,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:58,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:53:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:58,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:53:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:53:58,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:53:58,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 118 transitions, 657 flow. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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-01-29 22:53:58,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:58,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:53:58,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:59,068 INFO L124 PetriNetUnfolderBase]: 4345/7416 cut-off events. [2024-01-29 22:53:59,069 INFO L125 PetriNetUnfolderBase]: For 8025/8025 co-relation queries the response was YES. [2024-01-29 22:53:59,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23077 conditions, 7416 events. 4345/7416 cut-off events. For 8025/8025 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 58754 event pairs, 3010 based on Foata normal form. 108/6348 useless extension candidates. Maximal degree in co-relation 23035. Up to 5955 conditions per place. [2024-01-29 22:53:59,105 INFO L140 encePairwiseOnDemand]: 248/265 looper letters, 122 selfloop transitions, 18 changer transitions 0/155 dead transitions. [2024-01-29 22:53:59,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 155 transitions, 1083 flow [2024-01-29 22:53:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:53:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:53:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2024-01-29 22:53:59,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2158490566037736 [2024-01-29 22:53:59,106 INFO L175 Difference]: Start difference. First operand has 132 places, 118 transitions, 657 flow. Second operand 5 states and 286 transitions. [2024-01-29 22:53:59,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 155 transitions, 1083 flow [2024-01-29 22:53:59,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 155 transitions, 1070 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:53:59,116 INFO L231 Difference]: Finished difference. Result has 135 places, 118 transitions, 706 flow [2024-01-29 22:53:59,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=706, PETRI_PLACES=135, PETRI_TRANSITIONS=118} [2024-01-29 22:53:59,116 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -134 predicate places. [2024-01-29 22:53:59,116 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 118 transitions, 706 flow [2024-01-29 22:53:59,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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-01-29 22:53:59,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:59,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:59,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:53:59,117 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P1Err45ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:59,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:59,117 INFO L85 PathProgramCache]: Analyzing trace with hash 86127804, now seen corresponding path program 1 times [2024-01-29 22:53:59,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:59,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466516533] [2024-01-29 22:53:59,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:59,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:53:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:53:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:53:59,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:53:59,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466516533] [2024-01-29 22:53:59,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466516533] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:53:59,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:53:59,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:53:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383975086] [2024-01-29 22:53:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:53:59,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:53:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:59,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:53:59,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:53:59,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 265 [2024-01-29 22:53:59,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 118 transitions, 706 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-01-29 22:53:59,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:59,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 265 [2024-01-29 22:53:59,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:59,930 INFO L124 PetriNetUnfolderBase]: 4266/7275 cut-off events. [2024-01-29 22:53:59,931 INFO L125 PetriNetUnfolderBase]: For 9446/9446 co-relation queries the response was YES. [2024-01-29 22:53:59,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23750 conditions, 7275 events. 4266/7275 cut-off events. For 9446/9446 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 57461 event pairs, 3093 based on Foata normal form. 21/6152 useless extension candidates. Maximal degree in co-relation 23706. Up to 5946 conditions per place. [2024-01-29 22:53:59,976 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 117 selfloop transitions, 15 changer transitions 0/147 dead transitions. [2024-01-29 22:53:59,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 147 transitions, 1118 flow [2024-01-29 22:53:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:53:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:53:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2024-01-29 22:53:59,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.219811320754717 [2024-01-29 22:53:59,978 INFO L175 Difference]: Start difference. First operand has 135 places, 118 transitions, 706 flow. Second operand 4 states and 233 transitions. [2024-01-29 22:53:59,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 147 transitions, 1118 flow [2024-01-29 22:53:59,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 1084 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-29 22:53:59,994 INFO L231 Difference]: Finished difference. Result has 136 places, 118 transitions, 716 flow [2024-01-29 22:53:59,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=716, PETRI_PLACES=136, PETRI_TRANSITIONS=118} [2024-01-29 22:53:59,994 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -133 predicate places. [2024-01-29 22:53:59,995 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 118 transitions, 716 flow [2024-01-29 22:53:59,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-01-29 22:53:59,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:53:59,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:53:59,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:53:59,995 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:53:59,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:53:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1636303293, now seen corresponding path program 1 times [2024-01-29 22:53:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:53:59,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049485064] [2024-01-29 22:53:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:53:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049485064] [2024-01-29 22:54:00,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049485064] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:00,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:00,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183551193] [2024-01-29 22:54:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:00,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:54:00,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:00,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:54:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:54:00,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 265 [2024-01-29 22:54:00,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 118 transitions, 716 flow. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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-01-29 22:54:00,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:00,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 265 [2024-01-29 22:54:00,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:00,887 INFO L124 PetriNetUnfolderBase]: 4672/8183 cut-off events. [2024-01-29 22:54:00,888 INFO L125 PetriNetUnfolderBase]: For 10707/10707 co-relation queries the response was YES. [2024-01-29 22:54:00,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26491 conditions, 8183 events. 4672/8183 cut-off events. For 10707/10707 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 61930 event pairs, 3119 based on Foata normal form. 6/7219 useless extension candidates. Maximal degree in co-relation 26446. Up to 6190 conditions per place. [2024-01-29 22:54:00,943 INFO L140 encePairwiseOnDemand]: 252/265 looper letters, 145 selfloop transitions, 34 changer transitions 0/187 dead transitions. [2024-01-29 22:54:00,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 187 transitions, 1426 flow [2024-01-29 22:54:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 22:54:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 22:54:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 278 transitions. [2024-01-29 22:54:00,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17484276729559747 [2024-01-29 22:54:00,944 INFO L175 Difference]: Start difference. First operand has 136 places, 118 transitions, 716 flow. Second operand 6 states and 278 transitions. [2024-01-29 22:54:00,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 187 transitions, 1426 flow [2024-01-29 22:54:00,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 187 transitions, 1380 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:54:00,964 INFO L231 Difference]: Finished difference. Result has 141 places, 134 transitions, 924 flow [2024-01-29 22:54:00,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=924, PETRI_PLACES=141, PETRI_TRANSITIONS=134} [2024-01-29 22:54:00,964 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -128 predicate places. [2024-01-29 22:54:00,965 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 134 transitions, 924 flow [2024-01-29 22:54:00,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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-01-29 22:54:00,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:00,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:00,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 22:54:00,965 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:00,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:00,966 INFO L85 PathProgramCache]: Analyzing trace with hash -799434162, now seen corresponding path program 1 times [2024-01-29 22:54:00,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:00,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279232469] [2024-01-29 22:54:00,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:00,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:01,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:01,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279232469] [2024-01-29 22:54:01,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279232469] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:01,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:01,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:01,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077192052] [2024-01-29 22:54:01,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:01,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:54:01,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:01,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:54:01,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:54:01,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 265 [2024-01-29 22:54:01,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 134 transitions, 924 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-01-29 22:54:01,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:01,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 265 [2024-01-29 22:54:01,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:02,004 INFO L124 PetriNetUnfolderBase]: 4692/8215 cut-off events. [2024-01-29 22:54:02,004 INFO L125 PetriNetUnfolderBase]: For 11808/11808 co-relation queries the response was YES. [2024-01-29 22:54:02,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27480 conditions, 8215 events. 4692/8215 cut-off events. For 11808/11808 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 62174 event pairs, 3162 based on Foata normal form. 6/7251 useless extension candidates. Maximal degree in co-relation 27432. Up to 6202 conditions per place. [2024-01-29 22:54:02,062 INFO L140 encePairwiseOnDemand]: 252/265 looper letters, 145 selfloop transitions, 42 changer transitions 0/195 dead transitions. [2024-01-29 22:54:02,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 195 transitions, 1592 flow [2024-01-29 22:54:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 22:54:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 22:54:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 277 transitions. [2024-01-29 22:54:02,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1742138364779874 [2024-01-29 22:54:02,063 INFO L175 Difference]: Start difference. First operand has 141 places, 134 transitions, 924 flow. Second operand 6 states and 277 transitions. [2024-01-29 22:54:02,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 195 transitions, 1592 flow [2024-01-29 22:54:02,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 195 transitions, 1557 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-29 22:54:02,082 INFO L231 Difference]: Finished difference. Result has 146 places, 144 transitions, 1094 flow [2024-01-29 22:54:02,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1094, PETRI_PLACES=146, PETRI_TRANSITIONS=144} [2024-01-29 22:54:02,082 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -123 predicate places. [2024-01-29 22:54:02,082 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 144 transitions, 1094 flow [2024-01-29 22:54:02,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-01-29 22:54:02,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:02,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:02,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 22:54:02,083 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P1Err23ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:02,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash -797311506, now seen corresponding path program 1 times [2024-01-29 22:54:02,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:02,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389284880] [2024-01-29 22:54:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:02,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:02,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389284880] [2024-01-29 22:54:02,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389284880] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:02,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:02,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:54:02,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146404779] [2024-01-29 22:54:02,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:02,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:02,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:02,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:02,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:54:02,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 144 transitions, 1094 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-01-29 22:54:02,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:02,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:54:02,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:03,024 INFO L124 PetriNetUnfolderBase]: 4937/8247 cut-off events. [2024-01-29 22:54:03,024 INFO L125 PetriNetUnfolderBase]: For 14693/14794 co-relation queries the response was YES. [2024-01-29 22:54:03,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28440 conditions, 8247 events. 4937/8247 cut-off events. For 14693/14794 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 60370 event pairs, 3132 based on Foata normal form. 42/7162 useless extension candidates. Maximal degree in co-relation 28390. Up to 6662 conditions per place. [2024-01-29 22:54:03,085 INFO L140 encePairwiseOnDemand]: 255/265 looper letters, 122 selfloop transitions, 33 changer transitions 0/179 dead transitions. [2024-01-29 22:54:03,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 179 transitions, 1601 flow [2024-01-29 22:54:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 274 transitions. [2024-01-29 22:54:03,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20679245283018868 [2024-01-29 22:54:03,086 INFO L175 Difference]: Start difference. First operand has 146 places, 144 transitions, 1094 flow. Second operand 5 states and 274 transitions. [2024-01-29 22:54:03,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 179 transitions, 1601 flow [2024-01-29 22:54:03,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 179 transitions, 1521 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-01-29 22:54:03,109 INFO L231 Difference]: Finished difference. Result has 146 places, 146 transitions, 1127 flow [2024-01-29 22:54:03,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1127, PETRI_PLACES=146, PETRI_TRANSITIONS=146} [2024-01-29 22:54:03,110 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -123 predicate places. [2024-01-29 22:54:03,110 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 146 transitions, 1127 flow [2024-01-29 22:54:03,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-01-29 22:54:03,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:03,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:03,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 22:54:03,110 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:03,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash -791298544, now seen corresponding path program 2 times [2024-01-29 22:54:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520005422] [2024-01-29 22:54:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:03,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:03,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:03,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520005422] [2024-01-29 22:54:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520005422] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:03,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:03,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:03,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141926750] [2024-01-29 22:54:03,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:03,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:54:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:03,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:54:03,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:54:03,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 265 [2024-01-29 22:54:03,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 146 transitions, 1127 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-01-29 22:54:03,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:03,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 265 [2024-01-29 22:54:03,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:04,128 INFO L124 PetriNetUnfolderBase]: 4691/8178 cut-off events. [2024-01-29 22:54:04,128 INFO L125 PetriNetUnfolderBase]: For 14342/14342 co-relation queries the response was YES. [2024-01-29 22:54:04,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28417 conditions, 8178 events. 4691/8178 cut-off events. For 14342/14342 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 61573 event pairs, 3191 based on Foata normal form. 6/7215 useless extension candidates. Maximal degree in co-relation 28367. Up to 6205 conditions per place. [2024-01-29 22:54:04,185 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 150 selfloop transitions, 39 changer transitions 0/197 dead transitions. [2024-01-29 22:54:04,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 197 transitions, 1842 flow [2024-01-29 22:54:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 22:54:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 22:54:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2024-01-29 22:54:04,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.16477987421383647 [2024-01-29 22:54:04,186 INFO L175 Difference]: Start difference. First operand has 146 places, 146 transitions, 1127 flow. Second operand 6 states and 262 transitions. [2024-01-29 22:54:04,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 197 transitions, 1842 flow [2024-01-29 22:54:04,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 197 transitions, 1802 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:54:04,216 INFO L231 Difference]: Finished difference. Result has 151 places, 155 transitions, 1332 flow [2024-01-29 22:54:04,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1332, PETRI_PLACES=151, PETRI_TRANSITIONS=155} [2024-01-29 22:54:04,217 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -118 predicate places. [2024-01-29 22:54:04,217 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 155 transitions, 1332 flow [2024-01-29 22:54:04,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-01-29 22:54:04,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:04,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:04,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 22:54:04,217 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting P1Err23ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:04,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:04,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1629341984, now seen corresponding path program 2 times [2024-01-29 22:54:04,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:04,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434372068] [2024-01-29 22:54:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:04,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:04,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:04,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434372068] [2024-01-29 22:54:04,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434372068] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:04,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:04,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:54:04,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360585611] [2024-01-29 22:54:04,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:04,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:04,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:04,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:04,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:54:04,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 155 transitions, 1332 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-01-29 22:54:04,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:04,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:54:04,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:05,145 INFO L124 PetriNetUnfolderBase]: 4932/8165 cut-off events. [2024-01-29 22:54:05,145 INFO L125 PetriNetUnfolderBase]: For 17372/17476 co-relation queries the response was YES. [2024-01-29 22:54:05,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28949 conditions, 8165 events. 4932/8165 cut-off events. For 17372/17476 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 59259 event pairs, 3246 based on Foata normal form. 43/7059 useless extension candidates. Maximal degree in co-relation 28897. Up to 6663 conditions per place. [2024-01-29 22:54:05,210 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 122 selfloop transitions, 36 changer transitions 0/182 dead transitions. [2024-01-29 22:54:05,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 182 transitions, 1788 flow [2024-01-29 22:54:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2024-01-29 22:54:05,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20150943396226415 [2024-01-29 22:54:05,221 INFO L175 Difference]: Start difference. First operand has 151 places, 155 transitions, 1332 flow. Second operand 5 states and 267 transitions. [2024-01-29 22:54:05,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 182 transitions, 1788 flow [2024-01-29 22:54:05,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 182 transitions, 1745 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:54:05,242 INFO L231 Difference]: Finished difference. Result has 154 places, 155 transitions, 1373 flow [2024-01-29 22:54:05,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1373, PETRI_PLACES=154, PETRI_TRANSITIONS=155} [2024-01-29 22:54:05,242 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -115 predicate places. [2024-01-29 22:54:05,243 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 155 transitions, 1373 flow [2024-01-29 22:54:05,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-01-29 22:54:05,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:05,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:05,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-29 22:54:05,243 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:05,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:05,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1625144174, now seen corresponding path program 1 times [2024-01-29 22:54:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569841617] [2024-01-29 22:54:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:05,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:05,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:05,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569841617] [2024-01-29 22:54:05,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569841617] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:05,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:05,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:54:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170118175] [2024-01-29 22:54:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:05,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:05,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:05,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:05,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:05,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 265 [2024-01-29 22:54:05,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 155 transitions, 1373 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-01-29 22:54:05,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:05,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 265 [2024-01-29 22:54:05,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:06,187 INFO L124 PetriNetUnfolderBase]: 4648/7721 cut-off events. [2024-01-29 22:54:06,187 INFO L125 PetriNetUnfolderBase]: For 18966/19062 co-relation queries the response was YES. [2024-01-29 22:54:06,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27159 conditions, 7721 events. 4648/7721 cut-off events. For 18966/19062 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 55474 event pairs, 2991 based on Foata normal form. 110/6737 useless extension candidates. Maximal degree in co-relation 27105. Up to 6629 conditions per place. [2024-01-29 22:54:06,232 INFO L140 encePairwiseOnDemand]: 254/265 looper letters, 117 selfloop transitions, 33 changer transitions 0/174 dead transitions. [2024-01-29 22:54:06,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 174 transitions, 1761 flow [2024-01-29 22:54:06,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:54:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:54:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2024-01-29 22:54:06,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21320754716981133 [2024-01-29 22:54:06,234 INFO L175 Difference]: Start difference. First operand has 154 places, 155 transitions, 1373 flow. Second operand 4 states and 226 transitions. [2024-01-29 22:54:06,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 174 transitions, 1761 flow [2024-01-29 22:54:06,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 174 transitions, 1642 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-01-29 22:54:06,252 INFO L231 Difference]: Finished difference. Result has 153 places, 155 transitions, 1348 flow [2024-01-29 22:54:06,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1348, PETRI_PLACES=153, PETRI_TRANSITIONS=155} [2024-01-29 22:54:06,252 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -116 predicate places. [2024-01-29 22:54:06,252 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 155 transitions, 1348 flow [2024-01-29 22:54:06,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-01-29 22:54:06,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:06,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:06,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-29 22:54:06,253 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:06,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:06,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1629538907, now seen corresponding path program 1 times [2024-01-29 22:54:06,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:06,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356123803] [2024-01-29 22:54:06,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:06,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:06,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:06,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356123803] [2024-01-29 22:54:06,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356123803] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:06,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:06,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:06,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608702631] [2024-01-29 22:54:06,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:06,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:06,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:06,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:06,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:06,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:06,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 155 transitions, 1348 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:06,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:06,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:06,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:07,307 INFO L124 PetriNetUnfolderBase]: 4213/7581 cut-off events. [2024-01-29 22:54:07,307 INFO L125 PetriNetUnfolderBase]: For 19937/20046 co-relation queries the response was YES. [2024-01-29 22:54:07,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26388 conditions, 7581 events. 4213/7581 cut-off events. For 19937/20046 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 61007 event pairs, 2468 based on Foata normal form. 1200/7817 useless extension candidates. Maximal degree in co-relation 26333. Up to 3235 conditions per place. [2024-01-29 22:54:07,372 INFO L140 encePairwiseOnDemand]: 240/265 looper letters, 193 selfloop transitions, 30 changer transitions 0/247 dead transitions. [2024-01-29 22:54:07,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 247 transitions, 2294 flow [2024-01-29 22:54:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 362 transitions. [2024-01-29 22:54:07,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2732075471698113 [2024-01-29 22:54:07,384 INFO L175 Difference]: Start difference. First operand has 153 places, 155 transitions, 1348 flow. Second operand 5 states and 362 transitions. [2024-01-29 22:54:07,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 247 transitions, 2294 flow [2024-01-29 22:54:07,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 247 transitions, 2225 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:54:07,414 INFO L231 Difference]: Finished difference. Result has 152 places, 152 transitions, 1439 flow [2024-01-29 22:54:07,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1439, PETRI_PLACES=152, PETRI_TRANSITIONS=152} [2024-01-29 22:54:07,415 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -117 predicate places. [2024-01-29 22:54:07,415 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 152 transitions, 1439 flow [2024-01-29 22:54:07,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:07,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:07,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:07,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-29 22:54:07,416 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:07,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:07,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1666451516, now seen corresponding path program 1 times [2024-01-29 22:54:07,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:07,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843659973] [2024-01-29 22:54:07,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:07,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:07,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:07,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843659973] [2024-01-29 22:54:07,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843659973] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:07,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:07,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:07,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136316024] [2024-01-29 22:54:07,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:07,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:07,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:07,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:07,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:07,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:07,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 152 transitions, 1439 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:07,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:07,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:07,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:08,405 INFO L124 PetriNetUnfolderBase]: 3792/6887 cut-off events. [2024-01-29 22:54:08,405 INFO L125 PetriNetUnfolderBase]: For 20528/20630 co-relation queries the response was YES. [2024-01-29 22:54:08,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25676 conditions, 6887 events. 3792/6887 cut-off events. For 20528/20630 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 54879 event pairs, 2238 based on Foata normal form. 265/6275 useless extension candidates. Maximal degree in co-relation 25619. Up to 4926 conditions per place. [2024-01-29 22:54:08,473 INFO L140 encePairwiseOnDemand]: 251/265 looper letters, 216 selfloop transitions, 32 changer transitions 0/272 dead transitions. [2024-01-29 22:54:08,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 272 transitions, 3221 flow [2024-01-29 22:54:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 313 transitions. [2024-01-29 22:54:08,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23622641509433961 [2024-01-29 22:54:08,475 INFO L175 Difference]: Start difference. First operand has 152 places, 152 transitions, 1439 flow. Second operand 5 states and 313 transitions. [2024-01-29 22:54:08,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 272 transitions, 3221 flow [2024-01-29 22:54:08,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 272 transitions, 3160 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-29 22:54:08,516 INFO L231 Difference]: Finished difference. Result has 156 places, 181 transitions, 2079 flow [2024-01-29 22:54:08,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2079, PETRI_PLACES=156, PETRI_TRANSITIONS=181} [2024-01-29 22:54:08,517 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -113 predicate places. [2024-01-29 22:54:08,517 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 181 transitions, 2079 flow [2024-01-29 22:54:08,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:08,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:08,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:08,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-29 22:54:08,518 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:08,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:08,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1666451508, now seen corresponding path program 1 times [2024-01-29 22:54:08,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:08,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536768279] [2024-01-29 22:54:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:08,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536768279] [2024-01-29 22:54:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536768279] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:08,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:08,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:08,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365321263] [2024-01-29 22:54:08,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:08,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:08,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:08,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:08,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:08,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:08,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 181 transitions, 2079 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:08,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:08,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:08,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:09,583 INFO L124 PetriNetUnfolderBase]: 3886/7412 cut-off events. [2024-01-29 22:54:09,583 INFO L125 PetriNetUnfolderBase]: For 28993/29102 co-relation queries the response was YES. [2024-01-29 22:54:09,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28252 conditions, 7412 events. 3886/7412 cut-off events. For 28993/29102 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 63395 event pairs, 2640 based on Foata normal form. 397/7040 useless extension candidates. Maximal degree in co-relation 28192. Up to 4759 conditions per place. [2024-01-29 22:54:09,639 INFO L140 encePairwiseOnDemand]: 240/265 looper letters, 159 selfloop transitions, 69 changer transitions 1/253 dead transitions. [2024-01-29 22:54:09,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 253 transitions, 2910 flow [2024-01-29 22:54:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 328 transitions. [2024-01-29 22:54:09,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24754716981132074 [2024-01-29 22:54:09,640 INFO L175 Difference]: Start difference. First operand has 156 places, 181 transitions, 2079 flow. Second operand 5 states and 328 transitions. [2024-01-29 22:54:09,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 253 transitions, 2910 flow [2024-01-29 22:54:09,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 253 transitions, 2887 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-29 22:54:09,716 INFO L231 Difference]: Finished difference. Result has 158 places, 185 transitions, 2424 flow [2024-01-29 22:54:09,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2424, PETRI_PLACES=158, PETRI_TRANSITIONS=185} [2024-01-29 22:54:09,717 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -111 predicate places. [2024-01-29 22:54:09,717 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 185 transitions, 2424 flow [2024-01-29 22:54:09,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:09,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:09,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:09,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-01-29 22:54:09,717 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:09,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:09,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1849714236, now seen corresponding path program 1 times [2024-01-29 22:54:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975006652] [2024-01-29 22:54:09,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:09,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:09,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:09,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975006652] [2024-01-29 22:54:09,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975006652] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:09,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:09,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:54:09,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354600078] [2024-01-29 22:54:09,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:09,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:54:09,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:09,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:54:09,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:54:09,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:09,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 185 transitions, 2424 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-01-29 22:54:09,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:09,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:09,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:10,696 INFO L124 PetriNetUnfolderBase]: 3788/7166 cut-off events. [2024-01-29 22:54:10,696 INFO L125 PetriNetUnfolderBase]: For 38589/38720 co-relation queries the response was YES. [2024-01-29 22:54:10,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30051 conditions, 7166 events. 3788/7166 cut-off events. For 38589/38720 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 60842 event pairs, 2269 based on Foata normal form. 485/6862 useless extension candidates. Maximal degree in co-relation 29989. Up to 3263 conditions per place. [2024-01-29 22:54:10,766 INFO L140 encePairwiseOnDemand]: 251/265 looper letters, 187 selfloop transitions, 34 changer transitions 0/245 dead transitions. [2024-01-29 22:54:10,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 245 transitions, 3297 flow [2024-01-29 22:54:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:54:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:54:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2024-01-29 22:54:10,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25471698113207547 [2024-01-29 22:54:10,767 INFO L175 Difference]: Start difference. First operand has 158 places, 185 transitions, 2424 flow. Second operand 4 states and 270 transitions. [2024-01-29 22:54:10,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 245 transitions, 3297 flow [2024-01-29 22:54:10,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 245 transitions, 3275 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-29 22:54:10,880 INFO L231 Difference]: Finished difference. Result has 155 places, 179 transitions, 2470 flow [2024-01-29 22:54:10,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=2349, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2470, PETRI_PLACES=155, PETRI_TRANSITIONS=179} [2024-01-29 22:54:10,880 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -114 predicate places. [2024-01-29 22:54:10,880 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 179 transitions, 2470 flow [2024-01-29 22:54:10,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-01-29 22:54:10,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:10,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:10,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-01-29 22:54:10,881 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:10,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1846603351, now seen corresponding path program 1 times [2024-01-29 22:54:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:10,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869403107] [2024-01-29 22:54:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:10,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:10,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:10,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869403107] [2024-01-29 22:54:10,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869403107] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:10,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:10,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:10,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101469229] [2024-01-29 22:54:10,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:10,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:10,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:10,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:10,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:10,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:10,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 179 transitions, 2470 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:10,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:10,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:10,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:11,811 INFO L124 PetriNetUnfolderBase]: 3103/5907 cut-off events. [2024-01-29 22:54:11,811 INFO L125 PetriNetUnfolderBase]: For 36025/36124 co-relation queries the response was YES. [2024-01-29 22:54:11,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24463 conditions, 5907 events. 3103/5907 cut-off events. For 36025/36124 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 48015 event pairs, 1537 based on Foata normal form. 335/5801 useless extension candidates. Maximal degree in co-relation 24399. Up to 3163 conditions per place. [2024-01-29 22:54:11,864 INFO L140 encePairwiseOnDemand]: 245/265 looper letters, 177 selfloop transitions, 39 changer transitions 0/240 dead transitions. [2024-01-29 22:54:11,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 240 transitions, 3214 flow [2024-01-29 22:54:11,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2024-01-29 22:54:11,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23018867924528302 [2024-01-29 22:54:11,866 INFO L175 Difference]: Start difference. First operand has 155 places, 179 transitions, 2470 flow. Second operand 5 states and 305 transitions. [2024-01-29 22:54:11,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 240 transitions, 3214 flow [2024-01-29 22:54:11,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 240 transitions, 3175 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-01-29 22:54:11,944 INFO L231 Difference]: Finished difference. Result has 158 places, 178 transitions, 2560 flow [2024-01-29 22:54:11,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=2415, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2560, PETRI_PLACES=158, PETRI_TRANSITIONS=178} [2024-01-29 22:54:11,944 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -111 predicate places. [2024-01-29 22:54:11,944 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 178 transitions, 2560 flow [2024-01-29 22:54:11,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:11,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:11,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:11,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-01-29 22:54:11,948 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:11,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash -591705860, now seen corresponding path program 1 times [2024-01-29 22:54:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989305401] [2024-01-29 22:54:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:11,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:11,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989305401] [2024-01-29 22:54:11,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989305401] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:11,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:11,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:54:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991757874] [2024-01-29 22:54:11,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:11,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:54:11,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:11,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:54:11,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:54:12,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:54:12,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 178 transitions, 2560 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-01-29 22:54:12,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:12,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:54:12,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:12,778 INFO L124 PetriNetUnfolderBase]: 3043/5851 cut-off events. [2024-01-29 22:54:12,778 INFO L125 PetriNetUnfolderBase]: For 36486/36611 co-relation queries the response was YES. [2024-01-29 22:54:12,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25158 conditions, 5851 events. 3043/5851 cut-off events. For 36486/36611 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 47598 event pairs, 2111 based on Foata normal form. 43/5475 useless extension candidates. Maximal degree in co-relation 25092. Up to 4741 conditions per place. [2024-01-29 22:54:12,829 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 113 selfloop transitions, 57 changer transitions 0/194 dead transitions. [2024-01-29 22:54:12,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 194 transitions, 2982 flow [2024-01-29 22:54:12,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:54:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:54:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2024-01-29 22:54:12,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19245283018867926 [2024-01-29 22:54:12,830 INFO L175 Difference]: Start difference. First operand has 158 places, 178 transitions, 2560 flow. Second operand 4 states and 204 transitions. [2024-01-29 22:54:12,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 194 transitions, 2982 flow [2024-01-29 22:54:12,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 194 transitions, 2924 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-01-29 22:54:12,912 INFO L231 Difference]: Finished difference. Result has 160 places, 178 transitions, 2668 flow [2024-01-29 22:54:12,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=2502, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2668, PETRI_PLACES=160, PETRI_TRANSITIONS=178} [2024-01-29 22:54:12,913 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -109 predicate places. [2024-01-29 22:54:12,913 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 178 transitions, 2668 flow [2024-01-29 22:54:12,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-01-29 22:54:12,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:12,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:12,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-01-29 22:54:12,914 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:12,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1618675590, now seen corresponding path program 1 times [2024-01-29 22:54:12,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:12,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912578852] [2024-01-29 22:54:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:12,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:12,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:12,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912578852] [2024-01-29 22:54:12,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912578852] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:12,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:12,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 22:54:12,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985162825] [2024-01-29 22:54:12,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:12,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:54:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:13,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:54:13,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:54:13,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 265 [2024-01-29 22:54:13,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 178 transitions, 2668 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-29 22:54:13,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:13,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 265 [2024-01-29 22:54:13,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:14,249 INFO L124 PetriNetUnfolderBase]: 4051/7575 cut-off events. [2024-01-29 22:54:14,250 INFO L125 PetriNetUnfolderBase]: For 40910/40910 co-relation queries the response was YES. [2024-01-29 22:54:14,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31442 conditions, 7575 events. 4051/7575 cut-off events. For 40910/40910 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 59763 event pairs, 2089 based on Foata normal form. 14/7111 useless extension candidates. Maximal degree in co-relation 31375. Up to 4076 conditions per place. [2024-01-29 22:54:14,302 INFO L140 encePairwiseOnDemand]: 251/265 looper letters, 201 selfloop transitions, 84 changer transitions 1/294 dead transitions. [2024-01-29 22:54:14,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 294 transitions, 3964 flow [2024-01-29 22:54:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 22:54:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 22:54:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 308 transitions. [2024-01-29 22:54:14,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19371069182389938 [2024-01-29 22:54:14,305 INFO L175 Difference]: Start difference. First operand has 160 places, 178 transitions, 2668 flow. Second operand 6 states and 308 transitions. [2024-01-29 22:54:14,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 294 transitions, 3964 flow [2024-01-29 22:54:14,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 294 transitions, 3852 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:54:14,430 INFO L231 Difference]: Finished difference. Result has 165 places, 195 transitions, 3016 flow [2024-01-29 22:54:14,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3016, PETRI_PLACES=165, PETRI_TRANSITIONS=195} [2024-01-29 22:54:14,431 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -104 predicate places. [2024-01-29 22:54:14,431 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 195 transitions, 3016 flow [2024-01-29 22:54:14,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-29 22:54:14,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:14,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:14,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-01-29 22:54:14,431 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:14,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1660164976, now seen corresponding path program 2 times [2024-01-29 22:54:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:14,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873752193] [2024-01-29 22:54:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:14,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:14,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:14,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873752193] [2024-01-29 22:54:14,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873752193] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:14,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:14,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 22:54:14,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172213634] [2024-01-29 22:54:14,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:14,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:54:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:14,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:54:14,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:54:14,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 265 [2024-01-29 22:54:14,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 195 transitions, 3016 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-29 22:54:14,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:14,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 265 [2024-01-29 22:54:14,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:15,693 INFO L124 PetriNetUnfolderBase]: 4088/7670 cut-off events. [2024-01-29 22:54:15,694 INFO L125 PetriNetUnfolderBase]: For 45332/45332 co-relation queries the response was YES. [2024-01-29 22:54:15,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33735 conditions, 7670 events. 4088/7670 cut-off events. For 45332/45332 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 60627 event pairs, 2132 based on Foata normal form. 14/7200 useless extension candidates. Maximal degree in co-relation 33667. Up to 4076 conditions per place. [2024-01-29 22:54:15,779 INFO L140 encePairwiseOnDemand]: 251/265 looper letters, 183 selfloop transitions, 90 changer transitions 2/283 dead transitions. [2024-01-29 22:54:15,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 283 transitions, 4045 flow [2024-01-29 22:54:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 22:54:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 22:54:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 297 transitions. [2024-01-29 22:54:15,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18679245283018867 [2024-01-29 22:54:15,781 INFO L175 Difference]: Start difference. First operand has 165 places, 195 transitions, 3016 flow. Second operand 6 states and 297 transitions. [2024-01-29 22:54:15,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 283 transitions, 4045 flow [2024-01-29 22:54:15,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 283 transitions, 3974 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-01-29 22:54:15,943 INFO L231 Difference]: Finished difference. Result has 169 places, 200 transitions, 3242 flow [2024-01-29 22:54:15,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=2945, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3242, PETRI_PLACES=169, PETRI_TRANSITIONS=200} [2024-01-29 22:54:15,944 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -100 predicate places. [2024-01-29 22:54:15,944 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 200 transitions, 3242 flow [2024-01-29 22:54:15,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-29 22:54:15,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:15,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:15,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-01-29 22:54:15,944 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:15,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash 215071512, now seen corresponding path program 3 times [2024-01-29 22:54:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:15,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036644683] [2024-01-29 22:54:15,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:15,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:16,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:16,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036644683] [2024-01-29 22:54:16,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036644683] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:16,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:16,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 22:54:16,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047988769] [2024-01-29 22:54:16,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:16,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:54:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:16,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:54:16,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:54:16,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 265 [2024-01-29 22:54:16,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 200 transitions, 3242 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-29 22:54:16,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:16,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 265 [2024-01-29 22:54:16,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:17,458 INFO L124 PetriNetUnfolderBase]: 4953/9466 cut-off events. [2024-01-29 22:54:17,458 INFO L125 PetriNetUnfolderBase]: For 61543/61543 co-relation queries the response was YES. [2024-01-29 22:54:17,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41910 conditions, 9466 events. 4953/9466 cut-off events. For 61543/61543 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 79498 event pairs, 2907 based on Foata normal form. 14/8871 useless extension candidates. Maximal degree in co-relation 41841. Up to 4118 conditions per place. [2024-01-29 22:54:17,556 INFO L140 encePairwiseOnDemand]: 251/265 looper letters, 238 selfloop transitions, 83 changer transitions 1/330 dead transitions. [2024-01-29 22:54:17,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 330 transitions, 4929 flow [2024-01-29 22:54:17,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 22:54:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 22:54:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 315 transitions. [2024-01-29 22:54:17,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19811320754716982 [2024-01-29 22:54:17,557 INFO L175 Difference]: Start difference. First operand has 169 places, 200 transitions, 3242 flow. Second operand 6 states and 315 transitions. [2024-01-29 22:54:17,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 330 transitions, 4929 flow [2024-01-29 22:54:17,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 330 transitions, 4685 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-01-29 22:54:17,779 INFO L231 Difference]: Finished difference. Result has 174 places, 222 transitions, 3692 flow [2024-01-29 22:54:17,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3052, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3692, PETRI_PLACES=174, PETRI_TRANSITIONS=222} [2024-01-29 22:54:17,779 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -95 predicate places. [2024-01-29 22:54:17,779 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 222 transitions, 3692 flow [2024-01-29 22:54:17,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-29 22:54:17,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:17,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:17,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-01-29 22:54:17,780 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting P0Err45ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:17,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1383657962, now seen corresponding path program 1 times [2024-01-29 22:54:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:17,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190658754] [2024-01-29 22:54:17,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:17,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:17,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190658754] [2024-01-29 22:54:17,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190658754] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:17,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:17,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:54:17,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585435279] [2024-01-29 22:54:17,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:17,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:17,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:17,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:17,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:17,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:54:17,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 222 transitions, 3692 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-01-29 22:54:17,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:17,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:54:17,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:19,031 INFO L124 PetriNetUnfolderBase]: 4314/8399 cut-off events. [2024-01-29 22:54:19,032 INFO L125 PetriNetUnfolderBase]: For 67021/67601 co-relation queries the response was YES. [2024-01-29 22:54:19,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39259 conditions, 8399 events. 4314/8399 cut-off events. For 67021/67601 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 73747 event pairs, 2942 based on Foata normal form. 184/7975 useless extension candidates. Maximal degree in co-relation 39186. Up to 7138 conditions per place. [2024-01-29 22:54:19,111 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 150 selfloop transitions, 67 changer transitions 0/247 dead transitions. [2024-01-29 22:54:19,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 247 transitions, 4308 flow [2024-01-29 22:54:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:19,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-01-29 22:54:19,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18264150943396226 [2024-01-29 22:54:19,113 INFO L175 Difference]: Start difference. First operand has 174 places, 222 transitions, 3692 flow. Second operand 5 states and 242 transitions. [2024-01-29 22:54:19,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 247 transitions, 4308 flow [2024-01-29 22:54:19,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 247 transitions, 4286 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:54:19,329 INFO L231 Difference]: Finished difference. Result has 178 places, 226 transitions, 3888 flow [2024-01-29 22:54:19,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3670, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3888, PETRI_PLACES=178, PETRI_TRANSITIONS=226} [2024-01-29 22:54:19,329 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -91 predicate places. [2024-01-29 22:54:19,329 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 226 transitions, 3888 flow [2024-01-29 22:54:19,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-01-29 22:54:19,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:19,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:19,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-01-29 22:54:19,330 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting P0Err45ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:19,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2090600064, now seen corresponding path program 2 times [2024-01-29 22:54:19,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:19,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402177771] [2024-01-29 22:54:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:19,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:19,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402177771] [2024-01-29 22:54:19,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402177771] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:19,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:19,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:54:19,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948008319] [2024-01-29 22:54:19,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:19,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:19,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:19,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:19,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:19,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:54:19,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 226 transitions, 3888 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-01-29 22:54:19,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:19,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:54:19,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:20,508 INFO L124 PetriNetUnfolderBase]: 4266/8302 cut-off events. [2024-01-29 22:54:20,508 INFO L125 PetriNetUnfolderBase]: For 72492/73054 co-relation queries the response was YES. [2024-01-29 22:54:20,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39347 conditions, 8302 events. 4266/8302 cut-off events. For 72492/73054 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 72884 event pairs, 3014 based on Foata normal form. 184/7854 useless extension candidates. Maximal degree in co-relation 39272. Up to 7132 conditions per place. [2024-01-29 22:54:20,583 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 162 selfloop transitions, 53 changer transitions 0/245 dead transitions. [2024-01-29 22:54:20,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 245 transitions, 4404 flow [2024-01-29 22:54:20,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2024-01-29 22:54:20,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17962264150943397 [2024-01-29 22:54:20,584 INFO L175 Difference]: Start difference. First operand has 178 places, 226 transitions, 3888 flow. Second operand 5 states and 238 transitions. [2024-01-29 22:54:20,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 245 transitions, 4404 flow [2024-01-29 22:54:20,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 245 transitions, 4282 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:54:20,806 INFO L231 Difference]: Finished difference. Result has 180 places, 226 transitions, 3884 flow [2024-01-29 22:54:20,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3884, PETRI_PLACES=180, PETRI_TRANSITIONS=226} [2024-01-29 22:54:20,806 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -89 predicate places. [2024-01-29 22:54:20,807 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 226 transitions, 3884 flow [2024-01-29 22:54:20,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-01-29 22:54:20,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:20,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:20,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-01-29 22:54:20,807 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting P1Err45ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:20,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash 984743296, now seen corresponding path program 1 times [2024-01-29 22:54:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:20,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769321403] [2024-01-29 22:54:20,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:20,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:20,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:20,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769321403] [2024-01-29 22:54:20,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769321403] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:20,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:20,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:54:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072906590] [2024-01-29 22:54:20,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:20,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:20,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:20,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:20,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:20,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 265 [2024-01-29 22:54:20,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 226 transitions, 3884 flow. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 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-01-29 22:54:20,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:20,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 265 [2024-01-29 22:54:20,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:22,002 INFO L124 PetriNetUnfolderBase]: 4189/8148 cut-off events. [2024-01-29 22:54:22,002 INFO L125 PetriNetUnfolderBase]: For 72112/72674 co-relation queries the response was YES. [2024-01-29 22:54:22,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38961 conditions, 8148 events. 4189/8148 cut-off events. For 72112/72674 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 71221 event pairs, 2951 based on Foata normal form. 190/7742 useless extension candidates. Maximal degree in co-relation 38885. Up to 7023 conditions per place. [2024-01-29 22:54:22,100 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 147 selfloop transitions, 61 changer transitions 0/238 dead transitions. [2024-01-29 22:54:22,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 238 transitions, 4348 flow [2024-01-29 22:54:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:54:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:54:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2024-01-29 22:54:22,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18490566037735848 [2024-01-29 22:54:22,101 INFO L175 Difference]: Start difference. First operand has 180 places, 226 transitions, 3884 flow. Second operand 4 states and 196 transitions. [2024-01-29 22:54:22,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 238 transitions, 4348 flow [2024-01-29 22:54:22,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 238 transitions, 4170 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-01-29 22:54:22,351 INFO L231 Difference]: Finished difference. Result has 179 places, 226 transitions, 3884 flow [2024-01-29 22:54:22,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3706, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3884, PETRI_PLACES=179, PETRI_TRANSITIONS=226} [2024-01-29 22:54:22,351 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -90 predicate places. [2024-01-29 22:54:22,351 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 226 transitions, 3884 flow [2024-01-29 22:54:22,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 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-01-29 22:54:22,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:22,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:22,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-01-29 22:54:22,352 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:22,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:22,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1867212150, now seen corresponding path program 4 times [2024-01-29 22:54:22,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:22,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418434509] [2024-01-29 22:54:22,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:22,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:22,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:22,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418434509] [2024-01-29 22:54:22,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418434509] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:22,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:22,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 22:54:22,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320739589] [2024-01-29 22:54:22,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:22,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:54:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:54:22,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:54:22,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 265 [2024-01-29 22:54:22,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 226 transitions, 3884 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-29 22:54:22,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:22,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 265 [2024-01-29 22:54:22,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:23,878 INFO L124 PetriNetUnfolderBase]: 5252/9891 cut-off events. [2024-01-29 22:54:23,878 INFO L125 PetriNetUnfolderBase]: For 72379/72379 co-relation queries the response was YES. [2024-01-29 22:54:23,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45746 conditions, 9891 events. 5252/9891 cut-off events. For 72379/72379 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 82419 event pairs, 3326 based on Foata normal form. 14/9298 useless extension candidates. Maximal degree in co-relation 45669. Up to 5015 conditions per place. [2024-01-29 22:54:23,970 INFO L140 encePairwiseOnDemand]: 257/265 looper letters, 228 selfloop transitions, 68 changer transitions 1/305 dead transitions. [2024-01-29 22:54:23,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 305 transitions, 4962 flow [2024-01-29 22:54:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 22:54:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 22:54:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 279 transitions. [2024-01-29 22:54:23,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17547169811320754 [2024-01-29 22:54:23,971 INFO L175 Difference]: Start difference. First operand has 179 places, 226 transitions, 3884 flow. Second operand 6 states and 279 transitions. [2024-01-29 22:54:23,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 305 transitions, 4962 flow [2024-01-29 22:54:24,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 305 transitions, 4689 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-01-29 22:54:24,267 INFO L231 Difference]: Finished difference. Result has 174 places, 229 transitions, 3839 flow [2024-01-29 22:54:24,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3598, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3839, PETRI_PLACES=174, PETRI_TRANSITIONS=229} [2024-01-29 22:54:24,268 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -95 predicate places. [2024-01-29 22:54:24,268 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 229 transitions, 3839 flow [2024-01-29 22:54:24,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-29 22:54:24,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:24,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:24,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-01-29 22:54:24,268 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:24,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash 301099596, now seen corresponding path program 1 times [2024-01-29 22:54:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:24,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627478519] [2024-01-29 22:54:24,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627478519] [2024-01-29 22:54:24,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627478519] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:24,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:24,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496556866] [2024-01-29 22:54:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:24,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:24,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:24,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:24,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:24,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:24,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 229 transitions, 3839 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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-01-29 22:54:24,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:24,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:24,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:25,490 INFO L124 PetriNetUnfolderBase]: 4398/8615 cut-off events. [2024-01-29 22:54:25,491 INFO L125 PetriNetUnfolderBase]: For 73945/74417 co-relation queries the response was YES. [2024-01-29 22:54:25,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40575 conditions, 8615 events. 4398/8615 cut-off events. For 73945/74417 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 76020 event pairs, 3059 based on Foata normal form. 186/8146 useless extension candidates. Maximal degree in co-relation 40505. Up to 6559 conditions per place. [2024-01-29 22:54:25,568 INFO L140 encePairwiseOnDemand]: 253/265 looper letters, 245 selfloop transitions, 43 changer transitions 0/318 dead transitions. [2024-01-29 22:54:25,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 318 transitions, 5464 flow [2024-01-29 22:54:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2024-01-29 22:54:25,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1969811320754717 [2024-01-29 22:54:25,570 INFO L175 Difference]: Start difference. First operand has 174 places, 229 transitions, 3839 flow. Second operand 5 states and 261 transitions. [2024-01-29 22:54:25,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 318 transitions, 5464 flow [2024-01-29 22:54:25,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 318 transitions, 5346 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:54:25,763 INFO L231 Difference]: Finished difference. Result has 177 places, 263 transitions, 4407 flow [2024-01-29 22:54:25,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3723, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4407, PETRI_PLACES=177, PETRI_TRANSITIONS=263} [2024-01-29 22:54:25,764 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -92 predicate places. [2024-01-29 22:54:25,764 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 263 transitions, 4407 flow [2024-01-29 22:54:25,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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-01-29 22:54:25,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:25,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:25,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-01-29 22:54:25,764 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:25,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2543890, now seen corresponding path program 1 times [2024-01-29 22:54:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:25,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947064882] [2024-01-29 22:54:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:25,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:25,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947064882] [2024-01-29 22:54:25,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947064882] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:25,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:25,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 22:54:25,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824091363] [2024-01-29 22:54:25,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:25,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:54:25,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:25,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:54:25,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:54:25,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:25,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 263 transitions, 4407 flow. Second operand has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 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-01-29 22:54:25,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:25,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:25,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:26,847 INFO L124 PetriNetUnfolderBase]: 2922/5923 cut-off events. [2024-01-29 22:54:26,847 INFO L125 PetriNetUnfolderBase]: For 66039/66502 co-relation queries the response was YES. [2024-01-29 22:54:26,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30345 conditions, 5923 events. 2922/5923 cut-off events. For 66039/66502 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 50002 event pairs, 893 based on Foata normal form. 875/6557 useless extension candidates. Maximal degree in co-relation 30271. Up to 1819 conditions per place. [2024-01-29 22:54:26,900 INFO L140 encePairwiseOnDemand]: 249/265 looper letters, 207 selfloop transitions, 92 changer transitions 1/330 dead transitions. [2024-01-29 22:54:26,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 330 transitions, 5661 flow [2024-01-29 22:54:26,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 22:54:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 22:54:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 322 transitions. [2024-01-29 22:54:26,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20251572327044026 [2024-01-29 22:54:26,901 INFO L175 Difference]: Start difference. First operand has 177 places, 263 transitions, 4407 flow. Second operand 6 states and 322 transitions. [2024-01-29 22:54:26,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 330 transitions, 5661 flow [2024-01-29 22:54:27,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 330 transitions, 5649 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-29 22:54:27,044 INFO L231 Difference]: Finished difference. Result has 173 places, 256 transitions, 4683 flow [2024-01-29 22:54:27,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=4268, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4683, PETRI_PLACES=173, PETRI_TRANSITIONS=256} [2024-01-29 22:54:27,045 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -96 predicate places. [2024-01-29 22:54:27,045 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 256 transitions, 4683 flow [2024-01-29 22:54:27,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 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-01-29 22:54:27,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:27,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:27,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-01-29 22:54:27,046 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:27,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash -326756252, now seen corresponding path program 1 times [2024-01-29 22:54:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:27,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368771952] [2024-01-29 22:54:27,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:27,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:27,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368771952] [2024-01-29 22:54:27,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368771952] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:27,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:27,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:54:27,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39348634] [2024-01-29 22:54:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:27,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:54:27,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:27,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:54:27,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:54:27,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:27,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 256 transitions, 4683 flow. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-01-29 22:54:27,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:27,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:27,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:27,950 INFO L124 PetriNetUnfolderBase]: 2864/5799 cut-off events. [2024-01-29 22:54:27,950 INFO L125 PetriNetUnfolderBase]: For 68278/68678 co-relation queries the response was YES. [2024-01-29 22:54:27,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30291 conditions, 5799 events. 2864/5799 cut-off events. For 68278/68678 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 48300 event pairs, 1293 based on Foata normal form. 165/5702 useless extension candidates. Maximal degree in co-relation 30214. Up to 3768 conditions per place. [2024-01-29 22:54:28,014 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 208 selfloop transitions, 56 changer transitions 0/294 dead transitions. [2024-01-29 22:54:28,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 294 transitions, 5508 flow [2024-01-29 22:54:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:54:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:54:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2024-01-29 22:54:28,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19622641509433963 [2024-01-29 22:54:28,015 INFO L175 Difference]: Start difference. First operand has 173 places, 256 transitions, 4683 flow. Second operand 4 states and 208 transitions. [2024-01-29 22:54:28,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 294 transitions, 5508 flow [2024-01-29 22:54:28,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 294 transitions, 5453 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-01-29 22:54:28,203 INFO L231 Difference]: Finished difference. Result has 175 places, 256 transitions, 4812 flow [2024-01-29 22:54:28,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=4616, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4812, PETRI_PLACES=175, PETRI_TRANSITIONS=256} [2024-01-29 22:54:28,204 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -94 predicate places. [2024-01-29 22:54:28,204 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 256 transitions, 4812 flow [2024-01-29 22:54:28,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-01-29 22:54:28,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:28,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:28,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-01-29 22:54:28,205 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:28,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash 418836549, now seen corresponding path program 1 times [2024-01-29 22:54:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:28,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398903290] [2024-01-29 22:54:28,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:28,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:28,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398903290] [2024-01-29 22:54:28,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398903290] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:28,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:28,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:28,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928243889] [2024-01-29 22:54:28,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:28,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:28,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:28,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:28,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:28,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:28,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 256 transitions, 4812 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:28,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:28,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:28,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:29,087 INFO L124 PetriNetUnfolderBase]: 2604/5318 cut-off events. [2024-01-29 22:54:29,087 INFO L125 PetriNetUnfolderBase]: For 70212/70549 co-relation queries the response was YES. [2024-01-29 22:54:29,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27699 conditions, 5318 events. 2604/5318 cut-off events. For 70212/70549 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 43807 event pairs, 1357 based on Foata normal form. 228/5393 useless extension candidates. Maximal degree in co-relation 27621. Up to 2835 conditions per place. [2024-01-29 22:54:29,130 INFO L140 encePairwiseOnDemand]: 251/265 looper letters, 189 selfloop transitions, 67 changer transitions 0/286 dead transitions. [2024-01-29 22:54:29,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 286 transitions, 5472 flow [2024-01-29 22:54:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2024-01-29 22:54:29,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18566037735849056 [2024-01-29 22:54:29,132 INFO L175 Difference]: Start difference. First operand has 175 places, 256 transitions, 4812 flow. Second operand 5 states and 246 transitions. [2024-01-29 22:54:29,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 286 transitions, 5472 flow [2024-01-29 22:54:29,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 286 transitions, 5292 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-01-29 22:54:29,266 INFO L231 Difference]: Finished difference. Result has 168 places, 249 transitions, 4744 flow [2024-01-29 22:54:29,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=4506, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4744, PETRI_PLACES=168, PETRI_TRANSITIONS=249} [2024-01-29 22:54:29,267 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -101 predicate places. [2024-01-29 22:54:29,267 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 249 transitions, 4744 flow [2024-01-29 22:54:29,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:29,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:29,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:29,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-01-29 22:54:29,267 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:29,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash -78857681, now seen corresponding path program 1 times [2024-01-29 22:54:29,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:29,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075213978] [2024-01-29 22:54:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:29,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:29,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:29,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075213978] [2024-01-29 22:54:29,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075213978] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:29,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:29,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:54:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240596581] [2024-01-29 22:54:29,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:29,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:54:29,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:29,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:54:29,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:54:29,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:54:29,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 249 transitions, 4744 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-01-29 22:54:29,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:29,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:54:29,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:30,152 INFO L124 PetriNetUnfolderBase]: 2669/5620 cut-off events. [2024-01-29 22:54:30,152 INFO L125 PetriNetUnfolderBase]: For 74237/74708 co-relation queries the response was YES. [2024-01-29 22:54:30,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29370 conditions, 5620 events. 2669/5620 cut-off events. For 74237/74708 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 48175 event pairs, 749 based on Foata normal form. 345/5825 useless extension candidates. Maximal degree in co-relation 29293. Up to 3208 conditions per place. [2024-01-29 22:54:30,195 INFO L140 encePairwiseOnDemand]: 260/265 looper letters, 221 selfloop transitions, 45 changer transitions 12/308 dead transitions. [2024-01-29 22:54:30,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 308 transitions, 6105 flow [2024-01-29 22:54:30,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:54:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:54:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2024-01-29 22:54:30,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17452830188679244 [2024-01-29 22:54:30,197 INFO L175 Difference]: Start difference. First operand has 168 places, 249 transitions, 4744 flow. Second operand 4 states and 185 transitions. [2024-01-29 22:54:30,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 308 transitions, 6105 flow [2024-01-29 22:54:30,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 308 transitions, 6007 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-01-29 22:54:30,364 INFO L231 Difference]: Finished difference. Result has 169 places, 248 transitions, 4684 flow [2024-01-29 22:54:30,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=4668, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4684, PETRI_PLACES=169, PETRI_TRANSITIONS=248} [2024-01-29 22:54:30,364 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -100 predicate places. [2024-01-29 22:54:30,365 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 248 transitions, 4684 flow [2024-01-29 22:54:30,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-01-29 22:54:30,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:30,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:30,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-01-29 22:54:30,365 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:30,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1157619263, now seen corresponding path program 2 times [2024-01-29 22:54:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:30,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320852554] [2024-01-29 22:54:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:30,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:30,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:30,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320852554] [2024-01-29 22:54:30,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320852554] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:30,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:30,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:30,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693423056] [2024-01-29 22:54:30,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:30,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:30,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:30,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:30,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 265 [2024-01-29 22:54:30,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 248 transitions, 4684 flow. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-01-29 22:54:30,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:30,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 265 [2024-01-29 22:54:30,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:30,906 INFO L124 PetriNetUnfolderBase]: 1276/2885 cut-off events. [2024-01-29 22:54:30,906 INFO L125 PetriNetUnfolderBase]: For 52323/52500 co-relation queries the response was YES. [2024-01-29 22:54:30,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17710 conditions, 2885 events. 1276/2885 cut-off events. For 52323/52500 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 22405 event pairs, 384 based on Foata normal form. 245/3043 useless extension candidates. Maximal degree in co-relation 17632. Up to 1392 conditions per place. [2024-01-29 22:54:30,924 INFO L140 encePairwiseOnDemand]: 260/265 looper letters, 152 selfloop transitions, 54 changer transitions 9/245 dead transitions. [2024-01-29 22:54:30,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 245 transitions, 4896 flow [2024-01-29 22:54:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2024-01-29 22:54:30,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.150188679245283 [2024-01-29 22:54:30,925 INFO L175 Difference]: Start difference. First operand has 169 places, 248 transitions, 4684 flow. Second operand 5 states and 199 transitions. [2024-01-29 22:54:30,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 245 transitions, 4896 flow [2024-01-29 22:54:31,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 245 transitions, 4578 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-01-29 22:54:31,024 INFO L231 Difference]: Finished difference. Result has 161 places, 224 transitions, 4122 flow [2024-01-29 22:54:31,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=4062, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4122, PETRI_PLACES=161, PETRI_TRANSITIONS=224} [2024-01-29 22:54:31,025 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -108 predicate places. [2024-01-29 22:54:31,025 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 224 transitions, 4122 flow [2024-01-29 22:54:31,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-01-29 22:54:31,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:31,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:31,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-01-29 22:54:31,025 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting P1Err23ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:31,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:31,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1597339594, now seen corresponding path program 1 times [2024-01-29 22:54:31,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:31,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125343234] [2024-01-29 22:54:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:31,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:31,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125343234] [2024-01-29 22:54:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125343234] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:31,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:31,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:31,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455166506] [2024-01-29 22:54:31,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:31,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:31,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:31,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:31,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:31,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 224 transitions, 4122 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:31,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:31,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:31,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:31,521 INFO L124 PetriNetUnfolderBase]: 1235/2830 cut-off events. [2024-01-29 22:54:31,521 INFO L125 PetriNetUnfolderBase]: For 48272/48442 co-relation queries the response was YES. [2024-01-29 22:54:31,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17078 conditions, 2830 events. 1235/2830 cut-off events. For 48272/48442 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 21919 event pairs, 476 based on Foata normal form. 53/2834 useless extension candidates. Maximal degree in co-relation 17002. Up to 1317 conditions per place. [2024-01-29 22:54:31,540 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 148 selfloop transitions, 75 changer transitions 0/253 dead transitions. [2024-01-29 22:54:31,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 253 transitions, 4803 flow [2024-01-29 22:54:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2024-01-29 22:54:31,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.16226415094339622 [2024-01-29 22:54:31,542 INFO L175 Difference]: Start difference. First operand has 161 places, 224 transitions, 4122 flow. Second operand 5 states and 215 transitions. [2024-01-29 22:54:31,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 253 transitions, 4803 flow [2024-01-29 22:54:31,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 253 transitions, 4569 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-01-29 22:54:31,657 INFO L231 Difference]: Finished difference. Result has 160 places, 228 transitions, 4118 flow [2024-01-29 22:54:31,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3896, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4118, PETRI_PLACES=160, PETRI_TRANSITIONS=228} [2024-01-29 22:54:31,658 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -109 predicate places. [2024-01-29 22:54:31,658 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 228 transitions, 4118 flow [2024-01-29 22:54:31,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:31,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:31,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:31,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-01-29 22:54:31,659 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting P1Err23ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:31,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -29760900, now seen corresponding path program 2 times [2024-01-29 22:54:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:31,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767012462] [2024-01-29 22:54:31,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:31,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:31,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:31,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767012462] [2024-01-29 22:54:31,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767012462] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:31,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:31,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:31,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929576698] [2024-01-29 22:54:31,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:31,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:31,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:31,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:31,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:31,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:31,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 228 transitions, 4118 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:31,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:31,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:31,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:32,152 INFO L124 PetriNetUnfolderBase]: 1233/2848 cut-off events. [2024-01-29 22:54:32,152 INFO L125 PetriNetUnfolderBase]: For 45204/45374 co-relation queries the response was YES. [2024-01-29 22:54:32,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16913 conditions, 2848 events. 1233/2848 cut-off events. For 45204/45374 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22228 event pairs, 479 based on Foata normal form. 53/2852 useless extension candidates. Maximal degree in co-relation 16838. Up to 954 conditions per place. [2024-01-29 22:54:32,173 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 143 selfloop transitions, 88 changer transitions 0/261 dead transitions. [2024-01-29 22:54:32,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 261 transitions, 4865 flow [2024-01-29 22:54:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2024-01-29 22:54:32,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.16830188679245284 [2024-01-29 22:54:32,174 INFO L175 Difference]: Start difference. First operand has 160 places, 228 transitions, 4118 flow. Second operand 5 states and 223 transitions. [2024-01-29 22:54:32,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 261 transitions, 4865 flow [2024-01-29 22:54:32,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 261 transitions, 4676 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-01-29 22:54:32,319 INFO L231 Difference]: Finished difference. Result has 159 places, 228 transitions, 4175 flow [2024-01-29 22:54:32,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3917, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4175, PETRI_PLACES=159, PETRI_TRANSITIONS=228} [2024-01-29 22:54:32,320 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -110 predicate places. [2024-01-29 22:54:32,320 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 228 transitions, 4175 flow [2024-01-29 22:54:32,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:32,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:32,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:54:32,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-01-29 22:54:32,321 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting P0Err23ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:32,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:32,321 INFO L85 PathProgramCache]: Analyzing trace with hash -23788154, now seen corresponding path program 1 times [2024-01-29 22:54:32,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:32,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724533956] [2024-01-29 22:54:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:32,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:32,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:32,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724533956] [2024-01-29 22:54:32,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724533956] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:32,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:32,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:32,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63118611] [2024-01-29 22:54:32,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:32,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:32,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:32,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:32,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:32,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 228 transitions, 4175 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:32,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:32,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:32,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:32,791 INFO L124 PetriNetUnfolderBase]: 1183/2685 cut-off events. [2024-01-29 22:54:32,792 INFO L125 PetriNetUnfolderBase]: For 46210/46399 co-relation queries the response was YES. [2024-01-29 22:54:32,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16676 conditions, 2685 events. 1183/2685 cut-off events. For 46210/46399 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 20815 event pairs, 576 based on Foata normal form. 113/2678 useless extension candidates. Maximal degree in co-relation 16602. Up to 1744 conditions per place. [2024-01-29 22:54:32,810 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 171 selfloop transitions, 44 changer transitions 1/246 dead transitions. [2024-01-29 22:54:32,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 246 transitions, 4729 flow [2024-01-29 22:54:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2024-01-29 22:54:32,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.15924528301886792 [2024-01-29 22:54:32,811 INFO L175 Difference]: Start difference. First operand has 159 places, 228 transitions, 4175 flow. Second operand 5 states and 211 transitions. [2024-01-29 22:54:32,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 246 transitions, 4729 flow [2024-01-29 22:54:32,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 246 transitions, 4534 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-01-29 22:54:32,925 INFO L231 Difference]: Finished difference. Result has 158 places, 226 transitions, 4057 flow [2024-01-29 22:54:32,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3974, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4057, PETRI_PLACES=158, PETRI_TRANSITIONS=226} [2024-01-29 22:54:32,925 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -111 predicate places. [2024-01-29 22:54:32,926 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 226 transitions, 4057 flow [2024-01-29 22:54:32,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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-01-29 22:54:32,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:32,926 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-01-29 22:54:32,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-01-29 22:54:32,926 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:32,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:32,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1167731032, now seen corresponding path program 1 times [2024-01-29 22:54:32,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:32,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773414992] [2024-01-29 22:54:32,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:32,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:32,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:32,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773414992] [2024-01-29 22:54:32,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773414992] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:32,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:32,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:54:32,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777015287] [2024-01-29 22:54:32,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:32,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:54:32,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:32,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:54:32,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:54:32,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:32,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 226 transitions, 4057 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-01-29 22:54:32,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:32,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:32,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:33,355 INFO L124 PetriNetUnfolderBase]: 1156/2635 cut-off events. [2024-01-29 22:54:33,355 INFO L125 PetriNetUnfolderBase]: For 45590/45769 co-relation queries the response was YES. [2024-01-29 22:54:33,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15713 conditions, 2635 events. 1156/2635 cut-off events. For 45590/45769 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20070 event pairs, 456 based on Foata normal form. 73/2621 useless extension candidates. Maximal degree in co-relation 15639. Up to 1333 conditions per place. [2024-01-29 22:54:33,373 INFO L140 encePairwiseOnDemand]: 261/265 looper letters, 170 selfloop transitions, 41 changer transitions 0/241 dead transitions. [2024-01-29 22:54:33,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 241 transitions, 4564 flow [2024-01-29 22:54:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:54:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:54:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2024-01-29 22:54:33,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1641509433962264 [2024-01-29 22:54:33,374 INFO L175 Difference]: Start difference. First operand has 158 places, 226 transitions, 4057 flow. Second operand 4 states and 174 transitions. [2024-01-29 22:54:33,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 241 transitions, 4564 flow [2024-01-29 22:54:33,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 241 transitions, 4330 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-01-29 22:54:33,476 INFO L231 Difference]: Finished difference. Result has 150 places, 225 transitions, 3889 flow [2024-01-29 22:54:33,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3807, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3889, PETRI_PLACES=150, PETRI_TRANSITIONS=225} [2024-01-29 22:54:33,477 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -119 predicate places. [2024-01-29 22:54:33,477 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 225 transitions, 3889 flow [2024-01-29 22:54:33,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-01-29 22:54:33,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:33,477 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-01-29 22:54:33,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-01-29 22:54:33,478 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting P1Err45ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:33,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:33,478 INFO L85 PathProgramCache]: Analyzing trace with hash -719708050, now seen corresponding path program 1 times [2024-01-29 22:54:33,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:33,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358425108] [2024-01-29 22:54:33,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:33,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:33,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:33,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358425108] [2024-01-29 22:54:33,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358425108] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:33,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:33,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:33,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606853171] [2024-01-29 22:54:33,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:33,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:33,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:33,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:33,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:33,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:33,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 225 transitions, 3889 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:33,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:33,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:33,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:33,956 INFO L124 PetriNetUnfolderBase]: 1148/2619 cut-off events. [2024-01-29 22:54:33,956 INFO L125 PetriNetUnfolderBase]: For 42448/42627 co-relation queries the response was YES. [2024-01-29 22:54:33,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15322 conditions, 2619 events. 1148/2619 cut-off events. For 42448/42627 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 19961 event pairs, 442 based on Foata normal form. 45/2577 useless extension candidates. Maximal degree in co-relation 15255. Up to 1623 conditions per place. [2024-01-29 22:54:33,973 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 165 selfloop transitions, 46 changer transitions 0/241 dead transitions. [2024-01-29 22:54:33,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 241 transitions, 4405 flow [2024-01-29 22:54:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2024-01-29 22:54:33,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.15471698113207547 [2024-01-29 22:54:33,974 INFO L175 Difference]: Start difference. First operand has 150 places, 225 transitions, 3889 flow. Second operand 5 states and 205 transitions. [2024-01-29 22:54:33,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 241 transitions, 4405 flow [2024-01-29 22:54:34,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 241 transitions, 4211 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-01-29 22:54:34,065 INFO L231 Difference]: Finished difference. Result has 148 places, 224 transitions, 3777 flow [2024-01-29 22:54:34,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3685, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3777, PETRI_PLACES=148, PETRI_TRANSITIONS=224} [2024-01-29 22:54:34,066 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -121 predicate places. [2024-01-29 22:54:34,066 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 224 transitions, 3777 flow [2024-01-29 22:54:34,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:34,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:34,066 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-01-29 22:54:34,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-01-29 22:54:34,066 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting P0Err45ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:34,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:34,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1589885786, now seen corresponding path program 1 times [2024-01-29 22:54:34,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:34,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248494817] [2024-01-29 22:54:34,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:34,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248494817] [2024-01-29 22:54:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248494817] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:34,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:34,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383183224] [2024-01-29 22:54:34,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:34,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:34,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:34,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:34,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:34,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 224 transitions, 3777 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:34,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:34,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:34,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:34,567 INFO L124 PetriNetUnfolderBase]: 1200/2753 cut-off events. [2024-01-29 22:54:34,567 INFO L125 PetriNetUnfolderBase]: For 40285/40504 co-relation queries the response was YES. [2024-01-29 22:54:34,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15591 conditions, 2753 events. 1200/2753 cut-off events. For 40285/40504 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 21280 event pairs, 425 based on Foata normal form. 61/2746 useless extension candidates. Maximal degree in co-relation 15526. Up to 1476 conditions per place. [2024-01-29 22:54:34,584 INFO L140 encePairwiseOnDemand]: 257/265 looper letters, 150 selfloop transitions, 63 changer transitions 10/253 dead transitions. [2024-01-29 22:54:34,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 253 transitions, 4414 flow [2024-01-29 22:54:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2024-01-29 22:54:34,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1630188679245283 [2024-01-29 22:54:34,585 INFO L175 Difference]: Start difference. First operand has 148 places, 224 transitions, 3777 flow. Second operand 5 states and 216 transitions. [2024-01-29 22:54:34,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 253 transitions, 4414 flow [2024-01-29 22:54:34,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 253 transitions, 4285 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-29 22:54:34,676 INFO L231 Difference]: Finished difference. Result has 149 places, 216 transitions, 3622 flow [2024-01-29 22:54:34,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3648, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3622, PETRI_PLACES=149, PETRI_TRANSITIONS=216} [2024-01-29 22:54:34,677 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -120 predicate places. [2024-01-29 22:54:34,677 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 216 transitions, 3622 flow [2024-01-29 22:54:34,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:34,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:34,677 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-01-29 22:54:34,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-01-29 22:54:34,677 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting P0Err45ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:34,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1415912000, now seen corresponding path program 2 times [2024-01-29 22:54:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:34,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407773620] [2024-01-29 22:54:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:34,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:34,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407773620] [2024-01-29 22:54:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407773620] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:34,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:34,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522072442] [2024-01-29 22:54:34,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:34,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:34,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:34,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:34,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:34,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 216 transitions, 3622 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:34,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:34,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:34,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:35,122 INFO L124 PetriNetUnfolderBase]: 1157/2641 cut-off events. [2024-01-29 22:54:35,123 INFO L125 PetriNetUnfolderBase]: For 38466/38689 co-relation queries the response was YES. [2024-01-29 22:54:35,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15157 conditions, 2641 events. 1157/2641 cut-off events. For 38466/38689 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 20330 event pairs, 527 based on Foata normal form. 74/2613 useless extension candidates. Maximal degree in co-relation 15093. Up to 1380 conditions per place. [2024-01-29 22:54:35,140 INFO L140 encePairwiseOnDemand]: 257/265 looper letters, 156 selfloop transitions, 52 changer transitions 7/245 dead transitions. [2024-01-29 22:54:35,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 245 transitions, 4260 flow [2024-01-29 22:54:35,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2024-01-29 22:54:35,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.16226415094339622 [2024-01-29 22:54:35,141 INFO L175 Difference]: Start difference. First operand has 149 places, 216 transitions, 3622 flow. Second operand 5 states and 215 transitions. [2024-01-29 22:54:35,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 245 transitions, 4260 flow [2024-01-29 22:54:35,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 245 transitions, 4133 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-29 22:54:35,216 INFO L231 Difference]: Finished difference. Result has 151 places, 211 transitions, 3546 flow [2024-01-29 22:54:35,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3495, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3546, PETRI_PLACES=151, PETRI_TRANSITIONS=211} [2024-01-29 22:54:35,216 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -118 predicate places. [2024-01-29 22:54:35,216 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 211 transitions, 3546 flow [2024-01-29 22:54:35,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:35,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:35,216 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-01-29 22:54:35,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-01-29 22:54:35,217 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting P0Err45ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:35,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:35,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1167726458, now seen corresponding path program 3 times [2024-01-29 22:54:35,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:35,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542534533] [2024-01-29 22:54:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:35,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:35,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542534533] [2024-01-29 22:54:35,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542534533] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:35,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:35,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471286238] [2024-01-29 22:54:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:35,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:35,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:35,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:35,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 211 transitions, 3546 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:35,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:35,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:35,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:35,673 INFO L124 PetriNetUnfolderBase]: 1099/2519 cut-off events. [2024-01-29 22:54:35,673 INFO L125 PetriNetUnfolderBase]: For 36836/37017 co-relation queries the response was YES. [2024-01-29 22:54:35,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14603 conditions, 2519 events. 1099/2519 cut-off events. For 36836/37017 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 19131 event pairs, 503 based on Foata normal form. 66/2483 useless extension candidates. Maximal degree in co-relation 14539. Up to 1380 conditions per place. [2024-01-29 22:54:35,690 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 144 selfloop transitions, 53 changer transitions 6/233 dead transitions. [2024-01-29 22:54:35,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 233 transitions, 4070 flow [2024-01-29 22:54:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2024-01-29 22:54:35,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.16 [2024-01-29 22:54:35,692 INFO L175 Difference]: Start difference. First operand has 151 places, 211 transitions, 3546 flow. Second operand 5 states and 212 transitions. [2024-01-29 22:54:35,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 233 transitions, 4070 flow [2024-01-29 22:54:35,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 233 transitions, 3918 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-01-29 22:54:35,771 INFO L231 Difference]: Finished difference. Result has 153 places, 205 transitions, 3401 flow [2024-01-29 22:54:35,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3394, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3401, PETRI_PLACES=153, PETRI_TRANSITIONS=205} [2024-01-29 22:54:35,771 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -116 predicate places. [2024-01-29 22:54:35,771 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 205 transitions, 3401 flow [2024-01-29 22:54:35,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:35,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:35,771 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-01-29 22:54:35,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-01-29 22:54:35,772 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting P0Err45ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:35,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:35,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1559658666, now seen corresponding path program 4 times [2024-01-29 22:54:35,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:35,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959278631] [2024-01-29 22:54:35,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:35,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:35,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:35,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959278631] [2024-01-29 22:54:35,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959278631] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:35,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:35,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:35,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910449686] [2024-01-29 22:54:35,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:35,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:35,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:35,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:35,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:35,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:35,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 205 transitions, 3401 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:35,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:35,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:35,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:36,253 INFO L124 PetriNetUnfolderBase]: 1065/2510 cut-off events. [2024-01-29 22:54:36,253 INFO L125 PetriNetUnfolderBase]: For 34730/34908 co-relation queries the response was YES. [2024-01-29 22:54:36,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14079 conditions, 2510 events. 1065/2510 cut-off events. For 34730/34908 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 18816 event pairs, 404 based on Foata normal form. 58/2519 useless extension candidates. Maximal degree in co-relation 14015. Up to 784 conditions per place. [2024-01-29 22:54:36,269 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 131 selfloop transitions, 70 changer transitions 3/234 dead transitions. [2024-01-29 22:54:36,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 234 transitions, 3993 flow [2024-01-29 22:54:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2024-01-29 22:54:36,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.16452830188679246 [2024-01-29 22:54:36,270 INFO L175 Difference]: Start difference. First operand has 153 places, 205 transitions, 3401 flow. Second operand 5 states and 218 transitions. [2024-01-29 22:54:36,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 234 transitions, 3993 flow [2024-01-29 22:54:36,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 234 transitions, 3888 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:54:36,361 INFO L231 Difference]: Finished difference. Result has 156 places, 205 transitions, 3497 flow [2024-01-29 22:54:36,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3296, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3497, PETRI_PLACES=156, PETRI_TRANSITIONS=205} [2024-01-29 22:54:36,362 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -113 predicate places. [2024-01-29 22:54:36,362 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 205 transitions, 3497 flow [2024-01-29 22:54:36,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:36,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:36,362 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-01-29 22:54:36,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-01-29 22:54:36,362 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting P0Err45ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:36,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:36,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1823090312, now seen corresponding path program 5 times [2024-01-29 22:54:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:36,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457001431] [2024-01-29 22:54:36,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:36,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:36,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457001431] [2024-01-29 22:54:36,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457001431] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:36,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:36,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:36,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977147200] [2024-01-29 22:54:36,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:36,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:36,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:36,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:36,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:36,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:36,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 205 transitions, 3497 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:36,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:36,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:36,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:36,775 INFO L124 PetriNetUnfolderBase]: 1035/2392 cut-off events. [2024-01-29 22:54:36,775 INFO L125 PetriNetUnfolderBase]: For 36816/36993 co-relation queries the response was YES. [2024-01-29 22:54:36,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13597 conditions, 2392 events. 1035/2392 cut-off events. For 36816/36993 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17700 event pairs, 439 based on Foata normal form. 66/2371 useless extension candidates. Maximal degree in co-relation 13531. Up to 1456 conditions per place. [2024-01-29 22:54:36,791 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 145 selfloop transitions, 33 changer transitions 10/218 dead transitions. [2024-01-29 22:54:36,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 218 transitions, 3896 flow [2024-01-29 22:54:36,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2024-01-29 22:54:36,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.15396226415094338 [2024-01-29 22:54:36,793 INFO L175 Difference]: Start difference. First operand has 156 places, 205 transitions, 3497 flow. Second operand 5 states and 204 transitions. [2024-01-29 22:54:36,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 218 transitions, 3896 flow [2024-01-29 22:54:36,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 218 transitions, 3793 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-01-29 22:54:36,864 INFO L231 Difference]: Finished difference. Result has 153 places, 195 transitions, 3306 flow [2024-01-29 22:54:36,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3346, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3306, PETRI_PLACES=153, PETRI_TRANSITIONS=195} [2024-01-29 22:54:36,864 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -116 predicate places. [2024-01-29 22:54:36,865 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 195 transitions, 3306 flow [2024-01-29 22:54:36,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-29 22:54:36,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:36,865 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-01-29 22:54:36,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-01-29 22:54:36,865 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting P1Err58ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:36,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:36,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1936434707, now seen corresponding path program 1 times [2024-01-29 22:54:36,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:36,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681842988] [2024-01-29 22:54:36,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:36,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:36,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:36,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681842988] [2024-01-29 22:54:36,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681842988] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:36,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:36,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:36,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002078614] [2024-01-29 22:54:36,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:36,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:36,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:36,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:36,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:36,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:36,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 195 transitions, 3306 flow. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-01-29 22:54:36,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:36,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:36,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:37,263 INFO L124 PetriNetUnfolderBase]: 1009/2305 cut-off events. [2024-01-29 22:54:37,263 INFO L125 PetriNetUnfolderBase]: For 33809/33975 co-relation queries the response was YES. [2024-01-29 22:54:37,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13082 conditions, 2305 events. 1009/2305 cut-off events. For 33809/33975 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16732 event pairs, 496 based on Foata normal form. 66/2261 useless extension candidates. Maximal degree in co-relation 13019. Up to 1462 conditions per place. [2024-01-29 22:54:37,276 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 147 selfloop transitions, 36 changer transitions 7/220 dead transitions. [2024-01-29 22:54:37,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 220 transitions, 3846 flow [2024-01-29 22:54:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2024-01-29 22:54:37,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.16 [2024-01-29 22:54:37,278 INFO L175 Difference]: Start difference. First operand has 153 places, 195 transitions, 3306 flow. Second operand 5 states and 212 transitions. [2024-01-29 22:54:37,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 220 transitions, 3846 flow [2024-01-29 22:54:37,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 220 transitions, 3679 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-01-29 22:54:37,339 INFO L231 Difference]: Finished difference. Result has 153 places, 190 transitions, 3126 flow [2024-01-29 22:54:37,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3141, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3126, PETRI_PLACES=153, PETRI_TRANSITIONS=190} [2024-01-29 22:54:37,339 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -116 predicate places. [2024-01-29 22:54:37,339 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 190 transitions, 3126 flow [2024-01-29 22:54:37,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-01-29 22:54:37,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:37,340 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-01-29 22:54:37,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-01-29 22:54:37,341 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting P1Err58ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:37,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:37,341 INFO L85 PathProgramCache]: Analyzing trace with hash -149588165, now seen corresponding path program 2 times [2024-01-29 22:54:37,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:37,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744807678] [2024-01-29 22:54:37,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:37,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:37,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:37,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744807678] [2024-01-29 22:54:37,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744807678] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:37,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:37,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065228713] [2024-01-29 22:54:37,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:37,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:37,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:37,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:37,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:37,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 190 transitions, 3126 flow. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-01-29 22:54:37,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:37,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:37,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:37,715 INFO L124 PetriNetUnfolderBase]: 991/2307 cut-off events. [2024-01-29 22:54:37,715 INFO L125 PetriNetUnfolderBase]: For 29492/29650 co-relation queries the response was YES. [2024-01-29 22:54:37,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12649 conditions, 2307 events. 991/2307 cut-off events. For 29492/29650 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 16712 event pairs, 391 based on Foata normal form. 42/2254 useless extension candidates. Maximal degree in co-relation 12588. Up to 1382 conditions per place. [2024-01-29 22:54:37,731 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 128 selfloop transitions, 35 changer transitions 15/208 dead transitions. [2024-01-29 22:54:37,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 208 transitions, 3572 flow [2024-01-29 22:54:37,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2024-01-29 22:54:37,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.15471698113207547 [2024-01-29 22:54:37,732 INFO L175 Difference]: Start difference. First operand has 153 places, 190 transitions, 3126 flow. Second operand 5 states and 205 transitions. [2024-01-29 22:54:37,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 208 transitions, 3572 flow [2024-01-29 22:54:37,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 208 transitions, 3515 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:54:37,784 INFO L231 Difference]: Finished difference. Result has 156 places, 177 transitions, 2920 flow [2024-01-29 22:54:37,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=3069, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2920, PETRI_PLACES=156, PETRI_TRANSITIONS=177} [2024-01-29 22:54:37,785 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -113 predicate places. [2024-01-29 22:54:37,785 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 177 transitions, 2920 flow [2024-01-29 22:54:37,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-01-29 22:54:37,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:37,785 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-01-29 22:54:37,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-01-29 22:54:37,785 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting P1Err58ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:37,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1717987627, now seen corresponding path program 3 times [2024-01-29 22:54:37,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:37,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294827720] [2024-01-29 22:54:37,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:37,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:54:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:54:37,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:54:37,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294827720] [2024-01-29 22:54:37,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294827720] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:54:37,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:54:37,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:54:37,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507077708] [2024-01-29 22:54:37,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:54:37,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:54:37,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:54:37,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:54:37,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:54:37,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 265 [2024-01-29 22:54:37,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 177 transitions, 2920 flow. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-01-29 22:54:37,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:54:37,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 265 [2024-01-29 22:54:37,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:54:38,147 INFO L124 PetriNetUnfolderBase]: 964/2253 cut-off events. [2024-01-29 22:54:38,148 INFO L125 PetriNetUnfolderBase]: For 28861/29016 co-relation queries the response was YES. [2024-01-29 22:54:38,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12185 conditions, 2253 events. 964/2253 cut-off events. For 28861/29016 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16167 event pairs, 369 based on Foata normal form. 42/2220 useless extension candidates. Maximal degree in co-relation 12123. Up to 994 conditions per place. [2024-01-29 22:54:38,161 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 100 selfloop transitions, 50 changer transitions 20/200 dead transitions. [2024-01-29 22:54:38,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 200 transitions, 3362 flow [2024-01-29 22:54:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:54:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:54:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2024-01-29 22:54:38,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.15924528301886792 [2024-01-29 22:54:38,162 INFO L175 Difference]: Start difference. First operand has 156 places, 177 transitions, 2920 flow. Second operand 5 states and 211 transitions. [2024-01-29 22:54:38,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 200 transitions, 3362 flow [2024-01-29 22:54:38,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 200 transitions, 3100 flow, removed 0 selfloop flow, removed 16 redundant places. [2024-01-29 22:54:38,213 INFO L231 Difference]: Finished difference. Result has 143 places, 156 transitions, 2348 flow [2024-01-29 22:54:38,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=2636, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2348, PETRI_PLACES=143, PETRI_TRANSITIONS=156} [2024-01-29 22:54:38,213 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -126 predicate places. [2024-01-29 22:54:38,213 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 156 transitions, 2348 flow [2024-01-29 22:54:38,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-01-29 22:54:38,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:54:38,213 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-01-29 22:54:38,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-01-29 22:54:38,213 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 389 more)] === [2024-01-29 22:54:38,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:54:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2011956258, now seen corresponding path program 1 times [2024-01-29 22:54:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:54:38,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497410772] [2024-01-29 22:54:38,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:54:38,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:54:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:54:38,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:54:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:54:38,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:54:38,257 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:54:38,258 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (391 of 392 remaining) [2024-01-29 22:54:38,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (390 of 392 remaining) [2024-01-29 22:54:38,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (389 of 392 remaining) [2024-01-29 22:54:38,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (388 of 392 remaining) [2024-01-29 22:54:38,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (387 of 392 remaining) [2024-01-29 22:54:38,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (386 of 392 remaining) [2024-01-29 22:54:38,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (385 of 392 remaining) [2024-01-29 22:54:38,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6ASSERT_VIOLATIONWITNESS_INVARIANT (384 of 392 remaining) [2024-01-29 22:54:38,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7ASSERT_VIOLATIONWITNESS_INVARIANT (383 of 392 remaining) [2024-01-29 22:54:38,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8ASSERT_VIOLATIONWITNESS_INVARIANT (382 of 392 remaining) [2024-01-29 22:54:38,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9ASSERT_VIOLATIONWITNESS_INVARIANT (381 of 392 remaining) [2024-01-29 22:54:38,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10ASSERT_VIOLATIONWITNESS_INVARIANT (380 of 392 remaining) [2024-01-29 22:54:38,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11ASSERT_VIOLATIONWITNESS_INVARIANT (379 of 392 remaining) [2024-01-29 22:54:38,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12ASSERT_VIOLATIONWITNESS_INVARIANT (378 of 392 remaining) [2024-01-29 22:54:38,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13ASSERT_VIOLATIONWITNESS_INVARIANT (377 of 392 remaining) [2024-01-29 22:54:38,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14ASSERT_VIOLATIONWITNESS_INVARIANT (376 of 392 remaining) [2024-01-29 22:54:38,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15ASSERT_VIOLATIONWITNESS_INVARIANT (375 of 392 remaining) [2024-01-29 22:54:38,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err16ASSERT_VIOLATIONWITNESS_INVARIANT (374 of 392 remaining) [2024-01-29 22:54:38,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err17ASSERT_VIOLATIONWITNESS_INVARIANT (373 of 392 remaining) [2024-01-29 22:54:38,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err18ASSERT_VIOLATIONWITNESS_INVARIANT (372 of 392 remaining) [2024-01-29 22:54:38,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err19ASSERT_VIOLATIONWITNESS_INVARIANT (371 of 392 remaining) [2024-01-29 22:54:38,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err20ASSERT_VIOLATIONWITNESS_INVARIANT (370 of 392 remaining) [2024-01-29 22:54:38,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err21ASSERT_VIOLATIONWITNESS_INVARIANT (369 of 392 remaining) [2024-01-29 22:54:38,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err22ASSERT_VIOLATIONWITNESS_INVARIANT (368 of 392 remaining) [2024-01-29 22:54:38,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err23ASSERT_VIOLATIONWITNESS_INVARIANT (367 of 392 remaining) [2024-01-29 22:54:38,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err24ASSERT_VIOLATIONWITNESS_INVARIANT (366 of 392 remaining) [2024-01-29 22:54:38,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err25ASSERT_VIOLATIONWITNESS_INVARIANT (365 of 392 remaining) [2024-01-29 22:54:38,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err26ASSERT_VIOLATIONWITNESS_INVARIANT (364 of 392 remaining) [2024-01-29 22:54:38,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err27ASSERT_VIOLATIONWITNESS_INVARIANT (363 of 392 remaining) [2024-01-29 22:54:38,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err28ASSERT_VIOLATIONWITNESS_INVARIANT (362 of 392 remaining) [2024-01-29 22:54:38,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err29ASSERT_VIOLATIONWITNESS_INVARIANT (361 of 392 remaining) [2024-01-29 22:54:38,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err30ASSERT_VIOLATIONWITNESS_INVARIANT (360 of 392 remaining) [2024-01-29 22:54:38,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err31ASSERT_VIOLATIONWITNESS_INVARIANT (359 of 392 remaining) [2024-01-29 22:54:38,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err32ASSERT_VIOLATIONWITNESS_INVARIANT (358 of 392 remaining) [2024-01-29 22:54:38,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err33ASSERT_VIOLATIONWITNESS_INVARIANT (357 of 392 remaining) [2024-01-29 22:54:38,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err34ASSERT_VIOLATIONWITNESS_INVARIANT (356 of 392 remaining) [2024-01-29 22:54:38,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err35ASSERT_VIOLATIONWITNESS_INVARIANT (355 of 392 remaining) [2024-01-29 22:54:38,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err36ASSERT_VIOLATIONWITNESS_INVARIANT (354 of 392 remaining) [2024-01-29 22:54:38,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err37ASSERT_VIOLATIONWITNESS_INVARIANT (353 of 392 remaining) [2024-01-29 22:54:38,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err38ASSERT_VIOLATIONWITNESS_INVARIANT (352 of 392 remaining) [2024-01-29 22:54:38,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err39ASSERT_VIOLATIONWITNESS_INVARIANT (351 of 392 remaining) [2024-01-29 22:54:38,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err40ASSERT_VIOLATIONWITNESS_INVARIANT (350 of 392 remaining) [2024-01-29 22:54:38,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err41ASSERT_VIOLATIONWITNESS_INVARIANT (349 of 392 remaining) [2024-01-29 22:54:38,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err42ASSERT_VIOLATIONWITNESS_INVARIANT (348 of 392 remaining) [2024-01-29 22:54:38,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err43ASSERT_VIOLATIONWITNESS_INVARIANT (347 of 392 remaining) [2024-01-29 22:54:38,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err44ASSERT_VIOLATIONWITNESS_INVARIANT (346 of 392 remaining) [2024-01-29 22:54:38,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err45ASSERT_VIOLATIONWITNESS_INVARIANT (345 of 392 remaining) [2024-01-29 22:54:38,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err46ASSERT_VIOLATIONWITNESS_INVARIANT (344 of 392 remaining) [2024-01-29 22:54:38,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err47ASSERT_VIOLATIONWITNESS_INVARIANT (343 of 392 remaining) [2024-01-29 22:54:38,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err48ASSERT_VIOLATIONWITNESS_INVARIANT (342 of 392 remaining) [2024-01-29 22:54:38,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err49ASSERT_VIOLATIONWITNESS_INVARIANT (341 of 392 remaining) [2024-01-29 22:54:38,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err50ASSERT_VIOLATIONWITNESS_INVARIANT (340 of 392 remaining) [2024-01-29 22:54:38,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err51ASSERT_VIOLATIONWITNESS_INVARIANT (339 of 392 remaining) [2024-01-29 22:54:38,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err52ASSERT_VIOLATIONWITNESS_INVARIANT (338 of 392 remaining) [2024-01-29 22:54:38,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err53ASSERT_VIOLATIONWITNESS_INVARIANT (337 of 392 remaining) [2024-01-29 22:54:38,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err54ASSERT_VIOLATIONWITNESS_INVARIANT (336 of 392 remaining) [2024-01-29 22:54:38,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err55ASSERT_VIOLATIONWITNESS_INVARIANT (335 of 392 remaining) [2024-01-29 22:54:38,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err56ASSERT_VIOLATIONWITNESS_INVARIANT (334 of 392 remaining) [2024-01-29 22:54:38,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err57ASSERT_VIOLATIONWITNESS_INVARIANT (333 of 392 remaining) [2024-01-29 22:54:38,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err58ASSERT_VIOLATIONWITNESS_INVARIANT (332 of 392 remaining) [2024-01-29 22:54:38,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err59ASSERT_VIOLATIONWITNESS_INVARIANT (331 of 392 remaining) [2024-01-29 22:54:38,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err60ASSERT_VIOLATIONWITNESS_INVARIANT (330 of 392 remaining) [2024-01-29 22:54:38,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err61ASSERT_VIOLATIONWITNESS_INVARIANT (329 of 392 remaining) [2024-01-29 22:54:38,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err62ASSERT_VIOLATIONWITNESS_INVARIANT (328 of 392 remaining) [2024-01-29 22:54:38,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err63ASSERT_VIOLATIONWITNESS_INVARIANT (327 of 392 remaining) [2024-01-29 22:54:38,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err64ASSERT_VIOLATIONWITNESS_INVARIANT (326 of 392 remaining) [2024-01-29 22:54:38,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err65ASSERT_VIOLATIONWITNESS_INVARIANT (325 of 392 remaining) [2024-01-29 22:54:38,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err66ASSERT_VIOLATIONWITNESS_INVARIANT (324 of 392 remaining) [2024-01-29 22:54:38,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err67ASSERT_VIOLATIONWITNESS_INVARIANT (323 of 392 remaining) [2024-01-29 22:54:38,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err68ASSERT_VIOLATIONWITNESS_INVARIANT (322 of 392 remaining) [2024-01-29 22:54:38,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err69ASSERT_VIOLATIONWITNESS_INVARIANT (321 of 392 remaining) [2024-01-29 22:54:38,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err70ASSERT_VIOLATIONWITNESS_INVARIANT (320 of 392 remaining) [2024-01-29 22:54:38,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err71ASSERT_VIOLATIONWITNESS_INVARIANT (319 of 392 remaining) [2024-01-29 22:54:38,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err72ASSERT_VIOLATIONWITNESS_INVARIANT (318 of 392 remaining) [2024-01-29 22:54:38,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err73ASSERT_VIOLATIONWITNESS_INVARIANT (317 of 392 remaining) [2024-01-29 22:54:38,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err74ASSERT_VIOLATIONWITNESS_INVARIANT (316 of 392 remaining) [2024-01-29 22:54:38,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err75ASSERT_VIOLATIONWITNESS_INVARIANT (315 of 392 remaining) [2024-01-29 22:54:38,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err76ASSERT_VIOLATIONWITNESS_INVARIANT (314 of 392 remaining) [2024-01-29 22:54:38,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err77ASSERT_VIOLATIONWITNESS_INVARIANT (313 of 392 remaining) [2024-01-29 22:54:38,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err78ASSERT_VIOLATIONWITNESS_INVARIANT (312 of 392 remaining) [2024-01-29 22:54:38,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err79ASSERT_VIOLATIONWITNESS_INVARIANT (311 of 392 remaining) [2024-01-29 22:54:38,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err80ASSERT_VIOLATIONWITNESS_INVARIANT (310 of 392 remaining) [2024-01-29 22:54:38,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err81ASSERT_VIOLATIONWITNESS_INVARIANT (309 of 392 remaining) [2024-01-29 22:54:38,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err82ASSERT_VIOLATIONWITNESS_INVARIANT (308 of 392 remaining) [2024-01-29 22:54:38,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (307 of 392 remaining) [2024-01-29 22:54:38,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (306 of 392 remaining) [2024-01-29 22:54:38,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (305 of 392 remaining) [2024-01-29 22:54:38,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (304 of 392 remaining) [2024-01-29 22:54:38,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (303 of 392 remaining) [2024-01-29 22:54:38,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (302 of 392 remaining) [2024-01-29 22:54:38,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (301 of 392 remaining) [2024-01-29 22:54:38,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (300 of 392 remaining) [2024-01-29 22:54:38,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (299 of 392 remaining) [2024-01-29 22:54:38,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (298 of 392 remaining) [2024-01-29 22:54:38,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (297 of 392 remaining) [2024-01-29 22:54:38,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (296 of 392 remaining) [2024-01-29 22:54:38,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (295 of 392 remaining) [2024-01-29 22:54:38,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (294 of 392 remaining) [2024-01-29 22:54:38,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (293 of 392 remaining) [2024-01-29 22:54:38,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (292 of 392 remaining) [2024-01-29 22:54:38,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (291 of 392 remaining) [2024-01-29 22:54:38,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (290 of 392 remaining) [2024-01-29 22:54:38,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (289 of 392 remaining) [2024-01-29 22:54:38,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (288 of 392 remaining) [2024-01-29 22:54:38,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (287 of 392 remaining) [2024-01-29 22:54:38,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (286 of 392 remaining) [2024-01-29 22:54:38,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (285 of 392 remaining) [2024-01-29 22:54:38,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (284 of 392 remaining) [2024-01-29 22:54:38,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (283 of 392 remaining) [2024-01-29 22:54:38,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (282 of 392 remaining) [2024-01-29 22:54:38,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err26ASSERT_VIOLATIONWITNESS_INVARIANT (281 of 392 remaining) [2024-01-29 22:54:38,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err27ASSERT_VIOLATIONWITNESS_INVARIANT (280 of 392 remaining) [2024-01-29 22:54:38,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err28ASSERT_VIOLATIONWITNESS_INVARIANT (279 of 392 remaining) [2024-01-29 22:54:38,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err29ASSERT_VIOLATIONWITNESS_INVARIANT (278 of 392 remaining) [2024-01-29 22:54:38,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err30ASSERT_VIOLATIONWITNESS_INVARIANT (277 of 392 remaining) [2024-01-29 22:54:38,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err31ASSERT_VIOLATIONWITNESS_INVARIANT (276 of 392 remaining) [2024-01-29 22:54:38,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err32ASSERT_VIOLATIONWITNESS_INVARIANT (275 of 392 remaining) [2024-01-29 22:54:38,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err33ASSERT_VIOLATIONWITNESS_INVARIANT (274 of 392 remaining) [2024-01-29 22:54:38,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err34ASSERT_VIOLATIONWITNESS_INVARIANT (273 of 392 remaining) [2024-01-29 22:54:38,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err35ASSERT_VIOLATIONWITNESS_INVARIANT (272 of 392 remaining) [2024-01-29 22:54:38,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err36ASSERT_VIOLATIONWITNESS_INVARIANT (271 of 392 remaining) [2024-01-29 22:54:38,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err37ASSERT_VIOLATIONWITNESS_INVARIANT (270 of 392 remaining) [2024-01-29 22:54:38,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err38ASSERT_VIOLATIONWITNESS_INVARIANT (269 of 392 remaining) [2024-01-29 22:54:38,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err39ASSERT_VIOLATIONWITNESS_INVARIANT (268 of 392 remaining) [2024-01-29 22:54:38,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err40ASSERT_VIOLATIONWITNESS_INVARIANT (267 of 392 remaining) [2024-01-29 22:54:38,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err41ASSERT_VIOLATIONWITNESS_INVARIANT (266 of 392 remaining) [2024-01-29 22:54:38,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err42ASSERT_VIOLATIONWITNESS_INVARIANT (265 of 392 remaining) [2024-01-29 22:54:38,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err43ASSERT_VIOLATIONWITNESS_INVARIANT (264 of 392 remaining) [2024-01-29 22:54:38,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err44ASSERT_VIOLATIONWITNESS_INVARIANT (263 of 392 remaining) [2024-01-29 22:54:38,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err45ASSERT_VIOLATIONWITNESS_INVARIANT (262 of 392 remaining) [2024-01-29 22:54:38,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err46ASSERT_VIOLATIONWITNESS_INVARIANT (261 of 392 remaining) [2024-01-29 22:54:38,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err47ASSERT_VIOLATIONWITNESS_INVARIANT (260 of 392 remaining) [2024-01-29 22:54:38,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err48ASSERT_VIOLATIONWITNESS_INVARIANT (259 of 392 remaining) [2024-01-29 22:54:38,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err49ASSERT_VIOLATIONWITNESS_INVARIANT (258 of 392 remaining) [2024-01-29 22:54:38,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err50ASSERT_VIOLATIONWITNESS_INVARIANT (257 of 392 remaining) [2024-01-29 22:54:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err51ASSERT_VIOLATIONWITNESS_INVARIANT (256 of 392 remaining) [2024-01-29 22:54:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err52ASSERT_VIOLATIONWITNESS_INVARIANT (255 of 392 remaining) [2024-01-29 22:54:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err53ASSERT_VIOLATIONWITNESS_INVARIANT (254 of 392 remaining) [2024-01-29 22:54:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err54ASSERT_VIOLATIONWITNESS_INVARIANT (253 of 392 remaining) [2024-01-29 22:54:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err55ASSERT_VIOLATIONWITNESS_INVARIANT (252 of 392 remaining) [2024-01-29 22:54:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err56ASSERT_VIOLATIONWITNESS_INVARIANT (251 of 392 remaining) [2024-01-29 22:54:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err57ASSERT_VIOLATIONWITNESS_INVARIANT (250 of 392 remaining) [2024-01-29 22:54:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err58ASSERT_VIOLATIONWITNESS_INVARIANT (249 of 392 remaining) [2024-01-29 22:54:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err59ASSERT_VIOLATIONWITNESS_INVARIANT (248 of 392 remaining) [2024-01-29 22:54:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err60ASSERT_VIOLATIONWITNESS_INVARIANT (247 of 392 remaining) [2024-01-29 22:54:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err61ASSERT_VIOLATIONWITNESS_INVARIANT (246 of 392 remaining) [2024-01-29 22:54:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err62ASSERT_VIOLATIONWITNESS_INVARIANT (245 of 392 remaining) [2024-01-29 22:54:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err63ASSERT_VIOLATIONWITNESS_INVARIANT (244 of 392 remaining) [2024-01-29 22:54:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err64ASSERT_VIOLATIONWITNESS_INVARIANT (243 of 392 remaining) [2024-01-29 22:54:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err65ASSERT_VIOLATIONWITNESS_INVARIANT (242 of 392 remaining) [2024-01-29 22:54:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err66ASSERT_VIOLATIONWITNESS_INVARIANT (241 of 392 remaining) [2024-01-29 22:54:38,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err67ASSERT_VIOLATIONWITNESS_INVARIANT (240 of 392 remaining) [2024-01-29 22:54:38,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err68ASSERT_VIOLATIONWITNESS_INVARIANT (239 of 392 remaining) [2024-01-29 22:54:38,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err69ASSERT_VIOLATIONWITNESS_INVARIANT (238 of 392 remaining) [2024-01-29 22:54:38,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err70ASSERT_VIOLATIONWITNESS_INVARIANT (237 of 392 remaining) [2024-01-29 22:54:38,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err71ASSERT_VIOLATIONWITNESS_INVARIANT (236 of 392 remaining) [2024-01-29 22:54:38,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err72ASSERT_VIOLATIONWITNESS_INVARIANT (235 of 392 remaining) [2024-01-29 22:54:38,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err73ASSERT_VIOLATIONWITNESS_INVARIANT (234 of 392 remaining) [2024-01-29 22:54:38,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err74ASSERT_VIOLATIONWITNESS_INVARIANT (233 of 392 remaining) [2024-01-29 22:54:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err75ASSERT_VIOLATIONWITNESS_INVARIANT (232 of 392 remaining) [2024-01-29 22:54:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err76ASSERT_VIOLATIONWITNESS_INVARIANT (231 of 392 remaining) [2024-01-29 22:54:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err77ASSERT_VIOLATIONWITNESS_INVARIANT (230 of 392 remaining) [2024-01-29 22:54:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err78ASSERT_VIOLATIONWITNESS_INVARIANT (229 of 392 remaining) [2024-01-29 22:54:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err79ASSERT_VIOLATIONWITNESS_INVARIANT (228 of 392 remaining) [2024-01-29 22:54:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err80ASSERT_VIOLATIONWITNESS_INVARIANT (227 of 392 remaining) [2024-01-29 22:54:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err81ASSERT_VIOLATIONWITNESS_INVARIANT (226 of 392 remaining) [2024-01-29 22:54:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err82ASSERT_VIOLATIONWITNESS_INVARIANT (225 of 392 remaining) [2024-01-29 22:54:38,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (224 of 392 remaining) [2024-01-29 22:54:38,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (223 of 392 remaining) [2024-01-29 22:54:38,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 392 remaining) [2024-01-29 22:54:38,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 392 remaining) [2024-01-29 22:54:38,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 392 remaining) [2024-01-29 22:54:38,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 392 remaining) [2024-01-29 22:54:38,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 392 remaining) [2024-01-29 22:54:38,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 392 remaining) [2024-01-29 22:54:38,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 392 remaining) [2024-01-29 22:54:38,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 392 remaining) [2024-01-29 22:54:38,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 392 remaining) [2024-01-29 22:54:38,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 392 remaining) [2024-01-29 22:54:38,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 392 remaining) [2024-01-29 22:54:38,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 392 remaining) [2024-01-29 22:54:38,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 392 remaining) [2024-01-29 22:54:38,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 392 remaining) [2024-01-29 22:54:38,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 392 remaining) [2024-01-29 22:54:38,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 392 remaining) [2024-01-29 22:54:38,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 392 remaining) [2024-01-29 22:54:38,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 392 remaining) [2024-01-29 22:54:38,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (204 of 392 remaining) [2024-01-29 22:54:38,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (203 of 392 remaining) [2024-01-29 22:54:38,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 392 remaining) [2024-01-29 22:54:38,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 392 remaining) [2024-01-29 22:54:38,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 392 remaining) [2024-01-29 22:54:38,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 392 remaining) [2024-01-29 22:54:38,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 392 remaining) [2024-01-29 22:54:38,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 392 remaining) [2024-01-29 22:54:38,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 392 remaining) [2024-01-29 22:54:38,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 392 remaining) [2024-01-29 22:54:38,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 392 remaining) [2024-01-29 22:54:38,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 392 remaining) [2024-01-29 22:54:38,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 392 remaining) [2024-01-29 22:54:38,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 392 remaining) [2024-01-29 22:54:38,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 392 remaining) [2024-01-29 22:54:38,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 392 remaining) [2024-01-29 22:54:38,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 392 remaining) [2024-01-29 22:54:38,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 392 remaining) [2024-01-29 22:54:38,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 392 remaining) [2024-01-29 22:54:38,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 392 remaining) [2024-01-29 22:54:38,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 392 remaining) [2024-01-29 22:54:38,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 392 remaining) [2024-01-29 22:54:38,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 392 remaining) [2024-01-29 22:54:38,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 392 remaining) [2024-01-29 22:54:38,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 392 remaining) [2024-01-29 22:54:38,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 392 remaining) [2024-01-29 22:54:38,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 392 remaining) [2024-01-29 22:54:38,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 392 remaining) [2024-01-29 22:54:38,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 392 remaining) [2024-01-29 22:54:38,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 392 remaining) [2024-01-29 22:54:38,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 392 remaining) [2024-01-29 22:54:38,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 392 remaining) [2024-01-29 22:54:38,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 392 remaining) [2024-01-29 22:54:38,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 392 remaining) [2024-01-29 22:54:38,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 392 remaining) [2024-01-29 22:54:38,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 392 remaining) [2024-01-29 22:54:38,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION (168 of 392 remaining) [2024-01-29 22:54:38,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (167 of 392 remaining) [2024-01-29 22:54:38,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (166 of 392 remaining) [2024-01-29 22:54:38,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 392 remaining) [2024-01-29 22:54:38,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 392 remaining) [2024-01-29 22:54:38,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 392 remaining) [2024-01-29 22:54:38,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 392 remaining) [2024-01-29 22:54:38,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 392 remaining) [2024-01-29 22:54:38,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 392 remaining) [2024-01-29 22:54:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 392 remaining) [2024-01-29 22:54:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 392 remaining) [2024-01-29 22:54:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 392 remaining) [2024-01-29 22:54:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 392 remaining) [2024-01-29 22:54:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 392 remaining) [2024-01-29 22:54:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 392 remaining) [2024-01-29 22:54:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 392 remaining) [2024-01-29 22:54:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 392 remaining) [2024-01-29 22:54:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 392 remaining) [2024-01-29 22:54:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 392 remaining) [2024-01-29 22:54:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err16ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 392 remaining) [2024-01-29 22:54:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err17ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 392 remaining) [2024-01-29 22:54:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err18ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 392 remaining) [2024-01-29 22:54:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err19ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 392 remaining) [2024-01-29 22:54:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err20ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 392 remaining) [2024-01-29 22:54:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err21ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 392 remaining) [2024-01-29 22:54:38,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err22ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 392 remaining) [2024-01-29 22:54:38,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err23ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 392 remaining) [2024-01-29 22:54:38,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err24ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 392 remaining) [2024-01-29 22:54:38,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err25ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 392 remaining) [2024-01-29 22:54:38,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err26ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 392 remaining) [2024-01-29 22:54:38,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err27ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 392 remaining) [2024-01-29 22:54:38,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err28ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 392 remaining) [2024-01-29 22:54:38,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err29ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 392 remaining) [2024-01-29 22:54:38,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err30ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 392 remaining) [2024-01-29 22:54:38,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err31ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 392 remaining) [2024-01-29 22:54:38,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err32ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 392 remaining) [2024-01-29 22:54:38,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err33ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 392 remaining) [2024-01-29 22:54:38,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err34ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 392 remaining) [2024-01-29 22:54:38,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err35ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 392 remaining) [2024-01-29 22:54:38,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err36ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 392 remaining) [2024-01-29 22:54:38,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err37ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 392 remaining) [2024-01-29 22:54:38,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err38ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 392 remaining) [2024-01-29 22:54:38,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err39ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 392 remaining) [2024-01-29 22:54:38,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err40ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 392 remaining) [2024-01-29 22:54:38,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err41ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 392 remaining) [2024-01-29 22:54:38,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err42ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 392 remaining) [2024-01-29 22:54:38,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err43ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 392 remaining) [2024-01-29 22:54:38,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err44ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 392 remaining) [2024-01-29 22:54:38,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err45ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 392 remaining) [2024-01-29 22:54:38,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err46ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 392 remaining) [2024-01-29 22:54:38,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err47ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 392 remaining) [2024-01-29 22:54:38,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err48ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 392 remaining) [2024-01-29 22:54:38,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err49ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 392 remaining) [2024-01-29 22:54:38,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err50ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 392 remaining) [2024-01-29 22:54:38,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err51ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 392 remaining) [2024-01-29 22:54:38,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err52ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 392 remaining) [2024-01-29 22:54:38,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err53ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 392 remaining) [2024-01-29 22:54:38,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err54ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 392 remaining) [2024-01-29 22:54:38,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err55ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 392 remaining) [2024-01-29 22:54:38,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err56ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 392 remaining) [2024-01-29 22:54:38,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err57ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 392 remaining) [2024-01-29 22:54:38,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err58ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 392 remaining) [2024-01-29 22:54:38,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err59ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 392 remaining) [2024-01-29 22:54:38,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err60ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 392 remaining) [2024-01-29 22:54:38,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err61ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 392 remaining) [2024-01-29 22:54:38,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err62ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 392 remaining) [2024-01-29 22:54:38,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err63ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 392 remaining) [2024-01-29 22:54:38,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err64ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 392 remaining) [2024-01-29 22:54:38,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err65ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 392 remaining) [2024-01-29 22:54:38,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err66ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 392 remaining) [2024-01-29 22:54:38,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err67ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 392 remaining) [2024-01-29 22:54:38,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err68ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 392 remaining) [2024-01-29 22:54:38,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err69ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 392 remaining) [2024-01-29 22:54:38,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err70ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 392 remaining) [2024-01-29 22:54:38,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err71ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 392 remaining) [2024-01-29 22:54:38,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err72ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 392 remaining) [2024-01-29 22:54:38,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err73ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 392 remaining) [2024-01-29 22:54:38,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err74ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 392 remaining) [2024-01-29 22:54:38,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err75ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 392 remaining) [2024-01-29 22:54:38,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err76ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 392 remaining) [2024-01-29 22:54:38,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err77ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 392 remaining) [2024-01-29 22:54:38,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err78ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 392 remaining) [2024-01-29 22:54:38,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err79ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 392 remaining) [2024-01-29 22:54:38,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err80ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 392 remaining) [2024-01-29 22:54:38,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err81ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 392 remaining) [2024-01-29 22:54:38,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err82ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 392 remaining) [2024-01-29 22:54:38,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 392 remaining) [2024-01-29 22:54:38,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 392 remaining) [2024-01-29 22:54:38,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 392 remaining) [2024-01-29 22:54:38,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 392 remaining) [2024-01-29 22:54:38,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 392 remaining) [2024-01-29 22:54:38,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 392 remaining) [2024-01-29 22:54:38,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 392 remaining) [2024-01-29 22:54:38,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 392 remaining) [2024-01-29 22:54:38,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 392 remaining) [2024-01-29 22:54:38,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 392 remaining) [2024-01-29 22:54:38,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 392 remaining) [2024-01-29 22:54:38,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 392 remaining) [2024-01-29 22:54:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 392 remaining) [2024-01-29 22:54:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 392 remaining) [2024-01-29 22:54:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 392 remaining) [2024-01-29 22:54:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 392 remaining) [2024-01-29 22:54:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 392 remaining) [2024-01-29 22:54:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 392 remaining) [2024-01-29 22:54:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 392 remaining) [2024-01-29 22:54:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 392 remaining) [2024-01-29 22:54:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 392 remaining) [2024-01-29 22:54:38,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 392 remaining) [2024-01-29 22:54:38,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 392 remaining) [2024-01-29 22:54:38,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 392 remaining) [2024-01-29 22:54:38,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 392 remaining) [2024-01-29 22:54:38,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 392 remaining) [2024-01-29 22:54:38,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err26ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 392 remaining) [2024-01-29 22:54:38,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err27ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 392 remaining) [2024-01-29 22:54:38,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err28ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 392 remaining) [2024-01-29 22:54:38,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err29ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 392 remaining) [2024-01-29 22:54:38,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err30ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 392 remaining) [2024-01-29 22:54:38,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err31ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 392 remaining) [2024-01-29 22:54:38,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err32ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 392 remaining) [2024-01-29 22:54:38,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err33ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 392 remaining) [2024-01-29 22:54:38,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err34ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 392 remaining) [2024-01-29 22:54:38,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err35ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 392 remaining) [2024-01-29 22:54:38,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err36ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 392 remaining) [2024-01-29 22:54:38,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err37ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 392 remaining) [2024-01-29 22:54:38,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err38ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 392 remaining) [2024-01-29 22:54:38,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err39ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 392 remaining) [2024-01-29 22:54:38,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err40ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 392 remaining) [2024-01-29 22:54:38,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err41ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 392 remaining) [2024-01-29 22:54:38,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err42ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 392 remaining) [2024-01-29 22:54:38,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err43ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 392 remaining) [2024-01-29 22:54:38,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err44ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 392 remaining) [2024-01-29 22:54:38,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err45ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 392 remaining) [2024-01-29 22:54:38,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err46ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 392 remaining) [2024-01-29 22:54:38,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err47ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 392 remaining) [2024-01-29 22:54:38,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err48ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 392 remaining) [2024-01-29 22:54:38,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err49ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 392 remaining) [2024-01-29 22:54:38,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err50ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 392 remaining) [2024-01-29 22:54:38,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err51ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 392 remaining) [2024-01-29 22:54:38,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err52ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 392 remaining) [2024-01-29 22:54:38,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err53ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 392 remaining) [2024-01-29 22:54:38,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err54ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 392 remaining) [2024-01-29 22:54:38,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err55ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 392 remaining) [2024-01-29 22:54:38,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err56ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 392 remaining) [2024-01-29 22:54:38,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err57ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 392 remaining) [2024-01-29 22:54:38,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err58ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 392 remaining) [2024-01-29 22:54:38,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err59ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 392 remaining) [2024-01-29 22:54:38,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err60ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 392 remaining) [2024-01-29 22:54:38,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err61ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 392 remaining) [2024-01-29 22:54:38,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err62ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 392 remaining) [2024-01-29 22:54:38,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err63ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 392 remaining) [2024-01-29 22:54:38,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err64ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err65ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err66ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err67ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err68ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err69ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err70ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err71ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err72ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err73ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err74ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err75ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err76ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 392 remaining) [2024-01-29 22:54:38,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err77ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 392 remaining) [2024-01-29 22:54:38,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err78ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 392 remaining) [2024-01-29 22:54:38,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err79ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 392 remaining) [2024-01-29 22:54:38,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err80ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 392 remaining) [2024-01-29 22:54:38,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err81ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 392 remaining) [2024-01-29 22:54:38,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err82ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 392 remaining) [2024-01-29 22:54:38,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-01-29 22:54:38,323 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 3, 2, 2, 2, 2, 2, 2, 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-01-29 22:54:38,344 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:54:38,344 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:54:38,383 INFO L503 ceAbstractionStarter]: Automizer considered 223 witness invariants [2024-01-29 22:54:38,386 INFO L504 ceAbstractionStarter]: WitnessConsidered=223 [2024-01-29 22:54:38,388 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:54:38 BasicIcfg [2024-01-29 22:54:38,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:54:38,388 INFO L158 Benchmark]: Toolchain (without parser) took 68868.73ms. Allocated memory was 165.7MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 131.5MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 4.9GB. Max. memory is 16.1GB. [2024-01-29 22:54:38,388 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:54:38,388 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 165.7MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:54:38,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 701.65ms. Allocated memory is still 165.7MB. Free memory was 131.5MB in the beginning and 85.4MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-01-29 22:54:38,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.00ms. Allocated memory is still 165.7MB. Free memory was 85.4MB in the beginning and 82.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:54:38,389 INFO L158 Benchmark]: Boogie Preprocessor took 74.30ms. Allocated memory is still 165.7MB. Free memory was 82.4MB in the beginning and 79.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:54:38,389 INFO L158 Benchmark]: RCFGBuilder took 2551.57ms. Allocated memory was 165.7MB in the beginning and 385.9MB in the end (delta: 220.2MB). Free memory was 79.1MB in the beginning and 190.8MB in the end (delta: -111.7MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. [2024-01-29 22:54:38,390 INFO L158 Benchmark]: TraceAbstraction took 65467.88ms. Allocated memory was 385.9MB in the beginning and 7.0GB in the end (delta: 6.6GB). Free memory was 190.8MB in the beginning and 6.3GB in the end (delta: -6.1GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. [2024-01-29 22:54:38,394 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.17ms. Allocated memory is still 104.9MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 165.7MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 701.65ms. Allocated memory is still 165.7MB. Free memory was 131.5MB in the beginning and 85.4MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.00ms. Allocated memory is still 165.7MB. Free memory was 85.4MB in the beginning and 82.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.30ms. Allocated memory is still 165.7MB. Free memory was 82.4MB in the beginning and 79.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2551.57ms. Allocated memory was 165.7MB in the beginning and 385.9MB in the end (delta: 220.2MB). Free memory was 79.1MB in the beginning and 190.8MB in the end (delta: -111.7MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. * TraceAbstraction took 65467.88ms. Allocated memory was 385.9MB in the beginning and 7.0GB in the end (delta: 6.6GB). Free memory was 190.8MB in the beginning and 6.3GB in the end (delta: -6.1GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 767]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L756] 0 pthread_t t2485; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2485={5:0}, x=0, y=0] [L757] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_cnt],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]]]]] VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2485={5:0}, x=0, y=0] [L757] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_cnt],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]]]]] VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2485={5:0}, x=0, y=0] [L757] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_cnt],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2485={5:0}, x=0, y=0] [L757] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_cnt],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2485={5:0}, x=0, y=0] [L757] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_cnt],IntegerLiteral[0]]]] [L757] FCALL, FORK 0 pthread_create(&t2485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2485={5:0}, x=0, y=0] [L717] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L718] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L718] 1 y = 2 [L719] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L719] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L719] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L719] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L719] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L719] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L719] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L719] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L719] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L758] 0 pthread_t t2486; [L759] FCALL, FORK 0 pthread_create(&t2486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2485={5:0}, t2486={3:0}, x=0, y=2] [L732] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L733] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L733] 2 x = 2 [L734] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L734] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L734] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L734] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L734] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L734] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L734] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L734] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L734] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=2, y=2] [L720] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=2, y=2] [L735] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=2, y=2] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L721] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] [L721] 1 x = 1 [L722] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L722] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L722] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L722] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L722] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L722] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L722] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]] [L722] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L722] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L723] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L725] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L736] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L736] 2 y = 1 [L737] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L737] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]]] [L737] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L737] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] [L737] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L737] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L737] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L737] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L737] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L738] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L726] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]]] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L740] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L741] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]]] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] [L761] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L762] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L762] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L762] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L762] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] [L762] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L762] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L762] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L762] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L762] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L762] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L762] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2485={5:0}, t2486={3:0}, x=1, y=1] [L763] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L763] RET 0 assume_abort_if_not(main$tmp_guard0) [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]]]] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]]]] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]]]] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]]]] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]]]]] VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2485={5:0}, t2486={3:0}, x=1, y=1] [L767] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]]]] [L767] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L767] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2485={5:0}, t2486={3:0}, x=1, y=1] - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 728]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 735]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 740]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 743]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 455 locations, 392 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 65.1s, OverallIterations: 56, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 60.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4717 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3989 mSDsluCounter, 601 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 846 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12305 IncrementalHoareTripleChecker+Invalid, 13151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 846 mSolverCounterUnsat, 197 mSDtfsCounter, 12305 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4812occurred in iteration=39, InterpolantAutomatonStates: 257, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1047 NumberOfCodeBlocks, 1047 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 960 ConstructedInterpolants, 0 QuantifiedInterpolants, 4946 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 55 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 22:54:38,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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