./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-1_2-join.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/race-1_2-join.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/ldv-races/race-1_2-join.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/race-1_2-join.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 23:20:22,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 23:20:22,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 23:20:22,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 23:20:22,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 23:20:22,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 23:20:22,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 23:20:22,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 23:20:22,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 23:20:22,258 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 23:20:22,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 23:20:22,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 23:20:22,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 23:20:22,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 23:20:22,262 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 23:20:22,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 23:20:22,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 23:20:22,263 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 23:20:22,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 23:20:22,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 23:20:22,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 23:20:22,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 23:20:22,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 23:20:22,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 23:20:22,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 23:20:22,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 23:20:22,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 23:20:22,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 23:20:22,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 23:20:22,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 23:20:22,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 23:20:22,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 23:20:22,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:20:22,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 23:20:22,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 23:20:22,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 23:20:22,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 23:20:22,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 23:20:22,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 23:20:22,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 23:20:22,273 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 23:20:22,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 23:20:22,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 23:20:22,274 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 23:20:22,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 23:20:22,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 23:20:22,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 23:20:22,575 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 23:20:22,575 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 23:20:22,577 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/race-1_2-join.yml/witness.yml [2024-01-29 23:20:22,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 23:20:22,704 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 23:20:22,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-1_2-join.i [2024-01-29 23:20:23,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 23:20:24,225 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 23:20:24,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_2-join.i [2024-01-29 23:20:24,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3650bcd/2bea801b65a0437aa2b985b4956a4e13/FLAG4bf914660 [2024-01-29 23:20:24,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3650bcd/2bea801b65a0437aa2b985b4956a4e13 [2024-01-29 23:20:24,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 23:20:24,274 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 23:20:24,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 23:20:24,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 23:20:24,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 23:20:24,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:20:22" (1/2) ... [2024-01-29 23:20:24,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da5cff2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:20:24, skipping insertion in model container [2024-01-29 23:20:24,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:20:22" (1/2) ... [2024-01-29 23:20:24,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5fb316ed and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:20:24, skipping insertion in model container [2024-01-29 23:20:24,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:20:24" (2/2) ... [2024-01-29 23:20:24,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da5cff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:24, skipping insertion in model container [2024-01-29 23:20:24,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:20:24" (2/2) ... [2024-01-29 23:20:24,285 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 23:20:24,427 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 23:20:24,433 INFO L98 nessWitnessExtractor]: Location invariant before [L1730-L1730] (unsigned long )status == 0UL [2024-01-29 23:20:24,433 INFO L98 nessWitnessExtractor]: Location invariant before [L1723-L1723] pdev == 3 [2024-01-29 23:20:24,433 INFO L98 nessWitnessExtractor]: Location invariant before [L1700-L1700] (unsigned long )arg == 0UL [2024-01-29 23:20:24,434 INFO L98 nessWitnessExtractor]: Location invariant before [L1708-L1708] pdev == 0 [2024-01-29 23:20:24,434 INFO L98 nessWitnessExtractor]: Location invariant before [L1731-L1731] (unsigned long )status == 0UL [2024-01-29 23:20:24,434 INFO L98 nessWitnessExtractor]: Location invariant before [L1729-L1729] (unsigned long )status == 0UL [2024-01-29 23:20:24,434 INFO L98 nessWitnessExtractor]: Location invariant before [L1721-L1721] pdev == 1 [2024-01-29 23:20:24,434 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] (((0 <= pdev) && (pdev <= 6)) && ((unsigned long )arg == 0UL)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,434 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] ((0 <= pdev) && (pdev <= 6)) && ((unsigned long )arg == 0UL) [2024-01-29 23:20:24,435 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] (0 <= pdev) && (pdev <= 6) [2024-01-29 23:20:24,435 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] ((0 <= pdev) && (pdev <= 6)) && (pdev <= 127) [2024-01-29 23:20:24,435 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] 0 <= pdev [2024-01-29 23:20:24,435 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,435 INFO L98 nessWitnessExtractor]: Location invariant before [L1703-L1703] (((0 <= pdev) && (pdev <= 6)) && ((unsigned long )arg == 0UL)) && (pdev != 0) [2024-01-29 23:20:24,435 INFO L98 nessWitnessExtractor]: Location invariant before [L1718-L1718] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 6) [2024-01-29 23:20:24,436 INFO L98 nessWitnessExtractor]: Location invariant before [L1718-L1718] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,436 INFO L98 nessWitnessExtractor]: Location invariant before [L1718-L1718] (((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127) [2024-01-29 23:20:24,436 INFO L98 nessWitnessExtractor]: Location invariant before [L1718-L1718] (((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev != 0) [2024-01-29 23:20:24,436 INFO L98 nessWitnessExtractor]: Location invariant before [L1718-L1718] (((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,436 INFO L98 nessWitnessExtractor]: Location invariant before [L1718-L1718] 0 <= pdev [2024-01-29 23:20:24,436 INFO L98 nessWitnessExtractor]: Location invariant before [L1704-L1704] (unsigned long )arg == 0UL [2024-01-29 23:20:24,437 INFO L98 nessWitnessExtractor]: Location invariant before [L1714-L1714] ((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0) [2024-01-29 23:20:24,437 INFO L98 nessWitnessExtractor]: Location invariant before [L1714-L1714] (((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127) [2024-01-29 23:20:24,437 INFO L98 nessWitnessExtractor]: Location invariant before [L1714-L1714] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,437 INFO L98 nessWitnessExtractor]: Location invariant before [L1714-L1714] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 6) [2024-01-29 23:20:24,438 INFO L98 nessWitnessExtractor]: Location invariant before [L1714-L1714] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,438 INFO L98 nessWitnessExtractor]: Location invariant before [L1714-L1714] 0 <= pdev [2024-01-29 23:20:24,438 INFO L98 nessWitnessExtractor]: Location invariant before [L1715-L1715] 0 <= pdev [2024-01-29 23:20:24,438 INFO L98 nessWitnessExtractor]: Location invariant before [L1715-L1715] (0 <= pdev) && (pdev <= 127) [2024-01-29 23:20:24,439 INFO L98 nessWitnessExtractor]: Location invariant before [L1715-L1715] (0 <= pdev) && (pdev != 0) [2024-01-29 23:20:24,468 INFO L98 nessWitnessExtractor]: Location invariant before [L1715-L1715] (0 <= pdev) && (pdev <= 6) [2024-01-29 23:20:24,468 INFO L98 nessWitnessExtractor]: Location invariant before [L1715-L1715] (0 <= pdev) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,471 INFO L98 nessWitnessExtractor]: Location invariant before [L1715-L1715] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,471 INFO L98 nessWitnessExtractor]: Location invariant before [L1722-L1722] pdev == 3 [2024-01-29 23:20:24,471 INFO L98 nessWitnessExtractor]: Location invariant before [L1724-L1724] pdev == 3 [2024-01-29 23:20:24,471 INFO L98 nessWitnessExtractor]: Location invariant before [L1711-L1720] pdev == 1 [2024-01-29 23:20:24,471 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L22] pdev == 1 [2024-01-29 23:20:24,471 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,471 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] ((0 <= pdev) && (1 <= pdev)) && ((unsigned long )arg == 0UL) [2024-01-29 23:20:24,472 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 6) [2024-01-29 23:20:24,472 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 127) [2024-01-29 23:20:24,472 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] 0 <= pdev [2024-01-29 23:20:24,472 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] ((0 <= pdev) && (1 <= pdev)) && (pdev != 0) [2024-01-29 23:20:24,472 INFO L98 nessWitnessExtractor]: Location invariant before [L1702-L1702] ((0 <= pdev) && (1 <= pdev)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,472 INFO L98 nessWitnessExtractor]: Location invariant before [L1695-L1695] (((((((((0 <= pdev && 1 <= pdev) && pdev <= 3) && pdev <= 127) && expression == 1) && pdev % 2 == 1) && pdev != 0) && (pdev == 1 || pdev == 3)) || ((0 <= expression && expression <= 1) && (expression == 0 || expression == 1))) || ((((((((0 <= expression && 0 <= pdev) && 1 <= pdev) && expression <= 1) && pdev <= 6) && pdev <= 127) && pdev != 0) && (expression == 0 || expression == 1)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6))) && (expression == 1) [2024-01-29 23:20:24,472 INFO L98 nessWitnessExtractor]: Location invariant before [L1695-L1695] ((((((((0 <= pdev && 1 <= pdev) && pdev <= 3) && pdev <= 127) && expression == 1) && pdev % 2 == 1) && pdev != 0) && (pdev == 1 || pdev == 3)) || ((0 <= expression && expression <= 1) && (expression == 0 || expression == 1))) || ((((((((0 <= expression && 0 <= pdev) && 1 <= pdev) && expression <= 1) && pdev <= 6) && pdev <= 127) && pdev != 0) && (expression == 0 || expression == 1)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6)) [2024-01-29 23:20:24,472 INFO L98 nessWitnessExtractor]: Location invariant before [L1695-L1695] (((((((((0 <= pdev && 1 <= pdev) && pdev <= 3) && pdev <= 127) && expression == 1) && pdev % 2 == 1) && pdev != 0) && (pdev == 1 || pdev == 3)) || ((0 <= expression && expression <= 1) && (expression == 0 || expression == 1))) || ((((((((0 <= expression && 0 <= pdev) && 1 <= pdev) && expression <= 1) && pdev <= 6) && pdev <= 127) && pdev != 0) && (expression == 0 || expression == 1)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6))) && (expression == 0) [2024-01-29 23:20:24,472 INFO L98 nessWitnessExtractor]: Location invariant before [L1709-L1709] pdev == 0 [2024-01-29 23:20:24,472 INFO L98 nessWitnessExtractor]: Location invariant before [L1717-L1717] (0 <= pdev) && (1 <= pdev) [2024-01-29 23:20:24,473 INFO L98 nessWitnessExtractor]: Location invariant before [L1717-L1717] ((0 <= pdev) && (1 <= pdev)) && (pdev != 0) [2024-01-29 23:20:24,473 INFO L98 nessWitnessExtractor]: Location invariant before [L1717-L1717] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 6) [2024-01-29 23:20:24,473 INFO L98 nessWitnessExtractor]: Location invariant before [L1717-L1717] ((0 <= pdev) && (1 <= pdev)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6) [2024-01-29 23:20:24,473 INFO L98 nessWitnessExtractor]: Location invariant before [L1717-L1717] ((0 <= pdev) && (1 <= pdev)) && (pdev <= 127) [2024-01-29 23:20:24,473 INFO L98 nessWitnessExtractor]: Location invariant before [L1717-L1717] 0 <= pdev [2024-01-29 23:20:24,473 INFO L98 nessWitnessExtractor]: Location invariant before [L1710-L1710] pdev == 1 [2024-01-29 23:20:24,473 INFO L98 nessWitnessExtractor]: Location invariant before [L1705-L1705] (unsigned long )arg == 0UL [2024-01-29 23:20:24,473 INFO L98 nessWitnessExtractor]: Location invariant after [L1726-L1732] (unsigned long )status == 0UL [2024-01-29 23:20:24,473 INFO L98 nessWitnessExtractor]: Location invariant before [L1712-L1712] pdev == 1 [2024-01-29 23:20:24,474 INFO L98 nessWitnessExtractor]: Location invariant before [L1701-L1701] (unsigned long )arg == 0UL [2024-01-29 23:20:24,576 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 23:20:25,330 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_2-join.i[76153,76166] [2024-01-29 23:20:25,368 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:20:25,381 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 23:20:25,390 WARN L424 MainDispatcher]: Unable to annotate typedef unsigned int __mode_t; with a witness entry [2024-01-29 23:20:25,431 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_2-join.i[76153,76166] [2024-01-29 23:20:25,432 WARN L424 MainDispatcher]: Unable to annotate void ldv_assert(int expression) { if (!expression) { ERROR: {reach_error();abort();}}; return; } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 23:20:25,504 WARN L424 MainDispatcher]: Unable to annotate void module_exit() { void *status; pthread_join(t1, &status); pthread_mutex_destroy(&mutex); pdev = 5; ldv_assert(pdev==5); } with a witness entry [2024-01-29 23:20:25,505 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:20:25,607 INFO L206 MainTranslator]: Completed translation [2024-01-29 23:20:25,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25 WrapperNode [2024-01-29 23:20:25,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 23:20:25,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 23:20:25,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 23:20:25,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 23:20:25,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,696 INFO L138 Inliner]: procedures = 483, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-01-29 23:20:25,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 23:20:25,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 23:20:25,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 23:20:25,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 23:20:25,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,741 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 3, 5, 4]. 36 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 1, 5, 0]. The 2 writes are split as follows [0, 1, 0, 1]. [2024-01-29 23:20:25,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 23:20:25,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 23:20:25,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 23:20:25,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 23:20:25,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (1/1) ... [2024-01-29 23:20:25,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:20:25,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 23:20:25,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 23:20:25,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 23:20:25,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 23:20:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 23:20:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 23:20:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 23:20:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 23:20:25,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 23:20:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 23:20:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 23:20:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 23:20:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-01-29 23:20:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-01-29 23:20:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-01-29 23:20:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-01-29 23:20:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 23:20:25,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 23:20:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 23:20:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-01-29 23:20:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-01-29 23:20:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-01-29 23:20:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-01-29 23:20:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 23:20:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 23:20:25,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 23:20:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 23:20:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 23:20:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 23:20:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 23:20:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 23:20:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 23:20:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 23:20:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 23:20:25,880 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 23:20:26,167 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 23:20:26,169 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 23:20:26,479 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 23:20:26,479 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 23:20:26,902 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 23:20:26,902 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 23:20:26,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:20:26 BoogieIcfgContainer [2024-01-29 23:20:26,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 23:20:26,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 23:20:26,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 23:20:26,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 23:20:26,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:20:22" (1/4) ... [2024-01-29 23:20:26,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f53fcd2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:20:26, skipping insertion in model container [2024-01-29 23:20:26,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:20:24" (2/4) ... [2024-01-29 23:20:26,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f53fcd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:20:26, skipping insertion in model container [2024-01-29 23:20:26,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:20:25" (3/4) ... [2024-01-29 23:20:26,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f53fcd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:20:26, skipping insertion in model container [2024-01-29 23:20:26,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:20:26" (4/4) ... [2024-01-29 23:20:26,916 INFO L112 eAbstractionObserver]: Analyzing ICFG race-1_2-join.i [2024-01-29 23:20:26,934 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 23:20:26,934 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-01-29 23:20:26,934 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 23:20:27,017 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-29 23:20:27,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 107 transitions, 221 flow [2024-01-29 23:20:27,101 INFO L124 PetriNetUnfolderBase]: 4/110 cut-off events. [2024-01-29 23:20:27,103 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 23:20:27,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 4/110 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 396 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 35. Up to 3 conditions per place. [2024-01-29 23:20:27,106 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 107 transitions, 221 flow [2024-01-29 23:20:27,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 102 transitions, 210 flow [2024-01-29 23:20:27,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 23:20:27,129 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;@27613d2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 23:20:27,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2024-01-29 23:20:27,132 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 23:20:27,133 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 23:20:27,133 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:20:27,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:27,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 23:20:27,134 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:27,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash 21981, now seen corresponding path program 1 times [2024-01-29 23:20:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:27,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053670713] [2024-01-29 23:20:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:20:27,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:27,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053670713] [2024-01-29 23:20:27,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053670713] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:27,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:20:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490680352] [2024-01-29 23:20:27,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:27,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:27,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:27,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:27,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:27,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 107 [2024-01-29 23:20:27,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 102 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:27,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:27,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 107 [2024-01-29 23:20:27,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:27,813 INFO L124 PetriNetUnfolderBase]: 88/253 cut-off events. [2024-01-29 23:20:27,813 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 23:20:27,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 253 events. 88/253 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1449 event pairs, 84 based on Foata normal form. 2/148 useless extension candidates. Maximal degree in co-relation 415. Up to 206 conditions per place. [2024-01-29 23:20:27,818 INFO L140 encePairwiseOnDemand]: 69/107 looper letters, 41 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2024-01-29 23:20:27,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 73 transitions, 240 flow [2024-01-29 23:20:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2024-01-29 23:20:27,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.573208722741433 [2024-01-29 23:20:27,832 INFO L175 Difference]: Start difference. First operand has 104 places, 102 transitions, 210 flow. Second operand 3 states and 184 transitions. [2024-01-29 23:20:27,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 73 transitions, 240 flow [2024-01-29 23:20:27,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 73 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:27,838 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 153 flow [2024-01-29 23:20:27,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2024-01-29 23:20:27,843 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -30 predicate places. [2024-01-29 23:20:27,843 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 153 flow [2024-01-29 23:20:27,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:27,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:27,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 23:20:27,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 23:20:27,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:27,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash 21147423, now seen corresponding path program 1 times [2024-01-29 23:20:27,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:27,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130214892] [2024-01-29 23:20:27,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:27,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:20:27,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:27,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130214892] [2024-01-29 23:20:27,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130214892] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:27,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:27,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:20:27,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416488084] [2024-01-29 23:20:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:27,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:27,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:27,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:27,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:27,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 107 [2024-01-29 23:20:27,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:27,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:27,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 107 [2024-01-29 23:20:27,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:28,066 INFO L124 PetriNetUnfolderBase]: 72/243 cut-off events. [2024-01-29 23:20:28,067 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-29 23:20:28,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 243 events. 72/243 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1245 event pairs, 46 based on Foata normal form. 4/167 useless extension candidates. Maximal degree in co-relation 436. Up to 170 conditions per place. [2024-01-29 23:20:28,070 INFO L140 encePairwiseOnDemand]: 94/107 looper letters, 41 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2024-01-29 23:20:28,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 249 flow [2024-01-29 23:20:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2024-01-29 23:20:28,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392523364485981 [2024-01-29 23:20:28,077 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 153 flow. Second operand 3 states and 141 transitions. [2024-01-29 23:20:28,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 249 flow [2024-01-29 23:20:28,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 235 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:28,082 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 165 flow [2024-01-29 23:20:28,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2024-01-29 23:20:28,083 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -33 predicate places. [2024-01-29 23:20:28,084 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 165 flow [2024-01-29 23:20:28,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:28,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:28,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 23:20:28,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 23:20:28,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:28,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1152142128, now seen corresponding path program 1 times [2024-01-29 23:20:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:28,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742644960] [2024-01-29 23:20:28,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:28,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:20:28,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:28,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742644960] [2024-01-29 23:20:28,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742644960] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:28,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:28,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:20:28,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313090978] [2024-01-29 23:20:28,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:28,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:20:28,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:28,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:20:28,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:20:28,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 107 [2024-01-29 23:20:28,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:28,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:28,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 107 [2024-01-29 23:20:28,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:28,381 INFO L124 PetriNetUnfolderBase]: 72/238 cut-off events. [2024-01-29 23:20:28,381 INFO L125 PetriNetUnfolderBase]: For 22/25 co-relation queries the response was YES. [2024-01-29 23:20:28,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 238 events. 72/238 cut-off events. For 22/25 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1202 event pairs, 55 based on Foata normal form. 2/163 useless extension candidates. Maximal degree in co-relation 454. Up to 170 conditions per place. [2024-01-29 23:20:28,385 INFO L140 encePairwiseOnDemand]: 97/107 looper letters, 40 selfloop transitions, 8 changer transitions 0/66 dead transitions. [2024-01-29 23:20:28,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 259 flow [2024-01-29 23:20:28,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:20:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:20:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-01-29 23:20:28,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.308411214953271 [2024-01-29 23:20:28,387 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 165 flow. Second operand 5 states and 165 transitions. [2024-01-29 23:20:28,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 259 flow [2024-01-29 23:20:28,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:28,389 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 166 flow [2024-01-29 23:20:28,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2024-01-29 23:20:28,391 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -35 predicate places. [2024-01-29 23:20:28,391 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 166 flow [2024-01-29 23:20:28,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:28,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:28,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:28,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 23:20:28,392 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:28,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:28,393 INFO L85 PathProgramCache]: Analyzing trace with hash -770128185, now seen corresponding path program 1 times [2024-01-29 23:20:28,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:28,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459066106] [2024-01-29 23:20:28,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:20:28,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459066106] [2024-01-29 23:20:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459066106] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:28,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:20:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606350975] [2024-01-29 23:20:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:28,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:28,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 107 [2024-01-29 23:20:28,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:28,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:28,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 107 [2024-01-29 23:20:28,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:28,539 INFO L124 PetriNetUnfolderBase]: 72/232 cut-off events. [2024-01-29 23:20:28,540 INFO L125 PetriNetUnfolderBase]: For 23/26 co-relation queries the response was YES. [2024-01-29 23:20:28,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 232 events. 72/232 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1195 event pairs, 69 based on Foata normal form. 2/156 useless extension candidates. Maximal degree in co-relation 257. Up to 181 conditions per place. [2024-01-29 23:20:28,542 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 37 selfloop transitions, 0 changer transitions 6/60 dead transitions. [2024-01-29 23:20:28,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 244 flow [2024-01-29 23:20:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2024-01-29 23:20:28,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4143302180685358 [2024-01-29 23:20:28,543 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 166 flow. Second operand 3 states and 133 transitions. [2024-01-29 23:20:28,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 244 flow [2024-01-29 23:20:28,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 23:20:28,545 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 132 flow [2024-01-29 23:20:28,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-01-29 23:20:28,546 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2024-01-29 23:20:28,546 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 132 flow [2024-01-29 23:20:28,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:28,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:28,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:28,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 23:20:28,547 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:28,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1361490901, now seen corresponding path program 1 times [2024-01-29 23:20:28,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:28,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345278025] [2024-01-29 23:20:28,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:28,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:20:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345278025] [2024-01-29 23:20:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345278025] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:28,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:28,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:20:28,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279142388] [2024-01-29 23:20:28,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:28,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:20:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:28,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:20:28,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:20:28,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 107 [2024-01-29 23:20:28,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:28,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:28,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 107 [2024-01-29 23:20:28,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:28,785 INFO L124 PetriNetUnfolderBase]: 72/226 cut-off events. [2024-01-29 23:20:28,785 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-01-29 23:20:28,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 226 events. 72/226 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1008 event pairs, 28 based on Foata normal form. 52/217 useless extension candidates. Maximal degree in co-relation 448. Up to 159 conditions per place. [2024-01-29 23:20:28,787 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 46 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-01-29 23:20:28,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 242 flow [2024-01-29 23:20:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:20:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:20:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2024-01-29 23:20:28,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3901869158878505 [2024-01-29 23:20:28,788 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 132 flow. Second operand 4 states and 167 transitions. [2024-01-29 23:20:28,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 242 flow [2024-01-29 23:20:28,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 242 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 23:20:28,790 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 126 flow [2024-01-29 23:20:28,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-01-29 23:20:28,791 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -49 predicate places. [2024-01-29 23:20:28,791 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 126 flow [2024-01-29 23:20:28,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:28,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:28,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:28,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 23:20:28,792 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:28,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:28,793 INFO L85 PathProgramCache]: Analyzing trace with hash 743382368, now seen corresponding path program 1 times [2024-01-29 23:20:28,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:28,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810734038] [2024-01-29 23:20:28,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:28,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:20:28,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:28,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810734038] [2024-01-29 23:20:28,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810734038] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:28,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:28,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:20:28,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152803710] [2024-01-29 23:20:28,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:28,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:28,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:28,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:28,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 107 [2024-01-29 23:20:28,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:28,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:28,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 107 [2024-01-29 23:20:28,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:28,943 INFO L124 PetriNetUnfolderBase]: 54/183 cut-off events. [2024-01-29 23:20:28,943 INFO L125 PetriNetUnfolderBase]: For 8/11 co-relation queries the response was YES. [2024-01-29 23:20:28,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 183 events. 54/183 cut-off events. For 8/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 827 event pairs, 20 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 365. Up to 99 conditions per place. [2024-01-29 23:20:28,945 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 38 selfloop transitions, 5 changer transitions 4/60 dead transitions. [2024-01-29 23:20:28,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 241 flow [2024-01-29 23:20:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2024-01-29 23:20:28,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672897196261682 [2024-01-29 23:20:28,946 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 126 flow. Second operand 3 states and 150 transitions. [2024-01-29 23:20:28,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 241 flow [2024-01-29 23:20:28,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:28,948 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 151 flow [2024-01-29 23:20:28,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-01-29 23:20:28,949 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -48 predicate places. [2024-01-29 23:20:28,949 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 151 flow [2024-01-29 23:20:28,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:28,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:28,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:28,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 23:20:28,950 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:28,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:28,950 INFO L85 PathProgramCache]: Analyzing trace with hash -527840395, now seen corresponding path program 1 times [2024-01-29 23:20:28,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:28,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317627269] [2024-01-29 23:20:28,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:28,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:20:29,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:29,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317627269] [2024-01-29 23:20:29,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317627269] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:29,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:29,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:20:29,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529835308] [2024-01-29 23:20:29,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:29,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:29,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:29,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:29,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:29,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 107 [2024-01-29 23:20:29,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:29,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:29,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 107 [2024-01-29 23:20:29,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:29,075 INFO L124 PetriNetUnfolderBase]: 38/139 cut-off events. [2024-01-29 23:20:29,075 INFO L125 PetriNetUnfolderBase]: For 47/50 co-relation queries the response was YES. [2024-01-29 23:20:29,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 139 events. 38/139 cut-off events. For 47/50 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 548 event pairs, 34 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 318. Up to 114 conditions per place. [2024-01-29 23:20:29,076 INFO L140 encePairwiseOnDemand]: 104/107 looper letters, 32 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2024-01-29 23:20:29,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 209 flow [2024-01-29 23:20:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2024-01-29 23:20:29,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40498442367601245 [2024-01-29 23:20:29,077 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 151 flow. Second operand 3 states and 130 transitions. [2024-01-29 23:20:29,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 209 flow [2024-01-29 23:20:29,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 197 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-29 23:20:29,079 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 133 flow [2024-01-29 23:20:29,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-01-29 23:20:29,080 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -52 predicate places. [2024-01-29 23:20:29,080 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 133 flow [2024-01-29 23:20:29,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:29,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:29,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:29,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 23:20:29,081 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:29,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash -527840393, now seen corresponding path program 1 times [2024-01-29 23:20:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:29,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355653233] [2024-01-29 23:20:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:29,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:20:29,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:29,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355653233] [2024-01-29 23:20:29,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355653233] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:29,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:29,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:20:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725826442] [2024-01-29 23:20:29,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:29,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:29,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:29,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 107 [2024-01-29 23:20:29,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:29,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:29,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 107 [2024-01-29 23:20:29,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:29,210 INFO L124 PetriNetUnfolderBase]: 32/124 cut-off events. [2024-01-29 23:20:29,210 INFO L125 PetriNetUnfolderBase]: For 12/15 co-relation queries the response was YES. [2024-01-29 23:20:29,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 124 events. 32/124 cut-off events. For 12/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 442 event pairs, 28 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 263. Up to 97 conditions per place. [2024-01-29 23:20:29,211 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 29 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2024-01-29 23:20:29,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 181 flow [2024-01-29 23:20:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-01-29 23:20:29,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3987538940809969 [2024-01-29 23:20:29,212 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 133 flow. Second operand 3 states and 128 transitions. [2024-01-29 23:20:29,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 181 flow [2024-01-29 23:20:29,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:20:29,214 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 122 flow [2024-01-29 23:20:29,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-01-29 23:20:29,215 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -54 predicate places. [2024-01-29 23:20:29,215 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 122 flow [2024-01-29 23:20:29,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:29,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:29,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:29,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 23:20:29,215 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:29,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash -527840392, now seen corresponding path program 1 times [2024-01-29 23:20:29,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:29,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841669091] [2024-01-29 23:20:29,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:29,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:20:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:20:29,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:20:29,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841669091] [2024-01-29 23:20:29,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841669091] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:20:29,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:20:29,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:20:29,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404719515] [2024-01-29 23:20:29,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:20:29,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:20:29,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:20:29,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:20:29,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:20:29,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 107 [2024-01-29 23:20:29,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:29,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:20:29,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 107 [2024-01-29 23:20:29,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:20:29,350 INFO L124 PetriNetUnfolderBase]: 25/115 cut-off events. [2024-01-29 23:20:29,350 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2024-01-29 23:20:29,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 115 events. 25/115 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 374 event pairs, 7 based on Foata normal form. 3/115 useless extension candidates. Maximal degree in co-relation 233. Up to 52 conditions per place. [2024-01-29 23:20:29,351 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 31 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-01-29 23:20:29,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 197 flow [2024-01-29 23:20:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:20:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:20:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2024-01-29 23:20:29,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236760124610592 [2024-01-29 23:20:29,353 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 122 flow. Second operand 3 states and 136 transitions. [2024-01-29 23:20:29,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 197 flow [2024-01-29 23:20:29,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:20:29,354 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 117 flow [2024-01-29 23:20:29,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-01-29 23:20:29,355 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -55 predicate places. [2024-01-29 23:20:29,355 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 117 flow [2024-01-29 23:20:29,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:20:29,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:20:29,356 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-29 23:20:29,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 23:20:29,356 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 74 more)] === [2024-01-29 23:20:29,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:20:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1485946690, now seen corresponding path program 1 times [2024-01-29 23:20:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:20:29,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956397723] [2024-01-29 23:20:29,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:20:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:20:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:20:29,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 23:20:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:20:29,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 23:20:29,408 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 23:20:29,409 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (76 of 77 remaining) [2024-01-29 23:20:29,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 77 remaining) [2024-01-29 23:20:29,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 77 remaining) [2024-01-29 23:20:29,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 77 remaining) [2024-01-29 23:20:29,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 77 remaining) [2024-01-29 23:20:29,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 77 remaining) [2024-01-29 23:20:29,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 77 remaining) [2024-01-29 23:20:29,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 77 remaining) [2024-01-29 23:20:29,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 77 remaining) [2024-01-29 23:20:29,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 77 remaining) [2024-01-29 23:20:29,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 77 remaining) [2024-01-29 23:20:29,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 77 remaining) [2024-01-29 23:20:29,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 77 remaining) [2024-01-29 23:20:29,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 77 remaining) [2024-01-29 23:20:29,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 77 remaining) [2024-01-29 23:20:29,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 77 remaining) [2024-01-29 23:20:29,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 77 remaining) [2024-01-29 23:20:29,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 77 remaining) [2024-01-29 23:20:29,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 77 remaining) [2024-01-29 23:20:29,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 77 remaining) [2024-01-29 23:20:29,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 77 remaining) [2024-01-29 23:20:29,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 77 remaining) [2024-01-29 23:20:29,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (54 of 77 remaining) [2024-01-29 23:20:29,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 77 remaining) [2024-01-29 23:20:29,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 77 remaining) [2024-01-29 23:20:29,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 77 remaining) [2024-01-29 23:20:29,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 77 remaining) [2024-01-29 23:20:29,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 77 remaining) [2024-01-29 23:20:29,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 77 remaining) [2024-01-29 23:20:29,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 77 remaining) [2024-01-29 23:20:29,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 77 remaining) [2024-01-29 23:20:29,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 77 remaining) [2024-01-29 23:20:29,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 77 remaining) [2024-01-29 23:20:29,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 77 remaining) [2024-01-29 23:20:29,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 77 remaining) [2024-01-29 23:20:29,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 77 remaining) [2024-01-29 23:20:29,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 77 remaining) [2024-01-29 23:20:29,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 77 remaining) [2024-01-29 23:20:29,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 77 remaining) [2024-01-29 23:20:29,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (37 of 77 remaining) [2024-01-29 23:20:29,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 77 remaining) [2024-01-29 23:20:29,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 77 remaining) [2024-01-29 23:20:29,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 77 remaining) [2024-01-29 23:20:29,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 77 remaining) [2024-01-29 23:20:29,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 77 remaining) [2024-01-29 23:20:29,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 77 remaining) [2024-01-29 23:20:29,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 77 remaining) [2024-01-29 23:20:29,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 77 remaining) [2024-01-29 23:20:29,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 77 remaining) [2024-01-29 23:20:29,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 77 remaining) [2024-01-29 23:20:29,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 77 remaining) [2024-01-29 23:20:29,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 77 remaining) [2024-01-29 23:20:29,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 77 remaining) [2024-01-29 23:20:29,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 77 remaining) [2024-01-29 23:20:29,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 77 remaining) [2024-01-29 23:20:29,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 77 remaining) [2024-01-29 23:20:29,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 77 remaining) [2024-01-29 23:20:29,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (19 of 77 remaining) [2024-01-29 23:20:29,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 77 remaining) [2024-01-29 23:20:29,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 77 remaining) [2024-01-29 23:20:29,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 77 remaining) [2024-01-29 23:20:29,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 77 remaining) [2024-01-29 23:20:29,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 77 remaining) [2024-01-29 23:20:29,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 77 remaining) [2024-01-29 23:20:29,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 77 remaining) [2024-01-29 23:20:29,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 77 remaining) [2024-01-29 23:20:29,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 77 remaining) [2024-01-29 23:20:29,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 77 remaining) [2024-01-29 23:20:29,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 77 remaining) [2024-01-29 23:20:29,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 77 remaining) [2024-01-29 23:20:29,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 77 remaining) [2024-01-29 23:20:29,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 77 remaining) [2024-01-29 23:20:29,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 77 remaining) [2024-01-29 23:20:29,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 77 remaining) [2024-01-29 23:20:29,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 77 remaining) [2024-01-29 23:20:29,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 77 remaining) [2024-01-29 23:20:29,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 77 remaining) [2024-01-29 23:20:29,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 23:20:29,443 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:20:29,449 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 23:20:29,449 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 23:20:29,472 INFO L503 ceAbstractionStarter]: Automizer considered 54 witness invariants [2024-01-29 23:20:29,472 INFO L504 ceAbstractionStarter]: WitnessConsidered=54 [2024-01-29 23:20:29,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:20:29 BasicIcfg [2024-01-29 23:20:29,473 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 23:20:29,474 INFO L158 Benchmark]: Toolchain (without parser) took 5200.31ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 91.9MB in the beginning and 174.9MB in the end (delta: -83.0MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,474 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:20:29,474 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 44.6MB in the beginning and 44.5MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:20:29,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1334.14ms. Allocated memory is still 159.4MB. Free memory was 91.8MB in the beginning and 69.5MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.06ms. Allocated memory is still 159.4MB. Free memory was 69.5MB in the beginning and 125.5MB in the end (delta: -56.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,475 INFO L158 Benchmark]: Boogie Preprocessor took 66.53ms. Allocated memory is still 159.4MB. Free memory was 125.5MB in the beginning and 121.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,476 INFO L158 Benchmark]: RCFGBuilder took 1130.28ms. Allocated memory is still 159.4MB. Free memory was 121.3MB in the beginning and 77.3MB in the end (delta: 44.0MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,476 INFO L158 Benchmark]: TraceAbstraction took 2565.79ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 76.2MB in the beginning and 174.9MB in the end (delta: -98.6MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2024-01-29 23:20:29,477 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.20ms. Allocated memory is still 96.5MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 44.6MB in the beginning and 44.5MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1334.14ms. Allocated memory is still 159.4MB. Free memory was 91.8MB in the beginning and 69.5MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.06ms. Allocated memory is still 159.4MB. Free memory was 69.5MB in the beginning and 125.5MB in the end (delta: -56.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.53ms. Allocated memory is still 159.4MB. Free memory was 125.5MB in the beginning and 121.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1130.28ms. Allocated memory is still 159.4MB. Free memory was 121.3MB in the beginning and 77.3MB in the end (delta: 44.0MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2565.79ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 76.2MB in the beginning and 174.9MB in the end (delta: -98.6MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1695]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1696] 0 pthread_t t1; [L1696] 0 pthread_t t1; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1698] 0 int pdev; [L1734] CALL 0 module_init() [L1708] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]] [L1709] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]] [L1709] 0 pdev = 1 VAL [mutex={4:0}, pdev=1, t1={3:0}] [L1710] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]]]] [L1710] CALL 0 ldv_assert(pdev==1) [L1695] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, mutex={4:0}, pdev=1, t1={3:0}] [L1710] RET 0 ldv_assert(pdev==1) [L1711] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]]]] [L1711] COND TRUE 0 __VERIFIER_nondet_int() [L1712] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]]]] [L1712] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1700] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1714] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]]]] [L1714] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]]]] [L1714] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]] [L1714] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1714] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]]]] [L1714] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]]] [L1714] 0 pdev = 2 [L1715] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]]]] [L1715] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1715] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]] [L1715] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]]] [L1715] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]]]] [L1715] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=2, t1={3:0}] [L1701] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=2, t1={3:0}] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]]]] [L1702] 1 pdev = 6 [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=6, t1={3:0}] [L1717] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]]]] [L1717] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]]]] [L1717] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1717] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]] [L1717] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]]] [L1717] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]]]] [L1717] CALL 0 ldv_assert(pdev==2) [L1695] COND TRUE 0 !expression [L1695] 0 reach_error() VAL [\old(expression)=0, arg={0:0}, arg={0:0}, expression=0, mutex={4:0}, pdev=6, t1={3:0}] - UnprovableResult [Line: 1700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1704]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1712]: 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 3 procedures, 133 locations, 77 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: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 397 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 741 IncrementalHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 32 mSDtfsCounter, 741 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=0, InterpolantAutomatonStates: 30, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 23:20:29,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE