./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/stateful01-1.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/stateful01-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/stateful01-1.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/stateful01-1.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:00:43,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 23:00:43,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 23:00:43,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 23:00:43,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 23:00:43,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 23:00:43,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 23:00:43,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 23:00:43,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 23:00:43,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 23:00:43,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 23:00:43,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 23:00:43,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 23:00:43,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 23:00:43,657 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 23:00:43,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 23:00:43,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 23:00:43,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 23:00:43,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 23:00:43,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 23:00:43,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 23:00:43,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 23:00:43,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 23:00:43,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 23:00:43,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 23:00:43,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 23:00:43,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 23:00:43,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 23:00:43,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 23:00:43,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 23:00:43,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 23:00:43,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 23:00:43,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:00:43,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 23:00:43,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 23:00:43,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 23:00:43,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 23:00:43,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 23:00:43,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 23:00:43,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 23:00:43,664 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 23:00:43,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 23:00:43,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 23:00:43,665 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:00:43,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 23:00:43,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 23:00:43,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 23:00:43,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 23:00:43,917 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 23:00:43,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stateful01-1.i [2024-01-29 23:00:45,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 23:00:45,423 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 23:00:45,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i [2024-01-29 23:00:45,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47619565d/8827aea866e44615b79ef1a4ec69a81f/FLAGf495c652e [2024-01-29 23:00:45,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47619565d/8827aea866e44615b79ef1a4ec69a81f [2024-01-29 23:00:45,454 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 23:00:45,454 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 23:00:45,455 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/stateful01-1.yml/witness.yml [2024-01-29 23:00:45,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 23:00:45,547 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 23:00:45,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 23:00:45,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 23:00:45,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 23:00:45,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:00:45" (1/2) ... [2024-01-29 23:00:45,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476c0726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:45, skipping insertion in model container [2024-01-29 23:00:45,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:00:45" (1/2) ... [2024-01-29 23:00:45,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@17a0fbce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:00:45, skipping insertion in model container [2024-01-29 23:00:45,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:00:45" (2/2) ... [2024-01-29 23:00:45,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476c0726 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:45, skipping insertion in model container [2024-01-29 23:00:45,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:00:45" (2/2) ... [2024-01-29 23:00:45,556 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 23:00:45,595 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 23:00:45,596 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (unsigned long )arg == 0UL [2024-01-29 23:00:45,596 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-01-29 23:00:45,596 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] 10 <= data1 [2024-01-29 23:00:45,597 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] data1 == 0 [2024-01-29 23:00:45,597 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] (data1 == 0) && (data2 == 0) [2024-01-29 23:00:45,597 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (unsigned long )arg == 0UL [2024-01-29 23:00:45,597 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] (11 <= data1) && ((unsigned long )arg == 0UL) [2024-01-29 23:00:45,597 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] 11 <= data1 [2024-01-29 23:00:45,597 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] 10 <= data1 [2024-01-29 23:00:45,597 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-01-29 23:00:45,597 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (15 <= data1) && ((unsigned long )arg == 0UL) [2024-01-29 23:00:45,598 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] 15 <= data1 [2024-01-29 23:00:45,598 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] ((10 <= data1) && (data2 <= 2147483641)) && ((unsigned long )arg == 0UL) [2024-01-29 23:00:45,598 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] (10 <= data1) && (data2 <= 2147483641) [2024-01-29 23:00:45,598 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] 10 <= data1 [2024-01-29 23:00:45,598 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] (unsigned long )arg == 0UL [2024-01-29 23:00:45,598 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] data1 == 10 [2024-01-29 23:00:45,598 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] (data1 == 10) && (data2 == 10) [2024-01-29 23:00:45,599 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] 10 <= data1 [2024-01-29 23:00:45,599 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-01-29 23:00:45,599 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] -2147483647 <= data2 [2024-01-29 23:00:45,600 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (-2147483647 <= data2) && (10 <= data1) [2024-01-29 23:00:45,600 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (-2147483647 <= data2) && ((unsigned long )arg == 0UL) [2024-01-29 23:00:45,600 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L712] (unsigned long )arg == 0UL [2024-01-29 23:00:45,600 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] (data1 == 10) && (data2 == 0) [2024-01-29 23:00:45,600 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] data1 == 10 [2024-01-29 23:00:45,600 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] (unsigned long )arg == 0UL [2024-01-29 23:00:45,600 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] (data1 == 0) && (data2 == 0) [2024-01-29 23:00:45,600 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] data1 == 0 [2024-01-29 23:00:45,601 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] 10 <= data1 [2024-01-29 23:00:45,601 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-01-29 23:00:45,601 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (data1 == 0) && (data2 == 0) [2024-01-29 23:00:45,601 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] data1 == 0 [2024-01-29 23:00:45,601 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] (unsigned long )arg == 0UL [2024-01-29 23:00:45,641 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 23:00:45,915 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i[30826,30839] [2024-01-29 23:00:45,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:00:45,927 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 23:00:46,009 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i[30826,30839] [2024-01-29 23:00:46,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:00:46,040 INFO L206 MainTranslator]: Completed translation [2024-01-29 23:00:46,041 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46 WrapperNode [2024-01-29 23:00:46,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 23:00:46,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 23:00:46,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 23:00:46,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 23:00:46,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,088 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2024-01-29 23:00:46,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 23:00:46,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 23:00:46,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 23:00:46,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 23:00:46,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,137 INFO L175 MemorySlicer]: Split 16 memory accesses to 5 slices as follows [2, 5, 5, 2, 2]. 31 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0, 0]. The 2 writes are split as follows [0, 0, 0, 1, 1]. [2024-01-29 23:00:46,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 23:00:46,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 23:00:46,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 23:00:46,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 23:00:46,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (1/1) ... [2024-01-29 23:00:46,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:00:46,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 23:00:46,253 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:00:46,255 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:00:46,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 23:00:46,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 23:00:46,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 23:00:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 23:00:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-29 23:00:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 23:00:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 23:00:46,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 23:00:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 23:00:46,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 23:00:46,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 23:00:46,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 23:00:46,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 23:00:46,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-29 23:00:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 23:00:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 23:00:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 23:00:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 23:00:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 23:00:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 23:00:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 23:00:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 23:00:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-29 23:00:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 23:00:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 23:00:46,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 23:00:46,295 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:00:46,498 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 23:00:46,500 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 23:00:46,985 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 23:00:46,986 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 23:00:47,142 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 23:00:47,142 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 23:00:47,143 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:00:47 BoogieIcfgContainer [2024-01-29 23:00:47,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 23:00:47,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 23:00:47,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 23:00:47,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 23:00:47,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:00:45" (1/4) ... [2024-01-29 23:00:47,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e8ea86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:00:47, skipping insertion in model container [2024-01-29 23:00:47,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:00:45" (2/4) ... [2024-01-29 23:00:47,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e8ea86 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:00:47, skipping insertion in model container [2024-01-29 23:00:47,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:00:46" (3/4) ... [2024-01-29 23:00:47,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e8ea86 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:00:47, skipping insertion in model container [2024-01-29 23:00:47,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:00:47" (4/4) ... [2024-01-29 23:00:47,150 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful01-1.i [2024-01-29 23:00:47,163 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 23:00:47,174 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-01-29 23:00:47,174 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 23:00:47,317 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 23:00:47,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 102 transitions, 218 flow [2024-01-29 23:00:47,458 INFO L124 PetriNetUnfolderBase]: 1/100 cut-off events. [2024-01-29 23:00:47,459 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 23:00:47,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 1/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 144 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-01-29 23:00:47,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 102 transitions, 218 flow [2024-01-29 23:00:47,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 97 transitions, 206 flow [2024-01-29 23:00:47,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 23:00:47,500 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;@4f3b033e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 23:00:47,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-01-29 23:00:47,502 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 23:00:47,502 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 23:00:47,502 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:00:47,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:47,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 23:00:47,503 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:47,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash 9952, now seen corresponding path program 1 times [2024-01-29 23:00:47,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:47,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468688358] [2024-01-29 23:00:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:47,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:47,770 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:00:47,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:47,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468688358] [2024-01-29 23:00:47,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468688358] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:47,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:47,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:00:47,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610235617] [2024-01-29 23:00:47,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:47,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:00:47,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:47,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:00:47,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:00:47,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 102 [2024-01-29 23:00:47,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 97 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:47,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:47,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 102 [2024-01-29 23:00:47,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:48,088 INFO L124 PetriNetUnfolderBase]: 582/1562 cut-off events. [2024-01-29 23:00:48,088 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-01-29 23:00:48,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1562 events. 582/1562 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9945 event pairs, 582 based on Foata normal form. 0/1466 useless extension candidates. Maximal degree in co-relation 2476. Up to 1036 conditions per place. [2024-01-29 23:00:48,151 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 43 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-29 23:00:48,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 94 transitions, 290 flow [2024-01-29 23:00:48,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:00:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:00:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2024-01-29 23:00:48,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-29 23:00:48,184 INFO L175 Difference]: Start difference. First operand has 104 places, 97 transitions, 206 flow. Second operand 3 states and 204 transitions. [2024-01-29 23:00:48,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 94 transitions, 290 flow [2024-01-29 23:00:48,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 94 transitions, 282 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 23:00:48,224 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 196 flow [2024-01-29 23:00:48,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=99, PETRI_TRANSITIONS=94} [2024-01-29 23:00:48,229 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -5 predicate places. [2024-01-29 23:00:48,229 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 196 flow [2024-01-29 23:00:48,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:48,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:48,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 23:00:48,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 23:00:48,230 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:48,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:48,231 INFO L85 PathProgramCache]: Analyzing trace with hash 308815, now seen corresponding path program 1 times [2024-01-29 23:00:48,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:48,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083623157] [2024-01-29 23:00:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:48,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:48,274 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:00:48,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:48,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083623157] [2024-01-29 23:00:48,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083623157] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:48,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:48,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:00:48,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053709515] [2024-01-29 23:00:48,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:48,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:00:48,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:48,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:00:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:00:48,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 102 [2024-01-29 23:00:48,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:48,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:48,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 102 [2024-01-29 23:00:48,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:48,477 INFO L124 PetriNetUnfolderBase]: 627/1622 cut-off events. [2024-01-29 23:00:48,477 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 23:00:48,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2758 conditions, 1622 events. 627/1622 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10206 event pairs, 627 based on Foata normal form. 0/1546 useless extension candidates. Maximal degree in co-relation 2741. Up to 1113 conditions per place. [2024-01-29 23:00:48,512 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 42 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-01-29 23:00:48,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 278 flow [2024-01-29 23:00:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:00:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:00:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2024-01-29 23:00:48,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6437908496732027 [2024-01-29 23:00:48,515 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 196 flow. Second operand 3 states and 197 transitions. [2024-01-29 23:00:48,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 278 flow [2024-01-29 23:00:48,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 91 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:48,516 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 190 flow [2024-01-29 23:00:48,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2024-01-29 23:00:48,517 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -8 predicate places. [2024-01-29 23:00:48,517 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 190 flow [2024-01-29 23:00:48,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:48,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:48,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:48,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 23:00:48,518 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:48,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1884864004, now seen corresponding path program 1 times [2024-01-29 23:00:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:48,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400734930] [2024-01-29 23:00:48,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:48,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:48,576 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:00:48,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:48,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400734930] [2024-01-29 23:00:48,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400734930] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:48,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:48,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:00:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172257318] [2024-01-29 23:00:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:48,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:00:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:00:48,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:00:48,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 102 [2024-01-29 23:00:48,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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:00:48,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:48,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 102 [2024-01-29 23:00:48,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:48,757 INFO L124 PetriNetUnfolderBase]: 448/1289 cut-off events. [2024-01-29 23:00:48,758 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 23:00:48,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 1289 events. 448/1289 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 8578 event pairs, 223 based on Foata normal form. 0/1081 useless extension candidates. Maximal degree in co-relation 2098. Up to 788 conditions per place. [2024-01-29 23:00:48,766 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 46 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2024-01-29 23:00:48,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 96 transitions, 299 flow [2024-01-29 23:00:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:00:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:00:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2024-01-29 23:00:48,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-01-29 23:00:48,768 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 190 flow. Second operand 3 states and 221 transitions. [2024-01-29 23:00:48,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 96 transitions, 299 flow [2024-01-29 23:00:48,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:48,771 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 203 flow [2024-01-29 23:00:48,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2024-01-29 23:00:48,772 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-29 23:00:48,772 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 203 flow [2024-01-29 23:00:48,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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:00:48,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:48,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:48,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 23:00:48,773 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:48,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:48,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1698758338, now seen corresponding path program 1 times [2024-01-29 23:00:48,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:48,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763104630] [2024-01-29 23:00:48,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:48,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:48,814 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:00:48,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:48,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763104630] [2024-01-29 23:00:48,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763104630] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:48,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:48,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:00:48,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116621490] [2024-01-29 23:00:48,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:48,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:48,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:48,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:48,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:48,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 102 [2024-01-29 23:00:48,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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:00:48,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:48,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 102 [2024-01-29 23:00:48,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:49,066 INFO L124 PetriNetUnfolderBase]: 568/1524 cut-off events. [2024-01-29 23:00:49,067 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-01-29 23:00:49,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 1524 events. 568/1524 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 10378 event pairs, 546 based on Foata normal form. 0/1313 useless extension candidates. Maximal degree in co-relation 2129. Up to 1010 conditions per place. [2024-01-29 23:00:49,075 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 44 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2024-01-29 23:00:49,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 90 transitions, 295 flow [2024-01-29 23:00:49,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2024-01-29 23:00:49,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6225490196078431 [2024-01-29 23:00:49,076 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 203 flow. Second operand 4 states and 254 transitions. [2024-01-29 23:00:49,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 90 transitions, 295 flow [2024-01-29 23:00:49,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:00:49,078 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 204 flow [2024-01-29 23:00:49,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2024-01-29 23:00:49,079 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -8 predicate places. [2024-01-29 23:00:49,079 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 204 flow [2024-01-29 23:00:49,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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:00:49,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:49,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:49,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 23:00:49,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:49,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1121901276, now seen corresponding path program 1 times [2024-01-29 23:00:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:49,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757949498] [2024-01-29 23:00:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:49,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:49,109 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:00:49,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:49,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757949498] [2024-01-29 23:00:49,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757949498] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:49,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:49,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752868095] [2024-01-29 23:00:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:49,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:49,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:49,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:49,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 102 [2024-01-29 23:00:49,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:49,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:49,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 102 [2024-01-29 23:00:49,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:49,333 INFO L124 PetriNetUnfolderBase]: 568/1505 cut-off events. [2024-01-29 23:00:49,334 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-01-29 23:00:49,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2646 conditions, 1505 events. 568/1505 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 10163 event pairs, 291 based on Foata normal form. 0/1318 useless extension candidates. Maximal degree in co-relation 2620. Up to 994 conditions per place. [2024-01-29 23:00:49,342 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 48 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2024-01-29 23:00:49,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 317 flow [2024-01-29 23:00:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2024-01-29 23:00:49,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6397058823529411 [2024-01-29 23:00:49,344 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 204 flow. Second operand 4 states and 261 transitions. [2024-01-29 23:00:49,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 317 flow [2024-01-29 23:00:49,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 311 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 23:00:49,347 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 204 flow [2024-01-29 23:00:49,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2024-01-29 23:00:49,349 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-29 23:00:49,349 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 204 flow [2024-01-29 23:00:49,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:49,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:49,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:49,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 23:00:49,350 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:49,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:49,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1332084932, now seen corresponding path program 1 times [2024-01-29 23:00:49,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:49,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546882292] [2024-01-29 23:00:49,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:49,462 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:00:49,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:49,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546882292] [2024-01-29 23:00:49,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546882292] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:49,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:49,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:49,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569966982] [2024-01-29 23:00:49,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:49,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:49,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:49,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:49,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:49,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 102 [2024-01-29 23:00:49,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 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:00:49,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:49,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 102 [2024-01-29 23:00:49,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:49,598 INFO L124 PetriNetUnfolderBase]: 213/847 cut-off events. [2024-01-29 23:00:49,598 INFO L125 PetriNetUnfolderBase]: For 70/82 co-relation queries the response was YES. [2024-01-29 23:00:49,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 847 events. 213/847 cut-off events. For 70/82 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5403 event pairs, 79 based on Foata normal form. 36/715 useless extension candidates. Maximal degree in co-relation 495. Up to 367 conditions per place. [2024-01-29 23:00:49,602 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 38 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2024-01-29 23:00:49,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 96 transitions, 303 flow [2024-01-29 23:00:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-29 23:00:49,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7769607843137255 [2024-01-29 23:00:49,603 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 204 flow. Second operand 4 states and 317 transitions. [2024-01-29 23:00:49,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 96 transitions, 303 flow [2024-01-29 23:00:49,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 293 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 23:00:49,605 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 194 flow [2024-01-29 23:00:49,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2024-01-29 23:00:49,606 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -12 predicate places. [2024-01-29 23:00:49,606 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 194 flow [2024-01-29 23:00:49,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 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:00:49,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:49,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:49,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 23:00:49,607 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:49,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:49,607 INFO L85 PathProgramCache]: Analyzing trace with hash -234538837, now seen corresponding path program 1 times [2024-01-29 23:00:49,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:49,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255861222] [2024-01-29 23:00:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:49,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:49,668 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:00:49,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255861222] [2024-01-29 23:00:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255861222] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:49,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:49,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:49,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073698579] [2024-01-29 23:00:49,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:49,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:49,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:49,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:49,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:49,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 102 [2024-01-29 23:00:49,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:49,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:49,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 102 [2024-01-29 23:00:49,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:49,799 INFO L124 PetriNetUnfolderBase]: 213/828 cut-off events. [2024-01-29 23:00:49,799 INFO L125 PetriNetUnfolderBase]: For 41/63 co-relation queries the response was YES. [2024-01-29 23:00:49,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 828 events. 213/828 cut-off events. For 41/63 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5259 event pairs, 100 based on Foata normal form. 36/705 useless extension candidates. Maximal degree in co-relation 1256. Up to 337 conditions per place. [2024-01-29 23:00:49,803 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 45 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2024-01-29 23:00:49,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 100 transitions, 321 flow [2024-01-29 23:00:49,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 324 transitions. [2024-01-29 23:00:49,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2024-01-29 23:00:49,806 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 194 flow. Second operand 4 states and 324 transitions. [2024-01-29 23:00:49,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 100 transitions, 321 flow [2024-01-29 23:00:49,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 100 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:49,810 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 189 flow [2024-01-29 23:00:49,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2024-01-29 23:00:49,811 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -14 predicate places. [2024-01-29 23:00:49,812 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 189 flow [2024-01-29 23:00:49,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:49,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:49,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:49,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 23:00:49,812 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:49,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:49,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1355993132, now seen corresponding path program 1 times [2024-01-29 23:00:49,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:49,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248038024] [2024-01-29 23:00:49,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:49,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:49,877 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:00:49,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:49,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248038024] [2024-01-29 23:00:49,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248038024] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:49,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:49,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:49,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954380619] [2024-01-29 23:00:49,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:49,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:49,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:49,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:49,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:49,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 102 [2024-01-29 23:00:49,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:49,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:49,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 102 [2024-01-29 23:00:49,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:50,142 INFO L124 PetriNetUnfolderBase]: 762/1715 cut-off events. [2024-01-29 23:00:50,142 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-01-29 23:00:50,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3206 conditions, 1715 events. 762/1715 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 9824 event pairs, 347 based on Foata normal form. 0/1683 useless extension candidates. Maximal degree in co-relation 2890. Up to 1215 conditions per place. [2024-01-29 23:00:50,150 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 66 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-29 23:00:50,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 93 transitions, 346 flow [2024-01-29 23:00:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2024-01-29 23:00:50,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5857843137254902 [2024-01-29 23:00:50,151 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 189 flow. Second operand 4 states and 239 transitions. [2024-01-29 23:00:50,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 93 transitions, 346 flow [2024-01-29 23:00:50,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 93 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:50,153 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 172 flow [2024-01-29 23:00:50,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2024-01-29 23:00:50,153 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-29 23:00:50,153 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 172 flow [2024-01-29 23:00:50,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:50,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:50,154 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:00:50,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 23:00:50,154 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:50,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:50,154 INFO L85 PathProgramCache]: Analyzing trace with hash 765717598, now seen corresponding path program 1 times [2024-01-29 23:00:50,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:50,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787890851] [2024-01-29 23:00:50,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:50,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:50,194 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:00:50,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:50,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787890851] [2024-01-29 23:00:50,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787890851] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:50,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:50,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:50,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115554936] [2024-01-29 23:00:50,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:50,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:50,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:50,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:50,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:50,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-01-29 23:00:50,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:00:50,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:50,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-01-29 23:00:50,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:50,411 INFO L124 PetriNetUnfolderBase]: 699/1537 cut-off events. [2024-01-29 23:00:50,412 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-01-29 23:00:50,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 1537 events. 699/1537 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 8676 event pairs, 75 based on Foata normal form. 0/1520 useless extension candidates. Maximal degree in co-relation 2862. Up to 1074 conditions per place. [2024-01-29 23:00:50,417 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 63 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-01-29 23:00:50,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 89 transitions, 331 flow [2024-01-29 23:00:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2024-01-29 23:00:50,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.571078431372549 [2024-01-29 23:00:50,418 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 172 flow. Second operand 4 states and 233 transitions. [2024-01-29 23:00:50,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 89 transitions, 331 flow [2024-01-29 23:00:50,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:50,420 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 169 flow [2024-01-29 23:00:50,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2024-01-29 23:00:50,420 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -21 predicate places. [2024-01-29 23:00:50,421 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 169 flow [2024-01-29 23:00:50,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:00:50,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:50,421 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:00:50,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 23:00:50,421 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:50,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1734321806, now seen corresponding path program 1 times [2024-01-29 23:00:50,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:50,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405490059] [2024-01-29 23:00:50,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:50,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:50,452 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:00:50,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:50,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405490059] [2024-01-29 23:00:50,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405490059] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:50,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:50,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339118977] [2024-01-29 23:00:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:50,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:50,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-01-29 23:00:50,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:50,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:50,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-01-29 23:00:50,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:50,618 INFO L124 PetriNetUnfolderBase]: 582/1375 cut-off events. [2024-01-29 23:00:50,619 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-01-29 23:00:50,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 1375 events. 582/1375 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7969 event pairs, 260 based on Foata normal form. 0/1316 useless extension candidates. Maximal degree in co-relation 2471. Up to 986 conditions per place. [2024-01-29 23:00:50,625 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 51 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2024-01-29 23:00:50,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 80 transitions, 290 flow [2024-01-29 23:00:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2024-01-29 23:00:50,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5955882352941176 [2024-01-29 23:00:50,626 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 169 flow. Second operand 4 states and 243 transitions. [2024-01-29 23:00:50,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 80 transitions, 290 flow [2024-01-29 23:00:50,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 80 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:50,628 INFO L231 Difference]: Finished difference. Result has 83 places, 73 transitions, 170 flow [2024-01-29 23:00:50,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2024-01-29 23:00:50,629 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -21 predicate places. [2024-01-29 23:00:50,629 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 170 flow [2024-01-29 23:00:50,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:00:50,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:50,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:50,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 23:00:50,630 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:50,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:50,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2070598463, now seen corresponding path program 1 times [2024-01-29 23:00:50,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:50,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040168544] [2024-01-29 23:00:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:50,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:50,666 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:00:50,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:50,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040168544] [2024-01-29 23:00:50,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040168544] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:50,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238798500] [2024-01-29 23:00:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:50,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:50,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:50,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:50,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:50,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 102 [2024-01-29 23:00:50,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 73 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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:00:50,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:50,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 102 [2024-01-29 23:00:50,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:50,891 INFO L124 PetriNetUnfolderBase]: 543/1436 cut-off events. [2024-01-29 23:00:50,891 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2024-01-29 23:00:50,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2571 conditions, 1436 events. 543/1436 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8941 event pairs, 215 based on Foata normal form. 0/1318 useless extension candidates. Maximal degree in co-relation 2310. Up to 744 conditions per place. [2024-01-29 23:00:50,897 INFO L140 encePairwiseOnDemand]: 96/102 looper letters, 65 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2024-01-29 23:00:50,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 98 transitions, 370 flow [2024-01-29 23:00:50,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2024-01-29 23:00:50,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6151960784313726 [2024-01-29 23:00:50,898 INFO L175 Difference]: Start difference. First operand has 83 places, 73 transitions, 170 flow. Second operand 4 states and 251 transitions. [2024-01-29 23:00:50,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 98 transitions, 370 flow [2024-01-29 23:00:50,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 98 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:50,900 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 203 flow [2024-01-29 23:00:50,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2024-01-29 23:00:50,900 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-29 23:00:50,901 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 203 flow [2024-01-29 23:00:50,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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:00:50,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:50,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:50,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 23:00:50,901 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:50,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1415217760, now seen corresponding path program 1 times [2024-01-29 23:00:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:50,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240183879] [2024-01-29 23:00:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:50,934 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:00:50,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:50,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240183879] [2024-01-29 23:00:50,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240183879] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:50,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:50,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:50,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980076552] [2024-01-29 23:00:50,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:50,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:50,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:50,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:50,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:50,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 102 [2024-01-29 23:00:50,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 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:00:50,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:50,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 102 [2024-01-29 23:00:50,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:51,122 INFO L124 PetriNetUnfolderBase]: 690/1553 cut-off events. [2024-01-29 23:00:51,123 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2024-01-29 23:00:51,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 1553 events. 690/1553 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 9030 event pairs, 150 based on Foata normal form. 34/1557 useless extension candidates. Maximal degree in co-relation 3070. Up to 986 conditions per place. [2024-01-29 23:00:51,130 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 61 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-01-29 23:00:51,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 89 transitions, 360 flow [2024-01-29 23:00:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2024-01-29 23:00:51,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6200980392156863 [2024-01-29 23:00:51,132 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 203 flow. Second operand 4 states and 253 transitions. [2024-01-29 23:00:51,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 89 transitions, 360 flow [2024-01-29 23:00:51,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 89 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:00:51,134 INFO L231 Difference]: Finished difference. Result has 85 places, 75 transitions, 208 flow [2024-01-29 23:00:51,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=85, PETRI_TRANSITIONS=75} [2024-01-29 23:00:51,134 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -19 predicate places. [2024-01-29 23:00:51,134 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 75 transitions, 208 flow [2024-01-29 23:00:51,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 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:00:51,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:51,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:51,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 23:00:51,135 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:51,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:51,135 INFO L85 PathProgramCache]: Analyzing trace with hash 922078032, now seen corresponding path program 1 times [2024-01-29 23:00:51,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:51,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816339535] [2024-01-29 23:00:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:51,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:51,172 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:00:51,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:51,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816339535] [2024-01-29 23:00:51,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816339535] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:51,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:51,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:51,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967051100] [2024-01-29 23:00:51,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:51,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:51,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:51,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:51,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 102 [2024-01-29 23:00:51,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 75 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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:00:51,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:51,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 102 [2024-01-29 23:00:51,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:51,360 INFO L124 PetriNetUnfolderBase]: 419/989 cut-off events. [2024-01-29 23:00:51,360 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-01-29 23:00:51,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2074 conditions, 989 events. 419/989 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5700 event pairs, 59 based on Foata normal form. 22/967 useless extension candidates. Maximal degree in co-relation 2040. Up to 524 conditions per place. [2024-01-29 23:00:51,365 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 61 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2024-01-29 23:00:51,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 93 transitions, 382 flow [2024-01-29 23:00:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2024-01-29 23:00:51,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6102941176470589 [2024-01-29 23:00:51,366 INFO L175 Difference]: Start difference. First operand has 85 places, 75 transitions, 208 flow. Second operand 4 states and 249 transitions. [2024-01-29 23:00:51,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 93 transitions, 382 flow [2024-01-29 23:00:51,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 93 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:51,368 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 209 flow [2024-01-29 23:00:51,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2024-01-29 23:00:51,369 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -19 predicate places. [2024-01-29 23:00:51,369 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 209 flow [2024-01-29 23:00:51,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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:00:51,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:51,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:51,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 23:00:51,370 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:51,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1654249433, now seen corresponding path program 1 times [2024-01-29 23:00:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:51,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923699486] [2024-01-29 23:00:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:51,429 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:00:51,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:51,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923699486] [2024-01-29 23:00:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923699486] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:51,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:51,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:00:51,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567782097] [2024-01-29 23:00:51,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:51,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:00:51,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:51,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:00:51,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:00:51,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 102 [2024-01-29 23:00:51,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 74 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 62.2) internal successors, (311), 5 states have internal predecessors, (311), 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:00:51,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:51,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 102 [2024-01-29 23:00:51,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:51,641 INFO L124 PetriNetUnfolderBase]: 441/1207 cut-off events. [2024-01-29 23:00:51,642 INFO L125 PetriNetUnfolderBase]: For 211/221 co-relation queries the response was YES. [2024-01-29 23:00:51,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 1207 events. 441/1207 cut-off events. For 211/221 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7306 event pairs, 69 based on Foata normal form. 14/1091 useless extension candidates. Maximal degree in co-relation 2120. Up to 312 conditions per place. [2024-01-29 23:00:51,647 INFO L140 encePairwiseOnDemand]: 96/102 looper letters, 70 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2024-01-29 23:00:51,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 107 transitions, 448 flow [2024-01-29 23:00:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:00:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:00:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 364 transitions. [2024-01-29 23:00:51,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7137254901960784 [2024-01-29 23:00:51,648 INFO L175 Difference]: Start difference. First operand has 85 places, 74 transitions, 209 flow. Second operand 5 states and 364 transitions. [2024-01-29 23:00:51,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 107 transitions, 448 flow [2024-01-29 23:00:51,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 107 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:51,650 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 243 flow [2024-01-29 23:00:51,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2024-01-29 23:00:51,651 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -14 predicate places. [2024-01-29 23:00:51,651 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 243 flow [2024-01-29 23:00:51,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.2) internal successors, (311), 5 states have internal predecessors, (311), 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:00:51,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:51,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:51,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 23:00:51,652 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:51,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash 257875542, now seen corresponding path program 1 times [2024-01-29 23:00:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:51,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174096559] [2024-01-29 23:00:51,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:51,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:51,696 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:00:51,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:51,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174096559] [2024-01-29 23:00:51,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174096559] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:51,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:51,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:51,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122369356] [2024-01-29 23:00:51,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:51,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:51,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:51,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:51,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:51,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 102 [2024-01-29 23:00:51,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:00:51,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:51,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 102 [2024-01-29 23:00:51,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:51,899 INFO L124 PetriNetUnfolderBase]: 550/1335 cut-off events. [2024-01-29 23:00:51,899 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-01-29 23:00:51,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2802 conditions, 1335 events. 550/1335 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7647 event pairs, 109 based on Foata normal form. 8/1278 useless extension candidates. Maximal degree in co-relation 2765. Up to 563 conditions per place. [2024-01-29 23:00:51,905 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 78 selfloop transitions, 9 changer transitions 0/113 dead transitions. [2024-01-29 23:00:51,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 113 transitions, 513 flow [2024-01-29 23:00:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 285 transitions. [2024-01-29 23:00:51,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6985294117647058 [2024-01-29 23:00:51,907 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 243 flow. Second operand 4 states and 285 transitions. [2024-01-29 23:00:51,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 113 transitions, 513 flow [2024-01-29 23:00:51,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 113 transitions, 508 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:00:51,909 INFO L231 Difference]: Finished difference. Result has 94 places, 84 transitions, 302 flow [2024-01-29 23:00:51,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=94, PETRI_TRANSITIONS=84} [2024-01-29 23:00:51,909 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -10 predicate places. [2024-01-29 23:00:51,909 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 84 transitions, 302 flow [2024-01-29 23:00:51,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:00:51,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:51,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:51,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 23:00:51,910 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:51,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:51,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1586323528, now seen corresponding path program 1 times [2024-01-29 23:00:51,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:51,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288419857] [2024-01-29 23:00:51,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:51,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:51,965 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:00:51,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:51,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288419857] [2024-01-29 23:00:51,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288419857] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:51,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:51,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:00:51,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546644816] [2024-01-29 23:00:51,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:51,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:00:51,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:51,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:00:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:00:52,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 102 [2024-01-29 23:00:52,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 84 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 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:00:52,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:52,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 102 [2024-01-29 23:00:52,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:52,257 INFO L124 PetriNetUnfolderBase]: 390/1097 cut-off events. [2024-01-29 23:00:52,257 INFO L125 PetriNetUnfolderBase]: For 584/596 co-relation queries the response was YES. [2024-01-29 23:00:52,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2410 conditions, 1097 events. 390/1097 cut-off events. For 584/596 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6551 event pairs, 77 based on Foata normal form. 38/1077 useless extension candidates. Maximal degree in co-relation 2371. Up to 308 conditions per place. [2024-01-29 23:00:52,262 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 71 selfloop transitions, 12 changer transitions 0/117 dead transitions. [2024-01-29 23:00:52,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 117 transitions, 564 flow [2024-01-29 23:00:52,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:00:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:00:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 350 transitions. [2024-01-29 23:00:52,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2024-01-29 23:00:52,264 INFO L175 Difference]: Start difference. First operand has 94 places, 84 transitions, 302 flow. Second operand 5 states and 350 transitions. [2024-01-29 23:00:52,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 117 transitions, 564 flow [2024-01-29 23:00:52,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 117 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:00:52,267 INFO L231 Difference]: Finished difference. Result has 101 places, 87 transitions, 373 flow [2024-01-29 23:00:52,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=101, PETRI_TRANSITIONS=87} [2024-01-29 23:00:52,267 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -3 predicate places. [2024-01-29 23:00:52,269 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 87 transitions, 373 flow [2024-01-29 23:00:52,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 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:00:52,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:52,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:52,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 23:00:52,270 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:52,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:52,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1931389560, now seen corresponding path program 1 times [2024-01-29 23:00:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927782379] [2024-01-29 23:00:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:52,441 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:00:52,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:52,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927782379] [2024-01-29 23:00:52,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927782379] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:52,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:52,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:00:52,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409399190] [2024-01-29 23:00:52,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:52,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:00:52,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:52,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:00:52,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:00:52,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-01-29 23:00:52,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 87 transitions, 373 flow. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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:00:52,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:52,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-01-29 23:00:52,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:52,913 INFO L124 PetriNetUnfolderBase]: 642/1468 cut-off events. [2024-01-29 23:00:52,914 INFO L125 PetriNetUnfolderBase]: For 1198/1244 co-relation queries the response was YES. [2024-01-29 23:00:52,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3564 conditions, 1468 events. 642/1468 cut-off events. For 1198/1244 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 8641 event pairs, 127 based on Foata normal form. 42/1481 useless extension candidates. Maximal degree in co-relation 3520. Up to 511 conditions per place. [2024-01-29 23:00:52,922 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 86 selfloop transitions, 11 changer transitions 0/124 dead transitions. [2024-01-29 23:00:52,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 124 transitions, 690 flow [2024-01-29 23:00:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:00:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:00:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 295 transitions. [2024-01-29 23:00:52,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2024-01-29 23:00:52,930 INFO L175 Difference]: Start difference. First operand has 101 places, 87 transitions, 373 flow. Second operand 5 states and 295 transitions. [2024-01-29 23:00:52,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 124 transitions, 690 flow [2024-01-29 23:00:52,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 124 transitions, 681 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-29 23:00:52,937 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 451 flow [2024-01-29 23:00:52,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=451, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2024-01-29 23:00:52,953 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 2 predicate places. [2024-01-29 23:00:52,953 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 451 flow [2024-01-29 23:00:52,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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:00:52,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:52,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:52,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 23:00:52,954 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:52,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:52,954 INFO L85 PathProgramCache]: Analyzing trace with hash -816647907, now seen corresponding path program 1 times [2024-01-29 23:00:52,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:52,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794378843] [2024-01-29 23:00:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:52,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:53,121 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:00:53,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:53,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794378843] [2024-01-29 23:00:53,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794378843] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:53,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:53,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:53,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503081233] [2024-01-29 23:00:53,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:53,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:00:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:53,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:00:53,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:00:53,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 102 [2024-01-29 23:00:53,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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:00:53,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:53,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 102 [2024-01-29 23:00:53,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:53,223 INFO L124 PetriNetUnfolderBase]: 142/584 cut-off events. [2024-01-29 23:00:53,223 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2024-01-29 23:00:53,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 584 events. 142/584 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2970 event pairs, 48 based on Foata normal form. 43/606 useless extension candidates. Maximal degree in co-relation 1281. Up to 173 conditions per place. [2024-01-29 23:00:53,226 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 35 selfloop transitions, 8 changer transitions 0/85 dead transitions. [2024-01-29 23:00:53,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 85 transitions, 447 flow [2024-01-29 23:00:53,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:00:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:00:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-01-29 23:00:53,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8398692810457516 [2024-01-29 23:00:53,228 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 451 flow. Second operand 3 states and 257 transitions. [2024-01-29 23:00:53,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 85 transitions, 447 flow [2024-01-29 23:00:53,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 85 transitions, 427 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-01-29 23:00:53,232 INFO L231 Difference]: Finished difference. Result has 102 places, 78 transitions, 341 flow [2024-01-29 23:00:53,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=102, PETRI_TRANSITIONS=78} [2024-01-29 23:00:53,233 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -2 predicate places. [2024-01-29 23:00:53,233 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 78 transitions, 341 flow [2024-01-29 23:00:53,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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:00:53,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:53,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:53,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 23:00:53,234 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:53,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:53,234 INFO L85 PathProgramCache]: Analyzing trace with hash 441959330, now seen corresponding path program 1 times [2024-01-29 23:00:53,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:53,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532979850] [2024-01-29 23:00:53,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:53,363 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:00:53,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:53,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532979850] [2024-01-29 23:00:53,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532979850] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:53,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:53,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 23:00:53,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853965713] [2024-01-29 23:00:53,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:53,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 23:00:53,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 23:00:53,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-29 23:00:53,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 102 [2024-01-29 23:00:53,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 78 transitions, 341 flow. Second operand has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 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:00:53,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:53,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 102 [2024-01-29 23:00:53,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:53,629 INFO L124 PetriNetUnfolderBase]: 301/904 cut-off events. [2024-01-29 23:00:53,630 INFO L125 PetriNetUnfolderBase]: For 623/643 co-relation queries the response was YES. [2024-01-29 23:00:53,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 904 events. 301/904 cut-off events. For 623/643 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4739 event pairs, 85 based on Foata normal form. 8/889 useless extension candidates. Maximal degree in co-relation 1922. Up to 242 conditions per place. [2024-01-29 23:00:53,634 INFO L140 encePairwiseOnDemand]: 96/102 looper letters, 89 selfloop transitions, 7 changer transitions 0/125 dead transitions. [2024-01-29 23:00:53,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 125 transitions, 694 flow [2024-01-29 23:00:53,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 23:00:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 23:00:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 438 transitions. [2024-01-29 23:00:53,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2024-01-29 23:00:53,636 INFO L175 Difference]: Start difference. First operand has 102 places, 78 transitions, 341 flow. Second operand 6 states and 438 transitions. [2024-01-29 23:00:53,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 125 transitions, 694 flow [2024-01-29 23:00:53,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 125 transitions, 651 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 23:00:53,640 INFO L231 Difference]: Finished difference. Result has 105 places, 79 transitions, 346 flow [2024-01-29 23:00:53,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=105, PETRI_TRANSITIONS=79} [2024-01-29 23:00:53,641 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2024-01-29 23:00:53,641 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 79 transitions, 346 flow [2024-01-29 23:00:53,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 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:00:53,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:53,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:53,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 23:00:53,642 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:53,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash 838727746, now seen corresponding path program 2 times [2024-01-29 23:00:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:53,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945011720] [2024-01-29 23:00:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:53,745 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:00:53,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:53,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945011720] [2024-01-29 23:00:53,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945011720] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:53,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:53,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 23:00:53,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168269843] [2024-01-29 23:00:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:53,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 23:00:53,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:53,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 23:00:53,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-29 23:00:53,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 102 [2024-01-29 23:00:53,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 79 transitions, 346 flow. Second operand has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 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:00:53,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:53,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 102 [2024-01-29 23:00:53,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:54,008 INFO L124 PetriNetUnfolderBase]: 297/896 cut-off events. [2024-01-29 23:00:54,008 INFO L125 PetriNetUnfolderBase]: For 616/638 co-relation queries the response was YES. [2024-01-29 23:00:54,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 896 events. 297/896 cut-off events. For 616/638 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4702 event pairs, 53 based on Foata normal form. 8/885 useless extension candidates. Maximal degree in co-relation 1970. Up to 242 conditions per place. [2024-01-29 23:00:54,013 INFO L140 encePairwiseOnDemand]: 96/102 looper letters, 71 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2024-01-29 23:00:54,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 587 flow [2024-01-29 23:00:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-29 23:00:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-29 23:00:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 479 transitions. [2024-01-29 23:00:54,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6708683473389355 [2024-01-29 23:00:54,015 INFO L175 Difference]: Start difference. First operand has 105 places, 79 transitions, 346 flow. Second operand 7 states and 479 transitions. [2024-01-29 23:00:54,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 587 flow [2024-01-29 23:00:54,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 109 transitions, 574 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-01-29 23:00:54,018 INFO L231 Difference]: Finished difference. Result has 105 places, 78 transitions, 345 flow [2024-01-29 23:00:54,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=345, PETRI_PLACES=105, PETRI_TRANSITIONS=78} [2024-01-29 23:00:54,019 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2024-01-29 23:00:54,019 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 78 transitions, 345 flow [2024-01-29 23:00:54,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 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:00:54,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:54,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:54,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 23:00:54,020 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:54,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:54,020 INFO L85 PathProgramCache]: Analyzing trace with hash -860289541, now seen corresponding path program 1 times [2024-01-29 23:00:54,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:54,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598723393] [2024-01-29 23:00:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:54,132 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:00:54,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:54,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598723393] [2024-01-29 23:00:54,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598723393] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:54,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:54,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 23:00:54,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626859525] [2024-01-29 23:00:54,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:54,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 23:00:54,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 23:00:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-01-29 23:00:54,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 102 [2024-01-29 23:00:54,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 78 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 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:00:54,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:54,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 102 [2024-01-29 23:00:54,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:54,457 INFO L124 PetriNetUnfolderBase]: 212/735 cut-off events. [2024-01-29 23:00:54,458 INFO L125 PetriNetUnfolderBase]: For 568/572 co-relation queries the response was YES. [2024-01-29 23:00:54,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 735 events. 212/735 cut-off events. For 568/572 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3812 event pairs, 48 based on Foata normal form. 6/729 useless extension candidates. Maximal degree in co-relation 1628. Up to 180 conditions per place. [2024-01-29 23:00:54,461 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 68 selfloop transitions, 12 changer transitions 0/107 dead transitions. [2024-01-29 23:00:54,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 585 flow [2024-01-29 23:00:54,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 23:00:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 23:00:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2024-01-29 23:00:54,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6486928104575164 [2024-01-29 23:00:54,463 INFO L175 Difference]: Start difference. First operand has 105 places, 78 transitions, 345 flow. Second operand 6 states and 397 transitions. [2024-01-29 23:00:54,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 585 flow [2024-01-29 23:00:54,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 107 transitions, 563 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-01-29 23:00:54,466 INFO L231 Difference]: Finished difference. Result has 103 places, 77 transitions, 340 flow [2024-01-29 23:00:54,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=103, PETRI_TRANSITIONS=77} [2024-01-29 23:00:54,480 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -1 predicate places. [2024-01-29 23:00:54,481 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 77 transitions, 340 flow [2024-01-29 23:00:54,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 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:00:54,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:54,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:54,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 23:00:54,482 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:00:54,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash -821276581, now seen corresponding path program 1 times [2024-01-29 23:00:54,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:54,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221986932] [2024-01-29 23:00:54,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:54,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:00:54,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 23:00:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:00:54,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 23:00:54,638 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 23:00:54,639 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (60 of 61 remaining) [2024-01-29 23:00:54,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 61 remaining) [2024-01-29 23:00:54,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 61 remaining) [2024-01-29 23:00:54,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 61 remaining) [2024-01-29 23:00:54,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 61 remaining) [2024-01-29 23:00:54,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 61 remaining) [2024-01-29 23:00:54,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 61 remaining) [2024-01-29 23:00:54,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 61 remaining) [2024-01-29 23:00:54,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 61 remaining) [2024-01-29 23:00:54,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 61 remaining) [2024-01-29 23:00:54,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 61 remaining) [2024-01-29 23:00:54,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 61 remaining) [2024-01-29 23:00:54,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 61 remaining) [2024-01-29 23:00:54,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 61 remaining) [2024-01-29 23:00:54,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 61 remaining) [2024-01-29 23:00:54,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 61 remaining) [2024-01-29 23:00:54,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 61 remaining) [2024-01-29 23:00:54,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 61 remaining) [2024-01-29 23:00:54,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 61 remaining) [2024-01-29 23:00:54,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 61 remaining) [2024-01-29 23:00:54,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 61 remaining) [2024-01-29 23:00:54,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 61 remaining) [2024-01-29 23:00:54,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 61 remaining) [2024-01-29 23:00:54,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 61 remaining) [2024-01-29 23:00:54,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 61 remaining) [2024-01-29 23:00:54,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 61 remaining) [2024-01-29 23:00:54,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 61 remaining) [2024-01-29 23:00:54,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 61 remaining) [2024-01-29 23:00:54,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 61 remaining) [2024-01-29 23:00:54,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 61 remaining) [2024-01-29 23:00:54,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 61 remaining) [2024-01-29 23:00:54,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 61 remaining) [2024-01-29 23:00:54,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 61 remaining) [2024-01-29 23:00:54,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 61 remaining) [2024-01-29 23:00:54,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 61 remaining) [2024-01-29 23:00:54,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2024-01-29 23:00:54,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2024-01-29 23:00:54,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 61 remaining) [2024-01-29 23:00:54,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 61 remaining) [2024-01-29 23:00:54,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 61 remaining) [2024-01-29 23:00:54,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 61 remaining) [2024-01-29 23:00:54,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 61 remaining) [2024-01-29 23:00:54,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 61 remaining) [2024-01-29 23:00:54,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 61 remaining) [2024-01-29 23:00:54,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 61 remaining) [2024-01-29 23:00:54,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 61 remaining) [2024-01-29 23:00:54,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 61 remaining) [2024-01-29 23:00:54,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 61 remaining) [2024-01-29 23:00:54,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 61 remaining) [2024-01-29 23:00:54,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 61 remaining) [2024-01-29 23:00:54,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 61 remaining) [2024-01-29 23:00:54,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 61 remaining) [2024-01-29 23:00:54,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 61 remaining) [2024-01-29 23:00:54,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 61 remaining) [2024-01-29 23:00:54,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 61 remaining) [2024-01-29 23:00:54,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 61 remaining) [2024-01-29 23:00:54,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 61 remaining) [2024-01-29 23:00:54,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 61 remaining) [2024-01-29 23:00:54,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 61 remaining) [2024-01-29 23:00:54,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 61 remaining) [2024-01-29 23:00:54,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 61 remaining) [2024-01-29 23:00:54,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-29 23:00:54,664 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:54,672 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 23:00:54,672 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 23:00:54,786 INFO L503 ceAbstractionStarter]: Automizer considered 34 witness invariants [2024-01-29 23:00:54,800 INFO L504 ceAbstractionStarter]: WitnessConsidered=34 [2024-01-29 23:00:54,802 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:00:54 BasicIcfg [2024-01-29 23:00:54,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 23:00:54,804 INFO L158 Benchmark]: Toolchain (without parser) took 9255.14ms. Allocated memory was 121.6MB in the beginning and 281.0MB in the end (delta: 159.4MB). Free memory was 80.0MB in the beginning and 242.7MB in the end (delta: -162.7MB). Peak memory consumption was 157.4MB. Max. memory is 16.1GB. [2024-01-29 23:00:54,804 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:00:54,804 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:00:54,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.49ms. Allocated memory is still 121.6MB. Free memory was 80.0MB in the beginning and 54.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-29 23:00:54,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.01ms. Allocated memory is still 121.6MB. Free memory was 54.8MB in the beginning and 52.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:00:54,805 INFO L158 Benchmark]: Boogie Preprocessor took 111.45ms. Allocated memory is still 121.6MB. Free memory was 52.7MB in the beginning and 50.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:00:54,805 INFO L158 Benchmark]: RCFGBuilder took 940.47ms. Allocated memory is still 121.6MB. Free memory was 50.3MB in the beginning and 72.0MB in the end (delta: -21.7MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-01-29 23:00:54,805 INFO L158 Benchmark]: TraceAbstraction took 7657.16ms. Allocated memory was 121.6MB in the beginning and 281.0MB in the end (delta: 159.4MB). Free memory was 71.5MB in the beginning and 242.7MB in the end (delta: -171.2MB). Peak memory consumption was 148.7MB. Max. memory is 16.1GB. [2024-01-29 23:00:54,806 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.49ms. Allocated memory is still 121.6MB. Free memory was 80.0MB in the beginning and 54.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.01ms. Allocated memory is still 121.6MB. Free memory was 54.8MB in the beginning and 52.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.45ms. Allocated memory is still 121.6MB. Free memory was 52.7MB in the beginning and 50.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 940.47ms. Allocated memory is still 121.6MB. Free memory was 50.3MB in the beginning and 72.0MB in the end (delta: -21.7MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7657.16ms. Allocated memory was 121.6MB in the beginning and 281.0MB in the end (delta: 159.4MB). Free memory was 71.5MB in the beginning and 242.7MB in the end (delta: -171.2MB). Peak memory consumption was 148.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 727]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L693] 0 int data1, data2; [L716] 0 pthread_t t1, t2; VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L717] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]]]] VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L717] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]]] [L718] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]]]] VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L718] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]]] [L719] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]]] VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L719] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]]]] [L719] 0 data1 = 10 VAL [data1=10, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L720] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]]]] VAL [data1=10, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L720] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]]] [L720] 0 data2 = 10 VAL [data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L721] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[10]]]]] VAL [data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L721] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]]]] [L721] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L696] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}] [L722] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L723] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] [L697] 1 data1++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L698] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[11],IdentifierExpression[data1]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L698] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[11],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L706] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L707] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L707] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] [L707] 2 data1+=5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=10, ma={3:0}, mb={4:0}] [L699] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=10, ma={3:0}, mb={4:0}] [L708] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[15],IdentifierExpression[data1]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=10, ma={3:0}, mb={4:0}] [L708] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[15],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=10, ma={3:0}, mb={4:0}] [L700] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=10, ma={3:0}, mb={4:0}] [L700] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] [L700] 1 data2++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[data2]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[data2]],BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[data2]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L702] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L702] 1 return 0; [L723] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L724] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L709] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L710] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L710] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L710] 2 data2-=6 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L711] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L711] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPLEQ,IdentifierExpression[data2],IntegerLiteral[2147483641]]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L711] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPLEQ,IdentifierExpression[data2],IntegerLiteral[2147483641]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L712] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L712] 2 return 0; [L724] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L725] COND TRUE 0 data1==16 && data2==5 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L727] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 172 locations, 61 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: 7.3s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3199 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2004 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 224 mSDsCounter, 427 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4038 IncrementalHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 427 mSolverCounterUnsat, 163 mSDtfsCounter, 4038 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=451occurred in iteration=17, InterpolantAutomatonStates: 90, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 472 ConstructedInterpolants, 0 QuantifiedInterpolants, 2317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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:00:54,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE