./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.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/arithmetic_prog_bad.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fced0e87 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-deagle/arithmetic_prog_bad.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/arithmetic_prog_bad.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-wip.fs.extract-columns-fced0e8-m [2024-01-31 16:28:04,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:28:04,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:28:04,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:28:04,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:28:04,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:28:04,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:28:04,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:28:04,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:28:04,664 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:28:04,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:28:04,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:28:04,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:28:04,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:28:04,667 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:28:04,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:28:04,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:28:04,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:28:04,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:28:04,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:28:04,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:28:04,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:28:04,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:28:04,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:28:04,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:28:04,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:28:04,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:28:04,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:28:04,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:28:04,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:28:04,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:28:04,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:28:04,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:28:04,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:28:04,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:28:04,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:28:04,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:28:04,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:28:04,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:28:04,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:28:04,673 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:28:04,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:28:04,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:28:04,674 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-31 16:28:04,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:28:04,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:28:04,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:28:04,946 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:28:04,947 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:28:04,948 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/arithmetic_prog_bad.yml/witness.yml [2024-01-31 16:28:05,090 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:28:05,090 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:28:05,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-01-31 16:28:06,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:28:06,268 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:28:06,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-01-31 16:28:06,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782cd7882/a8cd2e7865fe42b599a1b1439d19ff36/FLAG8640d3699 [2024-01-31 16:28:06,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782cd7882/a8cd2e7865fe42b599a1b1439d19ff36 [2024-01-31 16:28:06,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:28:06,297 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:28:06,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:28:06,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:28:06,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:28:06,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:28:05" (1/2) ... [2024-01-31 16:28:06,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f379d7f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:28:06, skipping insertion in model container [2024-01-31 16:28:06,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:28:05" (1/2) ... [2024-01-31 16:28:06,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3002b7e2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:28:06, skipping insertion in model container [2024-01-31 16:28:06,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:28:06" (2/2) ... [2024-01-31 16:28:06,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f379d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:06, skipping insertion in model container [2024-01-31 16:28:06,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:28:06" (2/2) ... [2024-01-31 16:28:06,306 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:28:06,449 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:28:06,450 INFO L98 nessWitnessExtractor]: Location invariant before [L891-L891] (unsigned long )arg == 0UL [2024-01-31 16:28:06,450 INFO L98 nessWitnessExtractor]: Location invariant before [L896-L896] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-01-31 16:28:06,450 INFO L98 nessWitnessExtractor]: Location invariant before [L883-L883] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-01-31 16:28:06,450 INFO L98 nessWitnessExtractor]: Location invariant before [L881-L881] ((num == 1) && ((unsigned long )arg == 0UL)) && (((((((((((((((((((((((((((((((((((((((((((((((1 <= i && i <= 2) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (1 <= i && i <= 2)) || (1 <= i && i <= 2)) [2024-01-31 16:28:06,450 INFO L98 nessWitnessExtractor]: Location invariant before [L909-L909] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:28:06,450 INFO L98 nessWitnessExtractor]: Location invariant before [L908-L908] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:28:06,451 INFO L98 nessWitnessExtractor]: Location invariant before [L887-L887] (i == 3) && ((unsigned long )arg == 0UL) [2024-01-31 16:28:06,451 INFO L98 nessWitnessExtractor]: Location invariant before [L898-L898] ((num == 0) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-01-31 16:28:06,451 INFO L98 nessWitnessExtractor]: Location invariant before [L903-L903] (j == 3) && ((unsigned long )arg == 0UL) [2024-01-31 16:28:06,451 INFO L98 nessWitnessExtractor]: Location invariant before [L885-L885] ((unsigned long )arg == 0UL) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-01-31 16:28:06,451 INFO L98 nessWitnessExtractor]: Location invariant before [L913-L913] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:28:06,451 INFO L98 nessWitnessExtractor]: Location invariant before [L911-L911] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:28:06,451 INFO L98 nessWitnessExtractor]: Location invariant before [L895-L895] ((num == 0) && ((unsigned long )arg == 0UL)) && ((((((((((((((((((((((((((((((((((((((((((((((((((((0 == j && j == 0) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) [2024-01-31 16:28:06,452 INFO L98 nessWitnessExtractor]: Location invariant before [L899-L899] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-01-31 16:28:06,452 INFO L98 nessWitnessExtractor]: Loop invariant at [L894-L894] (((0 <= num) && (num <= 1)) && ((unsigned long )arg == 0UL)) && ((((((((((((((((((((((((((((((((((((((((((((((((((((0 == j && j == 0) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) || (0 == j && j == 0)) || (1 <= j && j <= 2)) [2024-01-31 16:28:06,452 INFO L98 nessWitnessExtractor]: Location invariant before [L884-L884] ((unsigned long )arg == 0UL) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-01-31 16:28:06,452 INFO L98 nessWitnessExtractor]: Location invariant before [L904-L904] (j == 3) && ((unsigned long )arg == 0UL) [2024-01-31 16:28:06,452 INFO L98 nessWitnessExtractor]: Location invariant before [L897-L897] ((num == 1) && ((unsigned long )arg == 0UL)) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-01-31 16:28:06,452 INFO L98 nessWitnessExtractor]: Location invariant before [L877-L877] (unsigned long )arg == 0UL [2024-01-31 16:28:06,452 INFO L98 nessWitnessExtractor]: Location invariant before [L879-L879] ((unsigned long )arg == 0UL) && ((1 <= i && i <= 2) || (0 == i && i == 0)) [2024-01-31 16:28:06,453 INFO L98 nessWitnessExtractor]: Location invariant before [L900-L900] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-01-31 16:28:06,453 INFO L98 nessWitnessExtractor]: Loop invariant at [L878-L878] ((unsigned long )arg == 0UL) && ((1 <= i && i <= 3) || (0 == i && i == 0)) [2024-01-31 16:28:06,453 INFO L98 nessWitnessExtractor]: Location invariant before [L893-L893] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 2)) [2024-01-31 16:28:06,453 INFO L98 nessWitnessExtractor]: Loop invariant at [L880-L880] (((0 <= num) && (num <= 1)) && ((unsigned long )arg == 0UL)) && (((((((((((((((((((((((((((((((((((((((((((((((1 <= i && i <= 2) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (0 == i && i == 0)) || (1 <= i && i <= 2)) || (1 <= i && i <= 2)) || (1 <= i && i <= 2)) [2024-01-31 16:28:06,453 INFO L98 nessWitnessExtractor]: Location invariant before [L882-L882] ((num == 0) && ((unsigned long )arg == 0UL)) && ((0 == i && i == 0) || (1 <= i && i <= 2)) [2024-01-31 16:28:06,453 INFO L98 nessWitnessExtractor]: Location invariant before [L910-L910] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:28:06,454 INFO L98 nessWitnessExtractor]: Location invariant before [L912-L912] ((num == 0) && (total == 0UL)) && (flag == 0) [2024-01-31 16:28:06,454 INFO L98 nessWitnessExtractor]: Location invariant before [L902-L902] (j == 3) && ((unsigned long )arg == 0UL) [2024-01-31 16:28:06,454 INFO L98 nessWitnessExtractor]: Loop invariant at [L892-L892] ((unsigned long )arg == 0UL) && ((0 == j && j == 0) || (1 <= j && j <= 3)) [2024-01-31 16:28:06,492 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:28:06,800 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-deagle/arithmetic_prog_bad.i[39758,39771] [2024-01-31 16:28:06,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:28:06,826 INFO L204 MainTranslator]: Completed pre-run 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-31 16:28:06,972 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-deagle/arithmetic_prog_bad.i[39758,39771] [2024-01-31 16:28:06,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:28:07,018 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:28:07,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07 WrapperNode [2024-01-31 16:28:07,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:28:07,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:28:07,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:28:07,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:28:07,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,072 INFO L138 Inliner]: procedures = 244, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-01-31 16:28:07,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:28:07,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:28:07,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:28:07,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:28:07,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,103 INFO L175 MemorySlicer]: Split 31 memory accesses to 7 slices as follows [2, 1, 8, 8, 8, 2, 2]. 26 percent of accesses are in the largest equivalence class. The 27 initializations are split as follows [2, 1, 8, 8, 8, 0, 0]. The 2 writes are split as follows [0, 0, 0, 0, 0, 1, 1]. [2024-01-31 16:28:07,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:28:07,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:28:07,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:28:07,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:28:07,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (1/1) ... [2024-01-31 16:28:07,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:28:07,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:07,181 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-31 16:28:07,204 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-31 16:28:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:28:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:28:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-01-31 16:28:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-01-31 16:28:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-01-31 16:28:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-01-31 16:28:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-01-31 16:28:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-01-31 16:28:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-01-31 16:28:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-31 16:28:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:28:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:28:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:28:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:28:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 16:28:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-31 16:28:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-01-31 16:28:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:28:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:28:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:28:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:28:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:28:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:28:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:28:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:28:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 16:28:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-31 16:28:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-01-31 16:28:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-31 16:28:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:28:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:28:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:28:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:28:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:28:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 16:28:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-31 16:28:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-01-31 16:28:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:28:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:28:07,219 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 16:28:07,376 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:28:07,377 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:28:07,737 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:28:07,737 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:28:07,841 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:28:07,841 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-31 16:28:07,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:28:07 BoogieIcfgContainer [2024-01-31 16:28:07,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:28:07,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:28:07,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:28:07,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:28:07,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:28:05" (1/4) ... [2024-01-31 16:28:07,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e80779 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:28:07, skipping insertion in model container [2024-01-31 16:28:07,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:28:06" (2/4) ... [2024-01-31 16:28:07,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e80779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:28:07, skipping insertion in model container [2024-01-31 16:28:07,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:28:07" (3/4) ... [2024-01-31 16:28:07,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e80779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:28:07, skipping insertion in model container [2024-01-31 16:28:07,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:28:07" (4/4) ... [2024-01-31 16:28:07,848 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-01-31 16:28:07,860 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:28:07,860 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-01-31 16:28:07,860 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:28:07,924 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-31 16:28:07,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 102 transitions, 218 flow [2024-01-31 16:28:08,019 INFO L124 PetriNetUnfolderBase]: 10/100 cut-off events. [2024-01-31 16:28:08,024 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:28:08,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 10/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 275 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 77. Up to 3 conditions per place. [2024-01-31 16:28:08,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 102 transitions, 218 flow [2024-01-31 16:28:08,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 96 transitions, 204 flow [2024-01-31 16:28:08,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:28:08,054 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;@4ff94118, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:28:08,070 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-01-31 16:28:08,072 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:28:08,073 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:28:08,073 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:28:08,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:08,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:28:08,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:08,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:08,093 INFO L85 PathProgramCache]: Analyzing trace with hash 13436, now seen corresponding path program 1 times [2024-01-31 16:28:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:08,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702375226] [2024-01-31 16:28:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:08,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:08,407 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-31 16:28:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:08,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702375226] [2024-01-31 16:28:08,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702375226] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:08,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:08,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:28:08,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135235090] [2024-01-31 16:28:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:08,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:28:08,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:08,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:28:08,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:28:08,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 102 [2024-01-31 16:28:08,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 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-31 16:28:08,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:08,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 102 [2024-01-31 16:28:08,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:08,797 INFO L124 PetriNetUnfolderBase]: 621/1788 cut-off events. [2024-01-31 16:28:08,797 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-01-31 16:28:08,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2846 conditions, 1788 events. 621/1788 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 12135 event pairs, 195 based on Foata normal form. 203/1713 useless extension candidates. Maximal degree in co-relation 2599. Up to 844 conditions per place. [2024-01-31 16:28:08,808 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 52 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2024-01-31 16:28:08,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 102 transitions, 332 flow [2024-01-31 16:28:08,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:28:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:28:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-01-31 16:28:08,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7320261437908496 [2024-01-31 16:28:08,819 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 204 flow. Second operand 3 states and 224 transitions. [2024-01-31 16:28:08,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 102 transitions, 332 flow [2024-01-31 16:28:08,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 102 transitions, 320 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 16:28:08,824 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 197 flow [2024-01-31 16:28:08,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2024-01-31 16:28:08,828 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -7 predicate places. [2024-01-31 16:28:08,828 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 197 flow [2024-01-31 16:28:08,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 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-31 16:28:08,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:08,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:28:08,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:28:08,829 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:08,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:08,830 INFO L85 PathProgramCache]: Analyzing trace with hash -252263545, now seen corresponding path program 1 times [2024-01-31 16:28:08,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:08,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480381646] [2024-01-31 16:28:08,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:08,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:08,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-31 16:28:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480381646] [2024-01-31 16:28:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480381646] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:08,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:28:08,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155399112] [2024-01-31 16:28:08,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:08,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:28:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:08,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:28:08,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:28:09,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2024-01-31 16:28:09,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-31 16:28:09,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:09,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2024-01-31 16:28:09,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:09,208 INFO L124 PetriNetUnfolderBase]: 488/1602 cut-off events. [2024-01-31 16:28:09,208 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-01-31 16:28:09,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 1602 events. 488/1602 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 11292 event pairs, 151 based on Foata normal form. 0/1288 useless extension candidates. Maximal degree in co-relation 957. Up to 736 conditions per place. [2024-01-31 16:28:09,216 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 44 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2024-01-31 16:28:09,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 98 transitions, 313 flow [2024-01-31 16:28:09,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:28:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:28:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-01-31 16:28:09,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7181372549019608 [2024-01-31 16:28:09,218 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 197 flow. Second operand 4 states and 293 transitions. [2024-01-31 16:28:09,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 98 transitions, 313 flow [2024-01-31 16:28:09,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 98 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:28:09,220 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 196 flow [2024-01-31 16:28:09,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2024-01-31 16:28:09,221 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places. [2024-01-31 16:28:09,221 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 196 flow [2024-01-31 16:28:09,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-31 16:28:09,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:09,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:28:09,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:28:09,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:09,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash 769765184, now seen corresponding path program 1 times [2024-01-31 16:28:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:09,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839293760] [2024-01-31 16:28:09,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:09,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:09,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-31 16:28:09,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:09,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839293760] [2024-01-31 16:28:09,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839293760] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:09,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:09,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:28:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916540223] [2024-01-31 16:28:09,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:09,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:28:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:28:09,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:28:09,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2024-01-31 16:28:09,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-31 16:28:09,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:09,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2024-01-31 16:28:09,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:09,486 INFO L124 PetriNetUnfolderBase]: 739/2168 cut-off events. [2024-01-31 16:28:09,486 INFO L125 PetriNetUnfolderBase]: For 124/131 co-relation queries the response was YES. [2024-01-31 16:28:09,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3565 conditions, 2168 events. 739/2168 cut-off events. For 124/131 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 16043 event pairs, 358 based on Foata normal form. 84/1884 useless extension candidates. Maximal degree in co-relation 3404. Up to 933 conditions per place. [2024-01-31 16:28:09,495 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 60 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-01-31 16:28:09,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 109 transitions, 371 flow [2024-01-31 16:28:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:28:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:28:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2024-01-31 16:28:09,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7679738562091504 [2024-01-31 16:28:09,498 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 196 flow. Second operand 3 states and 235 transitions. [2024-01-31 16:28:09,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 109 transitions, 371 flow [2024-01-31 16:28:09,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 109 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:28:09,502 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 213 flow [2024-01-31 16:28:09,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=90, PETRI_TRANSITIONS=88} [2024-01-31 16:28:09,504 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2024-01-31 16:28:09,504 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 213 flow [2024-01-31 16:28:09,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-31 16:28:09,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:09,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:28:09,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:28:09,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:09,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:09,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1908828753, now seen corresponding path program 1 times [2024-01-31 16:28:09,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:09,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248438744] [2024-01-31 16:28:09,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:09,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:09,639 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-31 16:28:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248438744] [2024-01-31 16:28:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248438744] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:09,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:09,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:28:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917440001] [2024-01-31 16:28:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:09,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:28:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:09,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:28:09,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:28:09,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2024-01-31 16:28:09,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-31 16:28:09,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:09,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2024-01-31 16:28:09,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:09,837 INFO L124 PetriNetUnfolderBase]: 556/1754 cut-off events. [2024-01-31 16:28:09,838 INFO L125 PetriNetUnfolderBase]: For 208/251 co-relation queries the response was YES. [2024-01-31 16:28:09,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 1754 events. 556/1754 cut-off events. For 208/251 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 12724 event pairs, 102 based on Foata normal form. 0/1459 useless extension candidates. Maximal degree in co-relation 2697. Up to 771 conditions per place. [2024-01-31 16:28:09,845 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 59 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2024-01-31 16:28:09,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 112 transitions, 410 flow [2024-01-31 16:28:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:28:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:28:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2024-01-31 16:28:09,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426470588235294 [2024-01-31 16:28:09,846 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 213 flow. Second operand 4 states and 303 transitions. [2024-01-31 16:28:09,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 112 transitions, 410 flow [2024-01-31 16:28:09,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 112 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:28:09,849 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 213 flow [2024-01-31 16:28:09,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2024-01-31 16:28:09,850 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2024-01-31 16:28:09,850 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 213 flow [2024-01-31 16:28:09,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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-31 16:28:09,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:09,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:28:09,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:28:09,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:09,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:09,851 INFO L85 PathProgramCache]: Analyzing trace with hash 955851321, now seen corresponding path program 1 times [2024-01-31 16:28:09,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:09,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814111231] [2024-01-31 16:28:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:09,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:09,885 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-31 16:28:09,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:09,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814111231] [2024-01-31 16:28:09,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814111231] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:09,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:28:09,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410565950] [2024-01-31 16:28:09,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:09,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:28:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:09,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:28:09,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:28:09,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2024-01-31 16:28:09,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-31 16:28:09,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:09,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2024-01-31 16:28:09,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:10,109 INFO L124 PetriNetUnfolderBase]: 884/2373 cut-off events. [2024-01-31 16:28:10,109 INFO L125 PetriNetUnfolderBase]: For 275/392 co-relation queries the response was YES. [2024-01-31 16:28:10,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4160 conditions, 2373 events. 884/2373 cut-off events. For 275/392 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 16690 event pairs, 461 based on Foata normal form. 104/2186 useless extension candidates. Maximal degree in co-relation 3957. Up to 974 conditions per place. [2024-01-31 16:28:10,118 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 59 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-01-31 16:28:10,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 107 transitions, 385 flow [2024-01-31 16:28:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:28:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:28:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2024-01-31 16:28:10,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.761437908496732 [2024-01-31 16:28:10,120 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 213 flow. Second operand 3 states and 233 transitions. [2024-01-31 16:28:10,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 107 transitions, 385 flow [2024-01-31 16:28:10,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 107 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:28:10,122 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 226 flow [2024-01-31 16:28:10,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-01-31 16:28:10,123 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2024-01-31 16:28:10,123 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 226 flow [2024-01-31 16:28:10,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-31 16:28:10,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:10,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:28:10,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:28:10,123 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:10,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2146100525, now seen corresponding path program 1 times [2024-01-31 16:28:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:10,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260986646] [2024-01-31 16:28:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:10,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:10,177 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-31 16:28:10,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:10,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260986646] [2024-01-31 16:28:10,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260986646] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:10,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:10,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:28:10,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953491723] [2024-01-31 16:28:10,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:10,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:28:10,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:10,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:28:10,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:28:10,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-01-31 16:28:10,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-31 16:28:10,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:10,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-01-31 16:28:10,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:10,784 INFO L124 PetriNetUnfolderBase]: 2878/6605 cut-off events. [2024-01-31 16:28:10,785 INFO L125 PetriNetUnfolderBase]: For 1350/1418 co-relation queries the response was YES. [2024-01-31 16:28:10,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12949 conditions, 6605 events. 2878/6605 cut-off events. For 1350/1418 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 48601 event pairs, 558 based on Foata normal form. 292/6645 useless extension candidates. Maximal degree in co-relation 12691. Up to 2466 conditions per place. [2024-01-31 16:28:10,813 INFO L140 encePairwiseOnDemand]: 89/102 looper letters, 90 selfloop transitions, 8 changer transitions 0/133 dead transitions. [2024-01-31 16:28:10,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 549 flow [2024-01-31 16:28:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:28:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:28:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 284 transitions. [2024-01-31 16:28:10,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696078431372549 [2024-01-31 16:28:10,815 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 226 flow. Second operand 4 states and 284 transitions. [2024-01-31 16:28:10,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 549 flow [2024-01-31 16:28:10,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 133 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:28:10,818 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 286 flow [2024-01-31 16:28:10,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2024-01-31 16:28:10,818 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2024-01-31 16:28:10,818 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 286 flow [2024-01-31 16:28:10,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-31 16:28:10,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:10,819 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-31 16:28:10,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:28:10,819 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:10,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash -26085961, now seen corresponding path program 1 times [2024-01-31 16:28:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:10,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152955146] [2024-01-31 16:28:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:10,878 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-31 16:28:10,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:10,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152955146] [2024-01-31 16:28:10,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152955146] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:10,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:10,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:28:10,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805638770] [2024-01-31 16:28:10,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:10,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:28:10,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:10,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:28:10,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:28:10,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 102 [2024-01-31 16:28:10,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 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-31 16:28:10,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:10,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 102 [2024-01-31 16:28:10,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:11,480 INFO L124 PetriNetUnfolderBase]: 2538/6185 cut-off events. [2024-01-31 16:28:11,480 INFO L125 PetriNetUnfolderBase]: For 2779/2903 co-relation queries the response was YES. [2024-01-31 16:28:11,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13504 conditions, 6185 events. 2538/6185 cut-off events. For 2779/2903 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 45951 event pairs, 709 based on Foata normal form. 16/6037 useless extension candidates. Maximal degree in co-relation 13252. Up to 2253 conditions per place. [2024-01-31 16:28:11,508 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 90 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2024-01-31 16:28:11,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 133 transitions, 611 flow [2024-01-31 16:28:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:28:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:28:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2024-01-31 16:28:11,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-01-31 16:28:11,511 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 286 flow. Second operand 4 states and 276 transitions. [2024-01-31 16:28:11,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 133 transitions, 611 flow [2024-01-31 16:28:11,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 133 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:28:11,517 INFO L231 Difference]: Finished difference. Result has 101 places, 93 transitions, 329 flow [2024-01-31 16:28:11,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=101, PETRI_TRANSITIONS=93} [2024-01-31 16:28:11,518 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 6 predicate places. [2024-01-31 16:28:11,518 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 329 flow [2024-01-31 16:28:11,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 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-31 16:28:11,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:11,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:28:11,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:28:11,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:11,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:11,519 INFO L85 PathProgramCache]: Analyzing trace with hash -401931381, now seen corresponding path program 1 times [2024-01-31 16:28:11,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:11,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195175806] [2024-01-31 16:28:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:11,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:11,599 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-31 16:28:11,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:11,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195175806] [2024-01-31 16:28:11,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195175806] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:11,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:11,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:28:11,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548877417] [2024-01-31 16:28:11,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:11,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:28:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:11,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:28:11,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:28:11,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 102 [2024-01-31 16:28:11,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-31 16:28:11,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:11,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 102 [2024-01-31 16:28:11,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:12,327 INFO L124 PetriNetUnfolderBase]: 3275/7240 cut-off events. [2024-01-31 16:28:12,327 INFO L125 PetriNetUnfolderBase]: For 6038/6122 co-relation queries the response was YES. [2024-01-31 16:28:12,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16980 conditions, 7240 events. 3275/7240 cut-off events. For 6038/6122 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 52618 event pairs, 558 based on Foata normal form. 50/7148 useless extension candidates. Maximal degree in co-relation 16687. Up to 2641 conditions per place. [2024-01-31 16:28:12,356 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 115 selfloop transitions, 12 changer transitions 0/159 dead transitions. [2024-01-31 16:28:12,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 159 transitions, 780 flow [2024-01-31 16:28:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:28:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:28:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2024-01-31 16:28:12,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2024-01-31 16:28:12,358 INFO L175 Difference]: Start difference. First operand has 101 places, 93 transitions, 329 flow. Second operand 5 states and 342 transitions. [2024-01-31 16:28:12,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 159 transitions, 780 flow [2024-01-31 16:28:12,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 159 transitions, 771 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:28:12,365 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 363 flow [2024-01-31 16:28:12,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=363, PETRI_PLACES=105, PETRI_TRANSITIONS=95} [2024-01-31 16:28:12,366 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 10 predicate places. [2024-01-31 16:28:12,366 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 363 flow [2024-01-31 16:28:12,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-31 16:28:12,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:12,367 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] [2024-01-31 16:28:12,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:28:12,367 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:12,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1887091080, now seen corresponding path program 1 times [2024-01-31 16:28:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:12,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585704471] [2024-01-31 16:28:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:12,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:12,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585704471] [2024-01-31 16:28:12,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585704471] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:12,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634584732] [2024-01-31 16:28:12,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:12,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:12,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:12,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:12,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-31 16:28:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:12,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-31 16:28:12,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:12,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:28:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:12,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634584732] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:28:12,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:28:12,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-01-31 16:28:12,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786825178] [2024-01-31 16:28:12,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:28:12,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:28:12,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:12,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:28:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:28:12,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 102 [2024-01-31 16:28:12,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 95 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 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-31 16:28:12,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:12,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 102 [2024-01-31 16:28:12,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:13,657 INFO L124 PetriNetUnfolderBase]: 3436/8189 cut-off events. [2024-01-31 16:28:13,657 INFO L125 PetriNetUnfolderBase]: For 4607/4727 co-relation queries the response was YES. [2024-01-31 16:28:13,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18136 conditions, 8189 events. 3436/8189 cut-off events. For 4607/4727 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 64037 event pairs, 439 based on Foata normal form. 596/8623 useless extension candidates. Maximal degree in co-relation 17791. Up to 2602 conditions per place. [2024-01-31 16:28:13,694 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 121 selfloop transitions, 7 changer transitions 0/169 dead transitions. [2024-01-31 16:28:13,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 169 transitions, 839 flow [2024-01-31 16:28:13,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:28:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:28:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2024-01-31 16:28:13,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-01-31 16:28:13,697 INFO L175 Difference]: Start difference. First operand has 105 places, 95 transitions, 363 flow. Second operand 6 states and 425 transitions. [2024-01-31 16:28:13,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 169 transitions, 839 flow [2024-01-31 16:28:13,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 169 transitions, 813 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:28:13,702 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 363 flow [2024-01-31 16:28:13,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2024-01-31 16:28:13,703 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2024-01-31 16:28:13,703 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 363 flow [2024-01-31 16:28:13,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 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-31 16:28:13,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:13,703 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] [2024-01-31 16:28:13,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-31 16:28:13,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:13,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:13,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash -598033558, now seen corresponding path program 1 times [2024-01-31 16:28:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:13,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753372627] [2024-01-31 16:28:13,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:13,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-31 16:28:13,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:13,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753372627] [2024-01-31 16:28:13,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753372627] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:13,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:13,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:28:13,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593871939] [2024-01-31 16:28:13,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:13,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:28:13,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:13,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:28:13,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:28:13,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2024-01-31 16:28:13,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-31 16:28:13,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:13,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2024-01-31 16:28:13,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:14,281 INFO L124 PetriNetUnfolderBase]: 858/3069 cut-off events. [2024-01-31 16:28:14,281 INFO L125 PetriNetUnfolderBase]: For 2047/2080 co-relation queries the response was YES. [2024-01-31 16:28:14,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6592 conditions, 3069 events. 858/3069 cut-off events. For 2047/2080 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 23349 event pairs, 341 based on Foata normal form. 102/3133 useless extension candidates. Maximal degree in co-relation 6302. Up to 767 conditions per place. [2024-01-31 16:28:14,298 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 54 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2024-01-31 16:28:14,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 111 transitions, 564 flow [2024-01-31 16:28:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:28:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:28:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2024-01-31 16:28:14,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7875816993464052 [2024-01-31 16:28:14,300 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 363 flow. Second operand 3 states and 241 transitions. [2024-01-31 16:28:14,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 111 transitions, 564 flow [2024-01-31 16:28:14,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 111 transitions, 540 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-01-31 16:28:14,306 INFO L231 Difference]: Finished difference. Result has 106 places, 91 transitions, 347 flow [2024-01-31 16:28:14,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=106, PETRI_TRANSITIONS=91} [2024-01-31 16:28:14,307 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2024-01-31 16:28:14,307 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 347 flow [2024-01-31 16:28:14,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-31 16:28:14,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:14,308 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:28:14,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 16:28:14,308 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:14,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1216540427, now seen corresponding path program 1 times [2024-01-31 16:28:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:14,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576835972] [2024-01-31 16:28:14,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:14,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:14,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576835972] [2024-01-31 16:28:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576835972] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603983093] [2024-01-31 16:28:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:14,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:14,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:14,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:14,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-31 16:28:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:14,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 16:28:14,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:14,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:28:14,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603983093] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:14,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:28:14,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-01-31 16:28:14,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510453788] [2024-01-31 16:28:14,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:14,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:28:14,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:14,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:28:14,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:28:14,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-01-31 16:28:14,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 91 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 6 states have internal predecessors, (272), 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-31 16:28:14,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:14,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-01-31 16:28:14,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:15,204 INFO L124 PetriNetUnfolderBase]: 1631/3834 cut-off events. [2024-01-31 16:28:15,204 INFO L125 PetriNetUnfolderBase]: For 2268/2374 co-relation queries the response was YES. [2024-01-31 16:28:15,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9034 conditions, 3834 events. 1631/3834 cut-off events. For 2268/2374 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 22278 event pairs, 329 based on Foata normal form. 114/3916 useless extension candidates. Maximal degree in co-relation 8774. Up to 1601 conditions per place. [2024-01-31 16:28:15,222 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 107 selfloop transitions, 14 changer transitions 1/152 dead transitions. [2024-01-31 16:28:15,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 152 transitions, 801 flow [2024-01-31 16:28:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:28:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:28:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 361 transitions. [2024-01-31 16:28:15,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5898692810457516 [2024-01-31 16:28:15,224 INFO L175 Difference]: Start difference. First operand has 106 places, 91 transitions, 347 flow. Second operand 6 states and 361 transitions. [2024-01-31 16:28:15,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 152 transitions, 801 flow [2024-01-31 16:28:15,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 152 transitions, 782 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:28:15,230 INFO L231 Difference]: Finished difference. Result has 112 places, 94 transitions, 420 flow [2024-01-31 16:28:15,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=112, PETRI_TRANSITIONS=94} [2024-01-31 16:28:15,230 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 17 predicate places. [2024-01-31 16:28:15,231 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 94 transitions, 420 flow [2024-01-31 16:28:15,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 6 states have internal predecessors, (272), 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-31 16:28:15,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:15,231 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] [2024-01-31 16:28:15,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-31 16:28:15,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-31 16:28:15,443 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:15,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2052610538, now seen corresponding path program 1 times [2024-01-31 16:28:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123726289] [2024-01-31 16:28:15,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:15,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:15,567 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-31 16:28:15,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:15,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123726289] [2024-01-31 16:28:15,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123726289] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:15,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:15,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:28:15,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430145564] [2024-01-31 16:28:15,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:15,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:28:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:15,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:28:15,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:28:15,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-01-31 16:28:15,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 94 transitions, 420 flow. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-31 16:28:15,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:15,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-01-31 16:28:15,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:15,995 INFO L124 PetriNetUnfolderBase]: 1214/3256 cut-off events. [2024-01-31 16:28:15,995 INFO L125 PetriNetUnfolderBase]: For 3832/3856 co-relation queries the response was YES. [2024-01-31 16:28:16,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8200 conditions, 3256 events. 1214/3256 cut-off events. For 3832/3856 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 20253 event pairs, 822 based on Foata normal form. 12/3190 useless extension candidates. Maximal degree in co-relation 7962. Up to 1864 conditions per place. [2024-01-31 16:28:16,011 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 87 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2024-01-31 16:28:16,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 787 flow [2024-01-31 16:28:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:28:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:28:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2024-01-31 16:28:16,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-31 16:28:16,013 INFO L175 Difference]: Start difference. First operand has 112 places, 94 transitions, 420 flow. Second operand 4 states and 272 transitions. [2024-01-31 16:28:16,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 787 flow [2024-01-31 16:28:16,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 132 transitions, 773 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:28:16,022 INFO L231 Difference]: Finished difference. Result has 115 places, 101 transitions, 515 flow [2024-01-31 16:28:16,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=515, PETRI_PLACES=115, PETRI_TRANSITIONS=101} [2024-01-31 16:28:16,022 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2024-01-31 16:28:16,022 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 101 transitions, 515 flow [2024-01-31 16:28:16,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-31 16:28:16,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:16,023 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] [2024-01-31 16:28:16,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 16:28:16,023 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:16,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1150019684, now seen corresponding path program 2 times [2024-01-31 16:28:16,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:16,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256429416] [2024-01-31 16:28:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:16,079 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-31 16:28:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:16,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256429416] [2024-01-31 16:28:16,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256429416] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:16,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:28:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294037958] [2024-01-31 16:28:16,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:16,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:28:16,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:16,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:28:16,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:28:16,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2024-01-31 16:28:16,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 101 transitions, 515 flow. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-31 16:28:16,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:16,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2024-01-31 16:28:16,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:16,495 INFO L124 PetriNetUnfolderBase]: 1228/3328 cut-off events. [2024-01-31 16:28:16,495 INFO L125 PetriNetUnfolderBase]: For 4334/4362 co-relation queries the response was YES. [2024-01-31 16:28:16,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8718 conditions, 3328 events. 1228/3328 cut-off events. For 4334/4362 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20963 event pairs, 484 based on Foata normal form. 16/3283 useless extension candidates. Maximal degree in co-relation 8475. Up to 1120 conditions per place. [2024-01-31 16:28:16,512 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 88 selfloop transitions, 14 changer transitions 0/135 dead transitions. [2024-01-31 16:28:16,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 135 transitions, 869 flow [2024-01-31 16:28:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:28:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:28:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2024-01-31 16:28:16,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6617647058823529 [2024-01-31 16:28:16,515 INFO L175 Difference]: Start difference. First operand has 115 places, 101 transitions, 515 flow. Second operand 4 states and 270 transitions. [2024-01-31 16:28:16,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 135 transitions, 869 flow [2024-01-31 16:28:16,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 135 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:28:16,534 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 586 flow [2024-01-31 16:28:16,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=586, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2024-01-31 16:28:16,535 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 22 predicate places. [2024-01-31 16:28:16,536 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 586 flow [2024-01-31 16:28:16,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-31 16:28:16,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:16,536 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, 1, 1] [2024-01-31 16:28:16,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 16:28:16,537 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:16,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1379422196, now seen corresponding path program 1 times [2024-01-31 16:28:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:16,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13479360] [2024-01-31 16:28:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:16,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-31 16:28:16,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:16,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13479360] [2024-01-31 16:28:16,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13479360] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:16,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:16,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:28:16,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244547166] [2024-01-31 16:28:16,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:16,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:28:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:28:16,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:28:16,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-01-31 16:28:16,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 586 flow. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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-31 16:28:16,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:16,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-01-31 16:28:16,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:17,195 INFO L124 PetriNetUnfolderBase]: 1337/3470 cut-off events. [2024-01-31 16:28:17,195 INFO L125 PetriNetUnfolderBase]: For 5180/5214 co-relation queries the response was YES. [2024-01-31 16:28:17,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9337 conditions, 3470 events. 1337/3470 cut-off events. For 5180/5214 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 21618 event pairs, 900 based on Foata normal form. 4/3404 useless extension candidates. Maximal degree in co-relation 9075. Up to 2020 conditions per place. [2024-01-31 16:28:17,211 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 99 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2024-01-31 16:28:17,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 145 transitions, 1010 flow [2024-01-31 16:28:17,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:28:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:28:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 311 transitions. [2024-01-31 16:28:17,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6098039215686275 [2024-01-31 16:28:17,216 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 586 flow. Second operand 5 states and 311 transitions. [2024-01-31 16:28:17,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 145 transitions, 1010 flow [2024-01-31 16:28:17,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 145 transitions, 980 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-31 16:28:17,231 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 634 flow [2024-01-31 16:28:17,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=634, PETRI_PLACES=121, PETRI_TRANSITIONS=106} [2024-01-31 16:28:17,232 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 26 predicate places. [2024-01-31 16:28:17,232 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 634 flow [2024-01-31 16:28:17,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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-31 16:28:17,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:17,233 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, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:28:17,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 16:28:17,233 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:17,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2023645167, now seen corresponding path program 1 times [2024-01-31 16:28:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:17,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709695318] [2024-01-31 16:28:17,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:17,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:17,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709695318] [2024-01-31 16:28:17,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709695318] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:17,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246789756] [2024-01-31 16:28:17,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:17,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:17,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:17,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:17,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-31 16:28:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:17,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-31 16:28:17,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:17,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:28:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:17,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246789756] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:28:17,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:28:17,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-01-31 16:28:17,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595739032] [2024-01-31 16:28:17,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:28:17,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:28:17,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:17,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:28:17,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:28:17,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-01-31 16:28:17,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 106 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 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-31 16:28:17,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:17,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-01-31 16:28:17,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:18,189 INFO L124 PetriNetUnfolderBase]: 1511/3670 cut-off events. [2024-01-31 16:28:18,190 INFO L125 PetriNetUnfolderBase]: For 6048/6097 co-relation queries the response was YES. [2024-01-31 16:28:18,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9786 conditions, 3670 events. 1511/3670 cut-off events. For 6048/6097 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 21914 event pairs, 265 based on Foata normal form. 244/3767 useless extension candidates. Maximal degree in co-relation 9494. Up to 947 conditions per place. [2024-01-31 16:28:18,208 INFO L140 encePairwiseOnDemand]: 91/102 looper letters, 122 selfloop transitions, 10 changer transitions 0/169 dead transitions. [2024-01-31 16:28:18,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 169 transitions, 1158 flow [2024-01-31 16:28:18,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:28:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:28:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2024-01-31 16:28:18,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6584967320261438 [2024-01-31 16:28:18,210 INFO L175 Difference]: Start difference. First operand has 121 places, 106 transitions, 634 flow. Second operand 6 states and 403 transitions. [2024-01-31 16:28:18,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 169 transitions, 1158 flow [2024-01-31 16:28:18,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 169 transitions, 1126 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:28:18,220 INFO L231 Difference]: Finished difference. Result has 122 places, 104 transitions, 632 flow [2024-01-31 16:28:18,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=122, PETRI_TRANSITIONS=104} [2024-01-31 16:28:18,221 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 27 predicate places. [2024-01-31 16:28:18,221 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 104 transitions, 632 flow [2024-01-31 16:28:18,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 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-31 16:28:18,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:18,221 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1] [2024-01-31 16:28:18,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-31 16:28:18,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:18,433 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:18,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1526654846, now seen corresponding path program 1 times [2024-01-31 16:28:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097451110] [2024-01-31 16:28:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:18,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:18,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097451110] [2024-01-31 16:28:18,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097451110] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:18,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132360506] [2024-01-31 16:28:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:18,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:18,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:18,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:18,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-31 16:28:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:18,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 16:28:18,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:18,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:28:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132360506] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:18,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:28:18,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-01-31 16:28:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936747371] [2024-01-31 16:28:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:18,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:28:18,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:18,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:28:18,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:28:18,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-01-31 16:28:18,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 104 transitions, 632 flow. Second operand has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 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-31 16:28:18,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:18,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-01-31 16:28:18,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:19,417 INFO L124 PetriNetUnfolderBase]: 1946/4395 cut-off events. [2024-01-31 16:28:19,417 INFO L125 PetriNetUnfolderBase]: For 7252/7274 co-relation queries the response was YES. [2024-01-31 16:28:19,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12191 conditions, 4395 events. 1946/4395 cut-off events. For 7252/7274 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 25266 event pairs, 307 based on Foata normal form. 48/4403 useless extension candidates. Maximal degree in co-relation 11894. Up to 1433 conditions per place. [2024-01-31 16:28:19,433 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 136 selfloop transitions, 20 changer transitions 0/182 dead transitions. [2024-01-31 16:28:19,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 182 transitions, 1284 flow [2024-01-31 16:28:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:28:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:28:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 372 transitions. [2024-01-31 16:28:19,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2024-01-31 16:28:19,435 INFO L175 Difference]: Start difference. First operand has 122 places, 104 transitions, 632 flow. Second operand 6 states and 372 transitions. [2024-01-31 16:28:19,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 182 transitions, 1284 flow [2024-01-31 16:28:19,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 182 transitions, 1256 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-01-31 16:28:19,446 INFO L231 Difference]: Finished difference. Result has 128 places, 110 transitions, 761 flow [2024-01-31 16:28:19,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=761, PETRI_PLACES=128, PETRI_TRANSITIONS=110} [2024-01-31 16:28:19,446 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 33 predicate places. [2024-01-31 16:28:19,446 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 110 transitions, 761 flow [2024-01-31 16:28:19,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 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-31 16:28:19,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:19,447 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1] [2024-01-31 16:28:19,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-31 16:28:19,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-01-31 16:28:19,658 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:19,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash -922523205, now seen corresponding path program 1 times [2024-01-31 16:28:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701744635] [2024-01-31 16:28:19,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:19,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:19,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701744635] [2024-01-31 16:28:19,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701744635] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:19,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729318137] [2024-01-31 16:28:19,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:19,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:19,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:19,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:19,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-31 16:28:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:19,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 16:28:19,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:20,020 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:28:20,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729318137] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:20,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:28:20,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-01-31 16:28:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64878750] [2024-01-31 16:28:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:20,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:28:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:28:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:28:20,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 102 [2024-01-31 16:28:20,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 110 transitions, 761 flow. Second operand has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 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-31 16:28:20,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:20,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 102 [2024-01-31 16:28:20,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:20,662 INFO L124 PetriNetUnfolderBase]: 1837/4247 cut-off events. [2024-01-31 16:28:20,662 INFO L125 PetriNetUnfolderBase]: For 12184/12279 co-relation queries the response was YES. [2024-01-31 16:28:20,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12834 conditions, 4247 events. 1837/4247 cut-off events. For 12184/12279 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 24436 event pairs, 474 based on Foata normal form. 62/4257 useless extension candidates. Maximal degree in co-relation 12504. Up to 1967 conditions per place. [2024-01-31 16:28:20,684 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 112 selfloop transitions, 27 changer transitions 3/170 dead transitions. [2024-01-31 16:28:20,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 170 transitions, 1366 flow [2024-01-31 16:28:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:28:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:28:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 349 transitions. [2024-01-31 16:28:20,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5702614379084967 [2024-01-31 16:28:20,686 INFO L175 Difference]: Start difference. First operand has 128 places, 110 transitions, 761 flow. Second operand 6 states and 349 transitions. [2024-01-31 16:28:20,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 170 transitions, 1366 flow [2024-01-31 16:28:20,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 170 transitions, 1322 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-01-31 16:28:20,702 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 914 flow [2024-01-31 16:28:20,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=132, PETRI_TRANSITIONS=117} [2024-01-31 16:28:20,702 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 37 predicate places. [2024-01-31 16:28:20,702 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 914 flow [2024-01-31 16:28:20,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 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-31 16:28:20,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:20,703 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1] [2024-01-31 16:28:20,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-31 16:28:20,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-01-31 16:28:20,914 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:20,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:20,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1271598340, now seen corresponding path program 2 times [2024-01-31 16:28:20,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:20,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798070283] [2024-01-31 16:28:20,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:20,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:21,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:21,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798070283] [2024-01-31 16:28:21,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798070283] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:21,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986330891] [2024-01-31 16:28:21,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 16:28:21,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:21,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:21,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:21,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-31 16:28:21,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 16:28:21,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:28:21,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-31 16:28:21,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:21,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:28:21,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986330891] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:21,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:28:21,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-01-31 16:28:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667516493] [2024-01-31 16:28:21,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:21,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:28:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:21,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:28:21,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-01-31 16:28:21,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 102 [2024-01-31 16:28:21,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 914 flow. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:28:21,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:21,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 102 [2024-01-31 16:28:21,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:21,971 INFO L124 PetriNetUnfolderBase]: 2562/5650 cut-off events. [2024-01-31 16:28:21,971 INFO L125 PetriNetUnfolderBase]: For 13890/13944 co-relation queries the response was YES. [2024-01-31 16:28:21,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17086 conditions, 5650 events. 2562/5650 cut-off events. For 13890/13944 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 34266 event pairs, 633 based on Foata normal form. 44/5641 useless extension candidates. Maximal degree in co-relation 16774. Up to 1730 conditions per place. [2024-01-31 16:28:21,998 INFO L140 encePairwiseOnDemand]: 88/102 looper letters, 126 selfloop transitions, 36 changer transitions 0/188 dead transitions. [2024-01-31 16:28:21,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 188 transitions, 1564 flow [2024-01-31 16:28:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:28:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:28:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2024-01-31 16:28:22,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6235294117647059 [2024-01-31 16:28:22,000 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 914 flow. Second operand 5 states and 318 transitions. [2024-01-31 16:28:22,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 188 transitions, 1564 flow [2024-01-31 16:28:22,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 188 transitions, 1522 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-01-31 16:28:22,022 INFO L231 Difference]: Finished difference. Result has 133 places, 126 transitions, 1046 flow [2024-01-31 16:28:22,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1046, PETRI_PLACES=133, PETRI_TRANSITIONS=126} [2024-01-31 16:28:22,023 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 38 predicate places. [2024-01-31 16:28:22,023 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 126 transitions, 1046 flow [2024-01-31 16:28:22,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:28:22,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:22,023 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2024-01-31 16:28:22,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-01-31 16:28:22,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-01-31 16:28:22,229 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:22,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1283390554, now seen corresponding path program 1 times [2024-01-31 16:28:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:22,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321261513] [2024-01-31 16:28:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:22,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:22,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321261513] [2024-01-31 16:28:22,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321261513] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:22,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422247772] [2024-01-31 16:28:22,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:22,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:22,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:22,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:22,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-31 16:28:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:22,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-31 16:28:22,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:22,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:28:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422247772] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:22,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:28:22,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-01-31 16:28:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818843962] [2024-01-31 16:28:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:22,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:28:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:28:22,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:28:22,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 102 [2024-01-31 16:28:22,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 126 transitions, 1046 flow. Second operand has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 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-31 16:28:22,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:22,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 102 [2024-01-31 16:28:22,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:23,376 INFO L124 PetriNetUnfolderBase]: 2813/6283 cut-off events. [2024-01-31 16:28:23,376 INFO L125 PetriNetUnfolderBase]: For 16972/17050 co-relation queries the response was YES. [2024-01-31 16:28:23,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20428 conditions, 6283 events. 2813/6283 cut-off events. For 16972/17050 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 39078 event pairs, 385 based on Foata normal form. 38/6254 useless extension candidates. Maximal degree in co-relation 20088. Up to 1419 conditions per place. [2024-01-31 16:28:23,411 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 160 selfloop transitions, 47 changer transitions 0/233 dead transitions. [2024-01-31 16:28:23,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 233 transitions, 2050 flow [2024-01-31 16:28:23,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:28:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:28:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 412 transitions. [2024-01-31 16:28:23,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5770308123249299 [2024-01-31 16:28:23,413 INFO L175 Difference]: Start difference. First operand has 133 places, 126 transitions, 1046 flow. Second operand 7 states and 412 transitions. [2024-01-31 16:28:23,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 233 transitions, 2050 flow [2024-01-31 16:28:23,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 233 transitions, 2009 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-31 16:28:23,443 INFO L231 Difference]: Finished difference. Result has 138 places, 144 transitions, 1368 flow [2024-01-31 16:28:23,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1368, PETRI_PLACES=138, PETRI_TRANSITIONS=144} [2024-01-31 16:28:23,443 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 43 predicate places. [2024-01-31 16:28:23,443 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 144 transitions, 1368 flow [2024-01-31 16:28:23,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 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-31 16:28:23,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:23,444 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-01-31 16:28:23,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-31 16:28:23,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:23,655 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:23,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash -918583519, now seen corresponding path program 1 times [2024-01-31 16:28:23,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:23,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911487899] [2024-01-31 16:28:23,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:23,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-31 16:28:23,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:23,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911487899] [2024-01-31 16:28:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911487899] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:23,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575654715] [2024-01-31 16:28:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:23,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:23,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:23,774 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:23,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-31 16:28:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:23,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 16:28:23,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-31 16:28:24,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:28:24,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575654715] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:24,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:28:24,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-01-31 16:28:24,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256570568] [2024-01-31 16:28:24,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:24,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:28:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:24,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:28:24,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:28:24,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-01-31 16:28:24,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 144 transitions, 1368 flow. Second operand has 6 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 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-31 16:28:24,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:24,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-01-31 16:28:24,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:24,924 INFO L124 PetriNetUnfolderBase]: 2894/6706 cut-off events. [2024-01-31 16:28:24,925 INFO L125 PetriNetUnfolderBase]: For 26041/26391 co-relation queries the response was YES. [2024-01-31 16:28:24,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22485 conditions, 6706 events. 2894/6706 cut-off events. For 26041/26391 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 43063 event pairs, 495 based on Foata normal form. 154/6768 useless extension candidates. Maximal degree in co-relation 22119. Up to 2562 conditions per place. [2024-01-31 16:28:24,958 INFO L140 encePairwiseOnDemand]: 88/102 looper letters, 161 selfloop transitions, 27 changer transitions 0/225 dead transitions. [2024-01-31 16:28:24,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 225 transitions, 2151 flow [2024-01-31 16:28:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:28:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:28:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 376 transitions. [2024-01-31 16:28:24,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6143790849673203 [2024-01-31 16:28:24,960 INFO L175 Difference]: Start difference. First operand has 138 places, 144 transitions, 1368 flow. Second operand 6 states and 376 transitions. [2024-01-31 16:28:24,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 225 transitions, 2151 flow [2024-01-31 16:28:24,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 225 transitions, 2094 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-01-31 16:28:24,991 INFO L231 Difference]: Finished difference. Result has 141 places, 153 transitions, 1493 flow [2024-01-31 16:28:24,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1493, PETRI_PLACES=141, PETRI_TRANSITIONS=153} [2024-01-31 16:28:24,992 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 46 predicate places. [2024-01-31 16:28:24,992 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 153 transitions, 1493 flow [2024-01-31 16:28:24,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 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-31 16:28:24,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:25,001 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-01-31 16:28:25,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-01-31 16:28:25,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:25,212 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:25,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1116442793, now seen corresponding path program 2 times [2024-01-31 16:28:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:25,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379460321] [2024-01-31 16:28:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 16:28:25,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:25,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379460321] [2024-01-31 16:28:25,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379460321] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:25,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961813565] [2024-01-31 16:28:25,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 16:28:25,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:25,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:25,333 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:25,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-01-31 16:28:25,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-01-31 16:28:25,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:28:25,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-31 16:28:25,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-31 16:28:25,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:28:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961813565] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:28:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-01-31 16:28:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054857071] [2024-01-31 16:28:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:25,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:28:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:25,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:28:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-01-31 16:28:25,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-01-31 16:28:25,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 153 transitions, 1493 flow. Second operand has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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-31 16:28:25,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:25,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-01-31 16:28:25,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:25,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][20], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 136#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 395#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 401#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 898#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), 1395#true, Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 64#L914-4true, 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-01-31 16:28:25,819 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is not cut-off event [2024-01-31 16:28:25,819 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:25,821 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:25,821 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:25,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][20], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 136#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 395#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 401#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 19#L915-1true, 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 898#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), 1395#true, Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-01-31 16:28:25,824 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is not cut-off event [2024-01-31 16:28:25,824 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:25,824 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:25,824 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:26,312 INFO L124 PetriNetUnfolderBase]: 3017/7212 cut-off events. [2024-01-31 16:28:26,312 INFO L125 PetriNetUnfolderBase]: For 28460/28864 co-relation queries the response was YES. [2024-01-31 16:28:26,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25084 conditions, 7212 events. 3017/7212 cut-off events. For 28460/28864 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 47880 event pairs, 1072 based on Foata normal form. 156/7242 useless extension candidates. Maximal degree in co-relation 24717. Up to 2653 conditions per place. [2024-01-31 16:28:26,356 INFO L140 encePairwiseOnDemand]: 89/102 looper letters, 130 selfloop transitions, 45 changer transitions 0/217 dead transitions. [2024-01-31 16:28:26,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 217 transitions, 2164 flow [2024-01-31 16:28:26,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:28:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:28:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 316 transitions. [2024-01-31 16:28:26,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6196078431372549 [2024-01-31 16:28:26,358 INFO L175 Difference]: Start difference. First operand has 141 places, 153 transitions, 1493 flow. Second operand 5 states and 316 transitions. [2024-01-31 16:28:26,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 217 transitions, 2164 flow [2024-01-31 16:28:26,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 217 transitions, 2125 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-01-31 16:28:26,400 INFO L231 Difference]: Finished difference. Result has 145 places, 163 transitions, 1674 flow [2024-01-31 16:28:26,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1674, PETRI_PLACES=145, PETRI_TRANSITIONS=163} [2024-01-31 16:28:26,401 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 50 predicate places. [2024-01-31 16:28:26,401 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 163 transitions, 1674 flow [2024-01-31 16:28:26,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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-31 16:28:26,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:26,402 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-01-31 16:28:26,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-01-31 16:28:26,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:26,612 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:26,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2067823209, now seen corresponding path program 3 times [2024-01-31 16:28:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894340038] [2024-01-31 16:28:26,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:26,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:26,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894340038] [2024-01-31 16:28:26,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894340038] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:26,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133977784] [2024-01-31 16:28:26,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-31 16:28:26,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:26,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:26,730 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:26,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-01-31 16:28:26,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-01-31 16:28:26,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:28:26,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-31 16:28:26,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-31 16:28:26,923 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:28:26,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133977784] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:26,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:28:26,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-01-31 16:28:26,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755251724] [2024-01-31 16:28:26,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:26,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:28:26,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:28:26,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-01-31 16:28:27,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-01-31 16:28:27,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 163 transitions, 1674 flow. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 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-31 16:28:27,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:27,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-01-31 16:28:27,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:27,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 136#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 395#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 401#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 898#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), Black: 1548#(= ~num~0 1), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 1565#(and (= ~num~0 1) (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), 1395#true, Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 64#L914-4true, 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-01-31 16:28:27,307 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is not cut-off event [2024-01-31 16:28:27,307 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:27,307 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:27,308 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:27,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 136#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 395#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 401#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 19#L915-1true, 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 898#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), Black: 1548#(= ~num~0 1), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 1565#(and (= ~num~0 1) (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1395#true, Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-01-31 16:28:27,310 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is not cut-off event [2024-01-31 16:28:27,310 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:27,311 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:27,311 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:27,832 INFO L124 PetriNetUnfolderBase]: 3040/7396 cut-off events. [2024-01-31 16:28:27,832 INFO L125 PetriNetUnfolderBase]: For 33804/34266 co-relation queries the response was YES. [2024-01-31 16:28:27,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27472 conditions, 7396 events. 3040/7396 cut-off events. For 33804/34266 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 49954 event pairs, 392 based on Foata normal form. 164/7419 useless extension candidates. Maximal degree in co-relation 27093. Up to 2164 conditions per place. [2024-01-31 16:28:27,881 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 134 selfloop transitions, 50 changer transitions 0/226 dead transitions. [2024-01-31 16:28:27,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 226 transitions, 2517 flow [2024-01-31 16:28:27,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:28:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:28:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 303 transitions. [2024-01-31 16:28:27,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5941176470588235 [2024-01-31 16:28:27,883 INFO L175 Difference]: Start difference. First operand has 145 places, 163 transitions, 1674 flow. Second operand 5 states and 303 transitions. [2024-01-31 16:28:27,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 226 transitions, 2517 flow [2024-01-31 16:28:27,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 226 transitions, 2400 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-01-31 16:28:27,933 INFO L231 Difference]: Finished difference. Result has 143 places, 175 transitions, 1870 flow [2024-01-31 16:28:27,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1870, PETRI_PLACES=143, PETRI_TRANSITIONS=175} [2024-01-31 16:28:27,933 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 48 predicate places. [2024-01-31 16:28:27,933 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 175 transitions, 1870 flow [2024-01-31 16:28:27,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 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-31 16:28:27,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:27,934 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-01-31 16:28:27,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-01-31 16:28:28,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-01-31 16:28:28,135 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:28,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:28,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1615796025, now seen corresponding path program 1 times [2024-01-31 16:28:28,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:28,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992621405] [2024-01-31 16:28:28,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:28,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 16:28:28,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:28,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992621405] [2024-01-31 16:28:28,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992621405] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:28,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050868] [2024-01-31 16:28:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:28,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:28,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:28,319 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:28,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-01-31 16:28:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:28,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-31 16:28:28,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 16:28:28,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:28:28,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050868] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:28,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:28:28,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-01-31 16:28:28,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882602117] [2024-01-31 16:28:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:28,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:28:28,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:28,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:28:28,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-01-31 16:28:28,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 102 [2024-01-31 16:28:28,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 175 transitions, 1870 flow. Second operand has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 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-31 16:28:28,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:28,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 102 [2024-01-31 16:28:28,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:29,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 1725#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), Black: 1548#(= ~num~0 1), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 1824#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 64#L914-4true, 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-01-31 16:28:29,078 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is not cut-off event [2024-01-31 16:28:29,078 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:29,078 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:29,078 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:29,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 54#L879-4true, Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1725#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), Black: 407#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 19#L915-1true, 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), 37#L895-4true, Black: 1548#(= ~num~0 1), Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 1824#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-01-31 16:28:29,083 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is not cut-off event [2024-01-31 16:28:29,083 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:29,083 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:29,083 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:30,081 INFO L124 PetriNetUnfolderBase]: 4703/10354 cut-off events. [2024-01-31 16:28:30,082 INFO L125 PetriNetUnfolderBase]: For 50685/51143 co-relation queries the response was YES. [2024-01-31 16:28:30,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41143 conditions, 10354 events. 4703/10354 cut-off events. For 50685/51143 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 70709 event pairs, 977 based on Foata normal form. 150/10300 useless extension candidates. Maximal degree in co-relation 40745. Up to 3181 conditions per place. [2024-01-31 16:28:30,147 INFO L140 encePairwiseOnDemand]: 89/102 looper letters, 193 selfloop transitions, 59 changer transitions 0/286 dead transitions. [2024-01-31 16:28:30,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 286 transitions, 3254 flow [2024-01-31 16:28:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:28:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:28:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 402 transitions. [2024-01-31 16:28:30,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5630252100840336 [2024-01-31 16:28:30,149 INFO L175 Difference]: Start difference. First operand has 143 places, 175 transitions, 1870 flow. Second operand 7 states and 402 transitions. [2024-01-31 16:28:30,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 286 transitions, 3254 flow [2024-01-31 16:28:30,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 286 transitions, 3224 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-01-31 16:28:30,215 INFO L231 Difference]: Finished difference. Result has 151 places, 192 transitions, 2345 flow [2024-01-31 16:28:30,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2345, PETRI_PLACES=151, PETRI_TRANSITIONS=192} [2024-01-31 16:28:30,216 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 56 predicate places. [2024-01-31 16:28:30,216 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 192 transitions, 2345 flow [2024-01-31 16:28:30,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 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-31 16:28:30,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:30,216 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-01-31 16:28:30,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-01-31 16:28:30,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-01-31 16:28:30,428 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:30,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash -187484203, now seen corresponding path program 2 times [2024-01-31 16:28:30,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:30,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290560850] [2024-01-31 16:28:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:30,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:28:30,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:30,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290560850] [2024-01-31 16:28:30,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290560850] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:28:30,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912726591] [2024-01-31 16:28:30,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 16:28:30,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:28:30,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:28:30,588 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:28:30,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-01-31 16:28:30,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-01-31 16:28:30,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:28:30,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-31 16:28:30,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:28:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-31 16:28:30,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 16:28:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912726591] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:30,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 16:28:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-01-31 16:28:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917084809] [2024-01-31 16:28:30,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:30,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:28:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:30,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:28:30,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-01-31 16:28:30,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 102 [2024-01-31 16:28:30,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 192 transitions, 2345 flow. Second operand has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 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-31 16:28:30,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:30,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 102 [2024-01-31 16:28:30,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:32,198 INFO L124 PetriNetUnfolderBase]: 4423/10343 cut-off events. [2024-01-31 16:28:32,199 INFO L125 PetriNetUnfolderBase]: For 62098/62622 co-relation queries the response was YES. [2024-01-31 16:28:32,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41875 conditions, 10343 events. 4423/10343 cut-off events. For 62098/62622 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 73436 event pairs, 873 based on Foata normal form. 258/10389 useless extension candidates. Maximal degree in co-relation 41467. Up to 2087 conditions per place. [2024-01-31 16:28:32,269 INFO L140 encePairwiseOnDemand]: 91/102 looper letters, 158 selfloop transitions, 72 changer transitions 0/272 dead transitions. [2024-01-31 16:28:32,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 272 transitions, 3387 flow [2024-01-31 16:28:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:28:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:28:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2024-01-31 16:28:32,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5620915032679739 [2024-01-31 16:28:32,270 INFO L175 Difference]: Start difference. First operand has 151 places, 192 transitions, 2345 flow. Second operand 6 states and 344 transitions. [2024-01-31 16:28:32,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 272 transitions, 3387 flow [2024-01-31 16:28:32,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 272 transitions, 3365 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-31 16:28:32,347 INFO L231 Difference]: Finished difference. Result has 155 places, 202 transitions, 2675 flow [2024-01-31 16:28:32,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2314, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2675, PETRI_PLACES=155, PETRI_TRANSITIONS=202} [2024-01-31 16:28:32,348 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 60 predicate places. [2024-01-31 16:28:32,348 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 202 transitions, 2675 flow [2024-01-31 16:28:32,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 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-31 16:28:32,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:32,348 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-01-31 16:28:32,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-01-31 16:28:32,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-01-31 16:28:32,559 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:32,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1904732439, now seen corresponding path program 1 times [2024-01-31 16:28:32,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:32,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905183105] [2024-01-31 16:28:32,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:32,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-01-31 16:28:32,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:32,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905183105] [2024-01-31 16:28:32,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905183105] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:32,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:32,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:28:32,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403867760] [2024-01-31 16:28:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:32,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:28:32,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:32,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:28:32,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:28:32,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 102 [2024-01-31 16:28:32,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 202 transitions, 2675 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 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-31 16:28:32,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:32,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 102 [2024-01-31 16:28:32,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:33,844 INFO L124 PetriNetUnfolderBase]: 4034/9387 cut-off events. [2024-01-31 16:28:33,845 INFO L125 PetriNetUnfolderBase]: For 85015/85609 co-relation queries the response was YES. [2024-01-31 16:28:33,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39918 conditions, 9387 events. 4034/9387 cut-off events. For 85015/85609 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 65141 event pairs, 585 based on Foata normal form. 382/9491 useless extension candidates. Maximal degree in co-relation 39548. Up to 5018 conditions per place. [2024-01-31 16:28:33,908 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 188 selfloop transitions, 18 changer transitions 0/270 dead transitions. [2024-01-31 16:28:33,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 270 transitions, 3907 flow [2024-01-31 16:28:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:28:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:28:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2024-01-31 16:28:33,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6627450980392157 [2024-01-31 16:28:33,921 INFO L175 Difference]: Start difference. First operand has 155 places, 202 transitions, 2675 flow. Second operand 5 states and 338 transitions. [2024-01-31 16:28:33,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 270 transitions, 3907 flow [2024-01-31 16:28:33,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 270 transitions, 3903 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:28:33,994 INFO L231 Difference]: Finished difference. Result has 157 places, 200 transitions, 2692 flow [2024-01-31 16:28:33,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2656, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2692, PETRI_PLACES=157, PETRI_TRANSITIONS=200} [2024-01-31 16:28:33,995 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 62 predicate places. [2024-01-31 16:28:33,995 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 200 transitions, 2692 flow [2024-01-31 16:28:33,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 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-31 16:28:33,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:33,996 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:28:33,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-31 16:28:33,997 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:33,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:33,997 INFO L85 PathProgramCache]: Analyzing trace with hash 797549030, now seen corresponding path program 1 times [2024-01-31 16:28:33,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:33,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585170507] [2024-01-31 16:28:33,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:33,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:28:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-01-31 16:28:34,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:28:34,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585170507] [2024-01-31 16:28:34,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585170507] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:28:34,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:28:34,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:28:34,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551259918] [2024-01-31 16:28:34,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:28:34,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:28:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:28:34,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:28:34,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:28:34,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 102 [2024-01-31 16:28:34,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 200 transitions, 2692 flow. Second operand has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:28:34,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:28:34,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 102 [2024-01-31 16:28:34,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:28:34,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 54#L879-4true, 2142#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 2148#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (<= thread2Thread1of1ForFork1_~j~0 2)), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 2136#(and (= ~num~0 0) (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1909#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1758#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 1725#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), Black: 1760#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 2110#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 2097#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), 37#L895-4true, Black: 1548#(= ~num~0 1), Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 1824#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 64#L914-4true, 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-01-31 16:28:34,459 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is not cut-off event [2024-01-31 16:28:34,460 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:34,460 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:34,460 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is not cut-off event [2024-01-31 16:28:34,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L879-1-->L879-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|))) (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet4_1| 0) (= (select .cse0 |v_~#m~0.offset_25|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex][26], [Black: 1072#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 111#(and (= thread1Thread1of1ForFork0_~arg.offset 0) (= |thread1Thread1of1ForFork0_#in~arg.base| 0) (= thread1Thread1of1ForFork0_~arg.base 0) (= |thread1Thread1of1ForFork0_#in~arg.offset| 0)), Black: 126#true, Black: 302#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 645#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (< 0 thread2Thread1of1ForFork1_~j~0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 531#(and (or (and (<= thread2Thread1of1ForFork1_~j~0 3) (<= 1 thread2Thread1of1ForFork1_~j~0)) (= thread2Thread1of1ForFork1_~j~0 0)) (= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 1057#(and (<= thread1Thread1of1ForFork0_~i~0 2) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), Black: 394#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 54#L879-4true, 2142#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 2148#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 654#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 1074#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 794#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 653#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 2136#(and (= ~num~0 0) (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1909#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1758#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 1725#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), Black: 1760#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 2110#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 405#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 2097#(<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0), 19#L915-1true, 1735#(and (or (= thread2Thread1of1ForFork1_~j~0 0) (and (<= 1 thread2Thread1of1ForFork1_~j~0) (<= thread2Thread1of1ForFork1_~j~0 2))) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 121#(and (= |thread2Thread1of1ForFork1_#in~arg.base| 0) (= |thread2Thread1of1ForFork1_#in~arg.offset| 0) (= thread2Thread1of1ForFork1_~arg.base 0) (= thread2Thread1of1ForFork1_~arg.offset 0)), Black: 793#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 0)), Black: 221#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0)), Black: 1548#(= ~num~0 1), 37#L895-4true, Black: 290#(and (<= thread1Thread1of1ForFork0_~i~0 2) (= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (or (< 0 thread1Thread1of1ForFork0_~i~0) (= thread1Thread1of1ForFork0_~i~0 0))), 1824#(and (<= 0 thread2Thread1of1ForFork1_~j~0) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), Black: 1555#(and (= ~num~0 1) (<= (mod (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 0)), 655#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 2) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 104#(and (= ~total~0 0) (= ~flag~0 0) (= ~num~0 0)), 148#(and (= thread1Thread1of1ForFork0_~i~0 1) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), Black: 1053#(and (or (= thread1Thread1of1ForFork0_~i~0 0) (and (<= thread1Thread1of1ForFork0_~i~0 3) (<= 1 thread1Thread1of1ForFork0_~i~0))) (<= (mod (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 0) (= ~num~0 0)), Black: 1046#(= ~num~0 0), Black: 1222#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1) (<= thread2Thread1of1ForFork1_~j~0 2)), Black: 1221#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= ~num~0 1)), Black: 114#(and (= thread1Thread1of1ForFork0_~i~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296))), 141#(= ~num~0 0), 1220#(and (<= 1 thread2Thread1of1ForFork1_~j~0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), 135#(= ~num~0 0), 413#(and (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296)) (= thread2Thread1of1ForFork1_~j~0 1)), Black: 124#(and (= thread2Thread1of1ForFork1_~j~0 0) (= (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) (* (div (+ thread2Thread1of1ForFork1_~arg.base thread2Thread1of1ForFork1_~arg.offset) 4294967296) 4294967296))), Black: 1073#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (= ~num~0 0) (= (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) (* (div (+ thread1Thread1of1ForFork0_~arg.base thread1Thread1of1ForFork0_~arg.offset) 4294967296) 4294967296)))]) [2024-01-31 16:28:34,465 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is not cut-off event [2024-01-31 16:28:34,465 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:34,465 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:34,465 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2024-01-31 16:28:35,173 INFO L124 PetriNetUnfolderBase]: 3756/8996 cut-off events. [2024-01-31 16:28:35,174 INFO L125 PetriNetUnfolderBase]: For 71148/71723 co-relation queries the response was YES. [2024-01-31 16:28:35,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38501 conditions, 8996 events. 3756/8996 cut-off events. For 71148/71723 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 64194 event pairs, 691 based on Foata normal form. 383/9103 useless extension candidates. Maximal degree in co-relation 38103. Up to 4630 conditions per place. [2024-01-31 16:28:35,234 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 158 selfloop transitions, 26 changer transitions 0/238 dead transitions. [2024-01-31 16:28:35,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 238 transitions, 3410 flow [2024-01-31 16:28:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:28:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:28:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 325 transitions. [2024-01-31 16:28:35,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2024-01-31 16:28:35,236 INFO L175 Difference]: Start difference. First operand has 157 places, 200 transitions, 2692 flow. Second operand 5 states and 325 transitions. [2024-01-31 16:28:35,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 238 transitions, 3410 flow [2024-01-31 16:28:35,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 238 transitions, 3340 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-31 16:28:35,315 INFO L231 Difference]: Finished difference. Result has 154 places, 197 transitions, 2686 flow [2024-01-31 16:28:35,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2634, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2686, PETRI_PLACES=154, PETRI_TRANSITIONS=197} [2024-01-31 16:28:35,316 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 59 predicate places. [2024-01-31 16:28:35,316 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 197 transitions, 2686 flow [2024-01-31 16:28:35,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:28:35,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:28:35,316 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-31 16:28:35,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-01-31 16:28:35,316 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-31 16:28:35,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:28:35,317 INFO L85 PathProgramCache]: Analyzing trace with hash 990134852, now seen corresponding path program 1 times [2024-01-31 16:28:35,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:28:35,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670261418] [2024-01-31 16:28:35,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:28:35,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:28:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:28:35,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 16:28:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:28:35,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 16:28:35,390 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 16:28:35,390 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (54 of 55 remaining) [2024-01-31 16:28:35,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 55 remaining) [2024-01-31 16:28:35,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 55 remaining) [2024-01-31 16:28:35,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 55 remaining) [2024-01-31 16:28:35,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 55 remaining) [2024-01-31 16:28:35,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 55 remaining) [2024-01-31 16:28:35,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 55 remaining) [2024-01-31 16:28:35,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 55 remaining) [2024-01-31 16:28:35,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 55 remaining) [2024-01-31 16:28:35,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 55 remaining) [2024-01-31 16:28:35,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 55 remaining) [2024-01-31 16:28:35,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 55 remaining) [2024-01-31 16:28:35,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 55 remaining) [2024-01-31 16:28:35,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 55 remaining) [2024-01-31 16:28:35,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 55 remaining) [2024-01-31 16:28:35,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 55 remaining) [2024-01-31 16:28:35,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 55 remaining) [2024-01-31 16:28:35,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 55 remaining) [2024-01-31 16:28:35,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 55 remaining) [2024-01-31 16:28:35,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 55 remaining) [2024-01-31 16:28:35,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 55 remaining) [2024-01-31 16:28:35,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 55 remaining) [2024-01-31 16:28:35,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 55 remaining) [2024-01-31 16:28:35,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 55 remaining) [2024-01-31 16:28:35,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 55 remaining) [2024-01-31 16:28:35,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 55 remaining) [2024-01-31 16:28:35,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 55 remaining) [2024-01-31 16:28:35,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 55 remaining) [2024-01-31 16:28:35,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 55 remaining) [2024-01-31 16:28:35,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 55 remaining) [2024-01-31 16:28:35,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 55 remaining) [2024-01-31 16:28:35,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 55 remaining) [2024-01-31 16:28:35,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 55 remaining) [2024-01-31 16:28:35,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 55 remaining) [2024-01-31 16:28:35,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 55 remaining) [2024-01-31 16:28:35,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 55 remaining) [2024-01-31 16:28:35,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 55 remaining) [2024-01-31 16:28:35,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 55 remaining) [2024-01-31 16:28:35,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 55 remaining) [2024-01-31 16:28:35,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 55 remaining) [2024-01-31 16:28:35,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 55 remaining) [2024-01-31 16:28:35,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 55 remaining) [2024-01-31 16:28:35,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 55 remaining) [2024-01-31 16:28:35,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 55 remaining) [2024-01-31 16:28:35,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 55 remaining) [2024-01-31 16:28:35,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 55 remaining) [2024-01-31 16:28:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 55 remaining) [2024-01-31 16:28:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 55 remaining) [2024-01-31 16:28:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 55 remaining) [2024-01-31 16:28:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 55 remaining) [2024-01-31 16:28:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 55 remaining) [2024-01-31 16:28:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 55 remaining) [2024-01-31 16:28:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 55 remaining) [2024-01-31 16:28:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 55 remaining) [2024-01-31 16:28:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 55 remaining) [2024-01-31 16:28:35,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-01-31 16:28:35,398 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:28:35,402 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 16:28:35,402 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 16:28:35,499 INFO L503 ceAbstractionStarter]: Automizer considered 29 witness invariants [2024-01-31 16:28:35,503 INFO L504 ceAbstractionStarter]: WitnessConsidered=29 [2024-01-31 16:28:35,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:28:35 BasicIcfg [2024-01-31 16:28:35,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 16:28:35,504 INFO L158 Benchmark]: Toolchain (without parser) took 29206.40ms. Allocated memory was 159.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 79.1MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-01-31 16:28:35,504 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 110.3MB in the beginning and 110.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:28:35,504 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 159.4MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:28:35,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 720.96ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 78.9MB in the beginning and 161.3MB in the end (delta: -82.4MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-01-31 16:28:35,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.00ms. Allocated memory is still 232.8MB. Free memory was 161.3MB in the beginning and 158.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 16:28:35,505 INFO L158 Benchmark]: Boogie Preprocessor took 67.30ms. Allocated memory is still 232.8MB. Free memory was 158.2MB in the beginning and 155.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 16:28:35,505 INFO L158 Benchmark]: RCFGBuilder took 701.16ms. Allocated memory is still 232.8MB. Free memory was 155.0MB in the beginning and 90.0MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-01-31 16:28:35,505 INFO L158 Benchmark]: TraceAbstraction took 27660.50ms. Allocated memory was 232.8MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 88.9MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-01-31 16:28:35,507 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 110.3MB in the beginning and 110.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.07ms. Allocated memory is still 159.4MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 720.96ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 78.9MB in the beginning and 161.3MB in the end (delta: -82.4MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.00ms. Allocated memory is still 232.8MB. Free memory was 161.3MB in the beginning and 158.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.30ms. Allocated memory is still 232.8MB. Free memory was 158.2MB in the beginning and 155.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 701.16ms. Allocated memory is still 232.8MB. Free memory was 155.0MB in the beginning and 90.0MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 27660.50ms. Allocated memory was 232.8MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 88.9MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L908] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] [L908] 0 num = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L909] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] [L909] 0 total = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L910] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] [L911] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L912] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L913] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]]]]] [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L876] 1 int i; VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L877] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L879] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L915] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L890] 2 int j; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L891] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L892] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[3]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L893] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L880] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[num]],BinaryExpression[COMPLEQ,IdentifierExpression[num],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L883] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L894] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[num]],BinaryExpression[COMPLEQ,IdentifierExpression[num],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L884] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L896] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L897] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L899] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L878] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L879] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L892] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[3]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L880] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[num]],BinaryExpression[COMPLEQ,IdentifierExpression[num],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L883] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L893] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L894] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[num]],BinaryExpression[COMPLEQ,IdentifierExpression[num],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L896] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=1] [L884] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=1] [L897] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=1] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=1] [L899] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=1] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L878] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L879] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L892] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[3]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L880] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[num]],BinaryExpression[COMPLEQ,IdentifierExpression[num],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L883] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L893] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L894] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[num]],BinaryExpression[COMPLEQ,IdentifierExpression[num],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L896] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=3] [L884] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=3] [L897] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=3] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=3] [L899] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=3] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L878] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L878] COND FALSE 1 !(i < 3) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L887] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=3] [L916] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]]] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[3]]]]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L902] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[3]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L902] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L903] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[3]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L903] 2 flag = 1 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L904] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[3]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L917] COND TRUE 0 \read(flag) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] - UnprovableResult [Line: 877]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 887]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 882]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 883]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 884]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 891]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 892]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 893]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 903]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 896]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 895]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 897]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 898]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 899]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 900]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 908]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 909]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 910]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 911]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 912]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 913]: 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: 914]: 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, 161 locations, 55 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: 27.4s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4103 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3048 mSDsluCounter, 817 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 476 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6811 IncrementalHoareTripleChecker+Invalid, 7287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 476 mSolverCounterUnsat, 395 mSDtfsCounter, 6811 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 721 GetRequests, 606 SyntacticMatches, 8 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2692occurred in iteration=25, InterpolantAutomatonStates: 127, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1638 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1550 ConstructedInterpolants, 0 QuantifiedInterpolants, 14086 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3908 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 40 InterpolantComputations, 24 PerfectInterpolantSequences, 295/385 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-31 16:28:35,544 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