./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/lazy01.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/lazy01.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 59af5db6 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/lazy01.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/lazy01.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-59af5db-m [2024-02-02 09:22:48,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:22:48,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:22:48,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:22:48,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:22:48,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:22:48,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:22:48,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:22:48,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:22:48,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:22:48,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:22:48,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:22:48,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:22:48,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:22:48,742 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:22:48,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:22:48,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:22:48,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:22:48,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:22:48,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:22:48,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:22:48,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:22:48,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:22:48,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:22:48,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:22:48,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:22:48,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:22:48,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:22:48,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:22:48,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:22:48,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:22:48,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:22:48,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:22:48,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:22:48,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:22:48,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:22:48,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:22:48,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:22:48,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:22:48,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:22:48,748 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:22:48,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:22:48,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:22:48,749 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-02-02 09:22:48,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:22:48,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:22:48,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:22:48,943 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:22:48,944 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:22:48,945 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/lazy01.yml/witness.yml [2024-02-02 09:22:49,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:22:49,050 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:22:49,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/lazy01.i [2024-02-02 09:22:50,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:22:50,251 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:22:50,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/lazy01.i [2024-02-02 09:22:50,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f49372e33/7fd5a21e847947c3bf07526d892f9eb7/FLAG409a4d1e7 [2024-02-02 09:22:50,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f49372e33/7fd5a21e847947c3bf07526d892f9eb7 [2024-02-02 09:22:50,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:22:50,283 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:22:50,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:22:50,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:22:50,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:22:50,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:22:49" (1/2) ... [2024-02-02 09:22:50,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d35cf4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:22:50, skipping insertion in model container [2024-02-02 09:22:50,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:22:49" (1/2) ... [2024-02-02 09:22:50,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7fd46150 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:22:50, skipping insertion in model container [2024-02-02 09:22:50,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:22:50" (2/2) ... [2024-02-02 09:22:50,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d35cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50, skipping insertion in model container [2024-02-02 09:22:50,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:22:50" (2/2) ... [2024-02-02 09:22:50,291 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:22:50,338 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:22:50,339 INFO L101 nessWitnessExtractor]: Location invariant before [L708-L708] (1 <= data) && ((unsigned long )arg == 0UL) [2024-02-02 09:22:50,339 INFO L101 nessWitnessExtractor]: Location invariant before [L722-L722] ((3 <= data) && ((unsigned long )arg == 0UL)) && (data != 0) [2024-02-02 09:22:50,339 INFO L101 nessWitnessExtractor]: Location invariant before [L709-L709] (unsigned long )arg == 0UL [2024-02-02 09:22:50,340 INFO L101 nessWitnessExtractor]: Location invariant before [L721-L724] (0 <= data) && ((unsigned long )arg == 0UL) [2024-02-02 09:22:50,340 INFO L101 nessWitnessExtractor]: Location invariant before [L714-L714] (0 <= data) && ((unsigned long )arg == 0UL) [2024-02-02 09:22:50,340 INFO L101 nessWitnessExtractor]: Location invariant before [L716-L716] (unsigned long )arg == 0UL [2024-02-02 09:22:50,340 INFO L101 nessWitnessExtractor]: Location invariant before [L732-L732] data == 0 [2024-02-02 09:22:50,341 INFO L101 nessWitnessExtractor]: Location invariant before [L707-L707] (0 <= data) && ((unsigned long )arg == 0UL) [2024-02-02 09:22:50,341 INFO L101 nessWitnessExtractor]: Location invariant before [L726-L726] (unsigned long )arg == 0UL [2024-02-02 09:22:50,341 INFO L101 nessWitnessExtractor]: Location invariant before [L725-L725] ((0 <= data) && (data <= 2)) && ((unsigned long )arg == 0UL) [2024-02-02 09:22:50,341 INFO L101 nessWitnessExtractor]: Location invariant before [L706-L706] (unsigned long )arg == 0UL [2024-02-02 09:22:50,341 INFO L101 nessWitnessExtractor]: Location invariant before [L715-L715] (2 <= data) && ((unsigned long )arg == 0UL) [2024-02-02 09:22:50,341 INFO L101 nessWitnessExtractor]: Location invariant before [L713-L713] (unsigned long )arg == 0UL [2024-02-02 09:22:50,341 INFO L101 nessWitnessExtractor]: Location invariant before [L720-L720] (unsigned long )arg == 0UL [2024-02-02 09:22:50,342 INFO L101 nessWitnessExtractor]: Location invariant before [L730-L730] data == 0 [2024-02-02 09:22:50,383 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:22:50,602 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/lazy01.i[31042,31055] [2024-02-02 09:22:50,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:22:50,616 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 [2024-02-02 09:22:50,696 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/lazy01.i[31042,31055] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-02 09:22:50,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:22:50,738 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:22:50,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50 WrapperNode [2024-02-02 09:22:50,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:22:50,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:22:50,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:22:50,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:22:50,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,791 INFO L138 Inliner]: procedures = 170, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2024-02-02 09:22:50,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:22:50,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:22:50,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:22:50,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:22:50,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,818 INFO L175 MemorySlicer]: Split 13 memory accesses to 5 slices as follows [2, 5, 2, 2, 2]. 38 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0, 0]. The 3 writes are split as follows [0, 0, 1, 1, 1]. [2024-02-02 09:22:50,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:22:50,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:22:50,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:22:50,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:22:50,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (1/1) ... [2024-02-02 09:22:50,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:22:50,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:22:50,874 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-02-02 09:22:50,883 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-02-02 09:22:50,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:22:50,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:22:50,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:22:50,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:22:50,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-02 09:22:50,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:22:50,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:22:50,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 09:22:50,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 09:22:50,908 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-02 09:22:50,908 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-02 09:22:50,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:22:50,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:22:50,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:22:50,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:22:50,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-02 09:22:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-02 09:22:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:22:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:22:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:22:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:22:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:22:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:22:50,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:22:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-02 09:22:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-02 09:22:50,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:22:50,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:22:50,911 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:22:51,054 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:22:51,056 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:22:51,273 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:22:51,273 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:22:51,378 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:22:51,378 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-02 09:22:51,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:22:51 BoogieIcfgContainer [2024-02-02 09:22:51,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:22:51,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:22:51,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:22:51,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:22:51,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:22:49" (1/4) ... [2024-02-02 09:22:51,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2baf67 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:22:51, skipping insertion in model container [2024-02-02 09:22:51,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:22:50" (2/4) ... [2024-02-02 09:22:51,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2baf67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:22:51, skipping insertion in model container [2024-02-02 09:22:51,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:50" (3/4) ... [2024-02-02 09:22:51,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2baf67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:22:51, skipping insertion in model container [2024-02-02 09:22:51,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:22:51" (4/4) ... [2024-02-02 09:22:51,387 INFO L112 eAbstractionObserver]: Analyzing ICFG lazy01.i [2024-02-02 09:22:51,400 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:22:51,400 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-02-02 09:22:51,400 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:22:51,474 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-02 09:22:51,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 65 transitions, 151 flow [2024-02-02 09:22:51,540 INFO L124 PetriNetUnfolderBase]: 1/62 cut-off events. [2024-02-02 09:22:51,541 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-02 09:22:51,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 1/62 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2024-02-02 09:22:51,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 65 transitions, 151 flow [2024-02-02 09:22:51,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 60 transitions, 135 flow [2024-02-02 09:22:51,558 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:22:51,562 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;@71e9fec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:22:51,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-02-02 09:22:51,564 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:22:51,564 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:22:51,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:22:51,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:51,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:22:51,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:51,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:51,569 INFO L85 PathProgramCache]: Analyzing trace with hash 8284, now seen corresponding path program 1 times [2024-02-02 09:22:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:51,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730765713] [2024-02-02 09:22:51,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:51,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:51,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:51,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730765713] [2024-02-02 09:22:51,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730765713] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:51,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:51,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:22:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757785374] [2024-02-02 09:22:51,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:51,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:22:51,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:51,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:22:51,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:22:51,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2024-02-02 09:22:51,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:51,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:51,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2024-02-02 09:22:51,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:52,212 INFO L124 PetriNetUnfolderBase]: 1085/2103 cut-off events. [2024-02-02 09:22:52,213 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2024-02-02 09:22:52,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3908 conditions, 2103 events. 1085/2103 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14200 event pairs, 407 based on Foata normal form. 82/2132 useless extension candidates. Maximal degree in co-relation 3417. Up to 1575 conditions per place. [2024-02-02 09:22:52,228 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 37 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2024-02-02 09:22:52,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 239 flow [2024-02-02 09:22:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:22:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:22:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2024-02-02 09:22:52,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2024-02-02 09:22:52,241 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 135 flow. Second operand 3 states and 140 transitions. [2024-02-02 09:22:52,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 239 flow [2024-02-02 09:22:52,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 69 transitions, 227 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-02-02 09:22:52,251 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 139 flow [2024-02-02 09:22:52,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-02-02 09:22:52,256 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -4 predicate places. [2024-02-02 09:22:52,256 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 139 flow [2024-02-02 09:22:52,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:52,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:52,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 09:22:52,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:22:52,257 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:52,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash -931074202, now seen corresponding path program 1 times [2024-02-02 09:22:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:52,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088615930] [2024-02-02 09:22:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:52,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22: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-02-02 09:22:52,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:52,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088615930] [2024-02-02 09:22:52,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088615930] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:52,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:52,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:52,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205494768] [2024-02-02 09:22:52,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:52,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:52,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:52,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:52,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:52,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2024-02-02 09:22:52,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-02-02 09:22:52,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:52,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2024-02-02 09:22:52,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:52,646 INFO L124 PetriNetUnfolderBase]: 654/1511 cut-off events. [2024-02-02 09:22:52,647 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-02-02 09:22:52,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2819 conditions, 1511 events. 654/1511 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10802 event pairs, 144 based on Foata normal form. 52/1424 useless extension candidates. Maximal degree in co-relation 1195. Up to 931 conditions per place. [2024-02-02 09:22:52,655 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 37 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-02-02 09:22:52,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 69 transitions, 243 flow [2024-02-02 09:22:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2024-02-02 09:22:52,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6884615384615385 [2024-02-02 09:22:52,660 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 139 flow. Second operand 4 states and 179 transitions. [2024-02-02 09:22:52,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 69 transitions, 243 flow [2024-02-02 09:22:52,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 239 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:22:52,664 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 136 flow [2024-02-02 09:22:52,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2024-02-02 09:22:52,665 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -4 predicate places. [2024-02-02 09:22:52,665 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 136 flow [2024-02-02 09:22:52,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-02-02 09:22:52,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:52,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:52,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:22:52,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:52,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:52,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1410395163, now seen corresponding path program 1 times [2024-02-02 09:22:52,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:52,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552174635] [2024-02-02 09:22:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:52,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:52,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552174635] [2024-02-02 09:22:52,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552174635] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:52,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:52,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:52,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749579417] [2024-02-02 09:22:52,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:52,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:52,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:52,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:52,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:52,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2024-02-02 09:22:52,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-02-02 09:22:52,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:52,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2024-02-02 09:22:52,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:52,948 INFO L124 PetriNetUnfolderBase]: 665/1530 cut-off events. [2024-02-02 09:22:52,948 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2024-02-02 09:22:52,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 1530 events. 665/1530 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10822 event pairs, 141 based on Foata normal form. 58/1444 useless extension candidates. Maximal degree in co-relation 2787. Up to 916 conditions per place. [2024-02-02 09:22:52,956 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 41 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-02-02 09:22:52,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 71 transitions, 257 flow [2024-02-02 09:22:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2024-02-02 09:22:52,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7038461538461539 [2024-02-02 09:22:52,958 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 136 flow. Second operand 4 states and 183 transitions. [2024-02-02 09:22:52,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 71 transitions, 257 flow [2024-02-02 09:22:52,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:52,960 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 133 flow [2024-02-02 09:22:52,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-02-02 09:22:52,962 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -5 predicate places. [2024-02-02 09:22:52,963 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 133 flow [2024-02-02 09:22:52,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-02-02 09:22:52,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:52,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:52,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:22:52,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:52,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash -732458266, now seen corresponding path program 1 times [2024-02-02 09:22:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:52,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551762240] [2024-02-02 09:22:52,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:53,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:53,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551762240] [2024-02-02 09:22:53,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551762240] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:53,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:53,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:22:53,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328395062] [2024-02-02 09:22:53,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:53,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:53,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:53,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:53,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:53,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 65 [2024-02-02 09:22:53,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-02-02 09:22:53,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:53,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 65 [2024-02-02 09:22:53,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:53,285 INFO L124 PetriNetUnfolderBase]: 1519/2774 cut-off events. [2024-02-02 09:22:53,285 INFO L125 PetriNetUnfolderBase]: For 269/276 co-relation queries the response was YES. [2024-02-02 09:22:53,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5586 conditions, 2774 events. 1519/2774 cut-off events. For 269/276 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18521 event pairs, 489 based on Foata normal form. 25/2746 useless extension candidates. Maximal degree in co-relation 4895. Up to 2105 conditions per place. [2024-02-02 09:22:53,298 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 50 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2024-02-02 09:22:53,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 77 transitions, 300 flow [2024-02-02 09:22:53,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2024-02-02 09:22:53,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6307692307692307 [2024-02-02 09:22:53,300 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 133 flow. Second operand 4 states and 164 transitions. [2024-02-02 09:22:53,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 77 transitions, 300 flow [2024-02-02 09:22:53,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:53,303 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 156 flow [2024-02-02 09:22:53,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2024-02-02 09:22:53,304 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2024-02-02 09:22:53,304 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 156 flow [2024-02-02 09:22:53,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-02-02 09:22:53,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:53,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:53,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:22:53,305 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:53,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:53,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1818285662, now seen corresponding path program 1 times [2024-02-02 09:22:53,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:53,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862352985] [2024-02-02 09:22:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:53,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:53,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:53,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862352985] [2024-02-02 09:22:53,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862352985] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:53,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:53,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:53,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85390672] [2024-02-02 09:22:53,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:53,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:53,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:53,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:53,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:53,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2024-02-02 09:22:53,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-02-02 09:22:53,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:53,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2024-02-02 09:22:53,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:53,615 INFO L124 PetriNetUnfolderBase]: 714/2010 cut-off events. [2024-02-02 09:22:53,615 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2024-02-02 09:22:53,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 2010 events. 714/2010 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 16411 event pairs, 92 based on Foata normal form. 68/1835 useless extension candidates. Maximal degree in co-relation 3537. Up to 822 conditions per place. [2024-02-02 09:22:53,625 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 53 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2024-02-02 09:22:53,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 356 flow [2024-02-02 09:22:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2024-02-02 09:22:53,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7230769230769231 [2024-02-02 09:22:53,626 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 156 flow. Second operand 4 states and 188 transitions. [2024-02-02 09:22:53,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 356 flow [2024-02-02 09:22:53,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:53,630 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 148 flow [2024-02-02 09:22:53,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-02-02 09:22:53,631 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2024-02-02 09:22:53,632 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 148 flow [2024-02-02 09:22:53,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-02-02 09:22:53,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:53,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:53,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:22:53,632 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:53,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:53,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1231369463, now seen corresponding path program 1 times [2024-02-02 09:22:53,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:53,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118986442] [2024-02-02 09:22:53,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:53,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:53,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:53,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118986442] [2024-02-02 09:22:53,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118986442] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:53,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:53,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:53,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586727523] [2024-02-02 09:22:53,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:53,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:22:53,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:53,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:22:53,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:22:53,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 65 [2024-02-02 09:22:53,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 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-02-02 09:22:53,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:53,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 65 [2024-02-02 09:22:53,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:53,970 INFO L124 PetriNetUnfolderBase]: 1747/3159 cut-off events. [2024-02-02 09:22:53,970 INFO L125 PetriNetUnfolderBase]: For 587/597 co-relation queries the response was YES. [2024-02-02 09:22:53,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 3159 events. 1747/3159 cut-off events. For 587/597 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 21436 event pairs, 605 based on Foata normal form. 61/3155 useless extension candidates. Maximal degree in co-relation 5967. Up to 1630 conditions per place. [2024-02-02 09:22:53,984 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 62 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2024-02-02 09:22:53,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 87 transitions, 367 flow [2024-02-02 09:22:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:22:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:22:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2024-02-02 09:22:53,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-02-02 09:22:53,986 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 148 flow. Second operand 5 states and 200 transitions. [2024-02-02 09:22:53,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 87 transitions, 367 flow [2024-02-02 09:22:53,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 87 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:53,988 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 169 flow [2024-02-02 09:22:53,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-02-02 09:22:53,988 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places. [2024-02-02 09:22:53,989 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 169 flow [2024-02-02 09:22:53,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 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-02-02 09:22:53,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:53,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:53,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:22:53,989 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:53,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:53,990 INFO L85 PathProgramCache]: Analyzing trace with hash 583064692, now seen corresponding path program 1 times [2024-02-02 09:22:53,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:53,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220951949] [2024-02-02 09:22:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:54,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:54,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220951949] [2024-02-02 09:22:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220951949] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:54,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:54,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:22:54,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113259481] [2024-02-02 09:22:54,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:54,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:54,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:54,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:54,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:54,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 65 [2024-02-02 09:22:54,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-02-02 09:22:54,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:54,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 65 [2024-02-02 09:22:54,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:54,298 INFO L124 PetriNetUnfolderBase]: 1819/3216 cut-off events. [2024-02-02 09:22:54,299 INFO L125 PetriNetUnfolderBase]: For 1101/1144 co-relation queries the response was YES. [2024-02-02 09:22:54,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6929 conditions, 3216 events. 1819/3216 cut-off events. For 1101/1144 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 21671 event pairs, 571 based on Foata normal form. 23/3183 useless extension candidates. Maximal degree in co-relation 6908. Up to 2557 conditions per place. [2024-02-02 09:22:54,318 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 49 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2024-02-02 09:22:54,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 331 flow [2024-02-02 09:22:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2024-02-02 09:22:54,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2024-02-02 09:22:54,319 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 169 flow. Second operand 4 states and 162 transitions. [2024-02-02 09:22:54,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 331 flow [2024-02-02 09:22:54,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:54,323 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 195 flow [2024-02-02 09:22:54,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2024-02-02 09:22:54,324 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 3 predicate places. [2024-02-02 09:22:54,324 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 195 flow [2024-02-02 09:22:54,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-02-02 09:22:54,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:54,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:54,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:22:54,325 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:54,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash 895136584, now seen corresponding path program 1 times [2024-02-02 09:22:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:54,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632677253] [2024-02-02 09:22:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:54,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:54,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:54,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632677253] [2024-02-02 09:22:54,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632677253] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:54,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:54,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:54,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868010983] [2024-02-02 09:22:54,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:54,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:22:54,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:54,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:22:54,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:22:54,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 65 [2024-02-02 09:22:54,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-02 09:22:54,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:54,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 65 [2024-02-02 09:22:54,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:54,645 INFO L124 PetriNetUnfolderBase]: 1819/3148 cut-off events. [2024-02-02 09:22:54,645 INFO L125 PetriNetUnfolderBase]: For 1245/1288 co-relation queries the response was YES. [2024-02-02 09:22:54,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7183 conditions, 3148 events. 1819/3148 cut-off events. For 1245/1288 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 20683 event pairs, 341 based on Foata normal form. 3/3096 useless extension candidates. Maximal degree in co-relation 7159. Up to 1548 conditions per place. [2024-02-02 09:22:54,661 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 61 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2024-02-02 09:22:54,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 87 transitions, 402 flow [2024-02-02 09:22:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:22:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:22:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2024-02-02 09:22:54,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6061538461538462 [2024-02-02 09:22:54,662 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 195 flow. Second operand 5 states and 197 transitions. [2024-02-02 09:22:54,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 87 transitions, 402 flow [2024-02-02 09:22:54,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 87 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:22:54,666 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 202 flow [2024-02-02 09:22:54,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2024-02-02 09:22:54,666 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places. [2024-02-02 09:22:54,667 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 202 flow [2024-02-02 09:22:54,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-02-02 09:22:54,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:54,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:54,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:22:54,667 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:54,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash 420941256, now seen corresponding path program 1 times [2024-02-02 09:22:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141157490] [2024-02-02 09:22:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:54,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:54,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141157490] [2024-02-02 09:22:54,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141157490] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:54,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:22:54,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237619840] [2024-02-02 09:22:54,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:54,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:54,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:54,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:54,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:54,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-02-02 09:22:54,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-02-02 09:22:54,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:54,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-02-02 09:22:54,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:55,051 INFO L124 PetriNetUnfolderBase]: 2751/4676 cut-off events. [2024-02-02 09:22:55,052 INFO L125 PetriNetUnfolderBase]: For 2489/2555 co-relation queries the response was YES. [2024-02-02 09:22:55,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10592 conditions, 4676 events. 2751/4676 cut-off events. For 2489/2555 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 30246 event pairs, 925 based on Foata normal form. 0/4436 useless extension candidates. Maximal degree in co-relation 10567. Up to 3991 conditions per place. [2024-02-02 09:22:55,072 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 50 selfloop transitions, 10 changer transitions 0/77 dead transitions. [2024-02-02 09:22:55,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 77 transitions, 404 flow [2024-02-02 09:22:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2024-02-02 09:22:55,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5884615384615385 [2024-02-02 09:22:55,073 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 202 flow. Second operand 4 states and 153 transitions. [2024-02-02 09:22:55,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 77 transitions, 404 flow [2024-02-02 09:22:55,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 393 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:55,077 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 274 flow [2024-02-02 09:22:55,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2024-02-02 09:22:55,078 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 8 predicate places. [2024-02-02 09:22:55,078 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 274 flow [2024-02-02 09:22:55,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-02-02 09:22:55,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:55,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:55,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-02 09:22:55,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:55,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:55,079 INFO L85 PathProgramCache]: Analyzing trace with hash -319325742, now seen corresponding path program 1 times [2024-02-02 09:22:55,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:55,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311997121] [2024-02-02 09:22:55,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:55,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:55,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:55,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311997121] [2024-02-02 09:22:55,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311997121] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:55,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:55,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:55,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797549423] [2024-02-02 09:22:55,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:55,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:22:55,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:55,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:22:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:22:55,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 65 [2024-02-02 09:22:55,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:55,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:55,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 65 [2024-02-02 09:22:55,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:55,240 INFO L124 PetriNetUnfolderBase]: 484/1508 cut-off events. [2024-02-02 09:22:55,240 INFO L125 PetriNetUnfolderBase]: For 728/728 co-relation queries the response was YES. [2024-02-02 09:22:55,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 1508 events. 484/1508 cut-off events. For 728/728 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 11608 event pairs, 176 based on Foata normal form. 100/1554 useless extension candidates. Maximal degree in co-relation 3079. Up to 472 conditions per place. [2024-02-02 09:22:55,244 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 39 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-02-02 09:22:55,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 73 transitions, 393 flow [2024-02-02 09:22:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:22:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:22:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2024-02-02 09:22:55,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7846153846153846 [2024-02-02 09:22:55,246 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 274 flow. Second operand 3 states and 153 transitions. [2024-02-02 09:22:55,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 73 transitions, 393 flow [2024-02-02 09:22:55,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 73 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:22:55,248 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 277 flow [2024-02-02 09:22:55,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=277, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2024-02-02 09:22:55,249 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 9 predicate places. [2024-02-02 09:22:55,249 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 277 flow [2024-02-02 09:22:55,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:55,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:55,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:55,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-02 09:22:55,250 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:55,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:55,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1123170547, now seen corresponding path program 1 times [2024-02-02 09:22:55,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:55,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815761413] [2024-02-02 09:22:55,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:55,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:55,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815761413] [2024-02-02 09:22:55,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815761413] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:55,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:55,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:55,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263249015] [2024-02-02 09:22:55,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:55,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:55,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:55,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:55,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:55,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-02-02 09:22:55,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-02-02 09:22:55,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:55,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-02-02 09:22:55,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:55,508 INFO L124 PetriNetUnfolderBase]: 1024/2236 cut-off events. [2024-02-02 09:22:55,509 INFO L125 PetriNetUnfolderBase]: For 1328/1341 co-relation queries the response was YES. [2024-02-02 09:22:55,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5391 conditions, 2236 events. 1024/2236 cut-off events. For 1328/1341 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15698 event pairs, 411 based on Foata normal form. 34/2238 useless extension candidates. Maximal degree in co-relation 5363. Up to 1041 conditions per place. [2024-02-02 09:22:55,518 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 59 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2024-02-02 09:22:55,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 511 flow [2024-02-02 09:22:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2024-02-02 09:22:55,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-02-02 09:22:55,519 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 277 flow. Second operand 4 states and 180 transitions. [2024-02-02 09:22:55,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 511 flow [2024-02-02 09:22:55,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 91 transitions, 496 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:22:55,523 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 341 flow [2024-02-02 09:22:55,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2024-02-02 09:22:55,523 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 13 predicate places. [2024-02-02 09:22:55,523 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 341 flow [2024-02-02 09:22:55,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-02-02 09:22:55,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:55,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:55,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-02 09:22:55,525 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:55,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash -22321037, now seen corresponding path program 2 times [2024-02-02 09:22:55,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:55,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220066726] [2024-02-02 09:22:55,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:55,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:55,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:55,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220066726] [2024-02-02 09:22:55,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220066726] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:55,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:55,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:55,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544756951] [2024-02-02 09:22:55,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:55,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:55,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:55,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:55,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:55,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-02-02 09:22:55,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-02-02 09:22:55,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:55,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-02-02 09:22:55,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:55,787 INFO L124 PetriNetUnfolderBase]: 1054/2378 cut-off events. [2024-02-02 09:22:55,787 INFO L125 PetriNetUnfolderBase]: For 2426/2444 co-relation queries the response was YES. [2024-02-02 09:22:55,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5841 conditions, 2378 events. 1054/2378 cut-off events. For 2426/2444 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17121 event pairs, 251 based on Foata normal form. 30/2370 useless extension candidates. Maximal degree in co-relation 5810. Up to 1199 conditions per place. [2024-02-02 09:22:55,799 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 58 selfloop transitions, 10 changer transitions 2/90 dead transitions. [2024-02-02 09:22:55,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 556 flow [2024-02-02 09:22:55,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2024-02-02 09:22:55,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.676923076923077 [2024-02-02 09:22:55,801 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 341 flow. Second operand 4 states and 176 transitions. [2024-02-02 09:22:55,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 556 flow [2024-02-02 09:22:55,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 90 transitions, 537 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 09:22:55,806 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 352 flow [2024-02-02 09:22:55,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2024-02-02 09:22:55,807 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 13 predicate places. [2024-02-02 09:22:55,807 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 352 flow [2024-02-02 09:22:55,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-02-02 09:22:55,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:55,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:55,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-02 09:22:55,808 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:55,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1405220373, now seen corresponding path program 1 times [2024-02-02 09:22:55,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:55,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580693178] [2024-02-02 09:22:55,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:55,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:55,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:55,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580693178] [2024-02-02 09:22:55,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580693178] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:55,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:55,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:55,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082011751] [2024-02-02 09:22:55,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:55,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:55,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:55,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:55,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:55,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-02-02 09:22:55,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-02-02 09:22:55,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:55,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-02-02 09:22:55,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:56,131 INFO L124 PetriNetUnfolderBase]: 1242/2811 cut-off events. [2024-02-02 09:22:56,131 INFO L125 PetriNetUnfolderBase]: For 2751/2762 co-relation queries the response was YES. [2024-02-02 09:22:56,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6894 conditions, 2811 events. 1242/2811 cut-off events. For 2751/2762 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 20831 event pairs, 354 based on Foata normal form. 20/2767 useless extension candidates. Maximal degree in co-relation 6152. Up to 852 conditions per place. [2024-02-02 09:22:56,142 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 59 selfloop transitions, 12 changer transitions 7/96 dead transitions. [2024-02-02 09:22:56,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 96 transitions, 595 flow [2024-02-02 09:22:56,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2024-02-02 09:22:56,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6807692307692308 [2024-02-02 09:22:56,143 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 352 flow. Second operand 4 states and 177 transitions. [2024-02-02 09:22:56,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 96 transitions, 595 flow [2024-02-02 09:22:56,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 96 transitions, 567 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-02 09:22:56,148 INFO L231 Difference]: Finished difference. Result has 82 places, 63 transitions, 368 flow [2024-02-02 09:22:56,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=368, PETRI_PLACES=82, PETRI_TRANSITIONS=63} [2024-02-02 09:22:56,149 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 13 predicate places. [2024-02-02 09:22:56,150 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 368 flow [2024-02-02 09:22:56,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-02-02 09:22:56,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:56,150 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-02-02 09:22:56,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-02 09:22:56,150 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:56,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash -311079425, now seen corresponding path program 1 times [2024-02-02 09:22:56,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:56,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695825812] [2024-02-02 09:22:56,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:56,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:56,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695825812] [2024-02-02 09:22:56,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695825812] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:56,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:56,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:56,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107054798] [2024-02-02 09:22:56,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:56,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:56,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:56,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:56,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:56,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 65 [2024-02-02 09:22:56,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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-02-02 09:22:56,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:56,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 65 [2024-02-02 09:22:56,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:56,462 INFO L124 PetriNetUnfolderBase]: 1383/2944 cut-off events. [2024-02-02 09:22:56,462 INFO L125 PetriNetUnfolderBase]: For 3339/3349 co-relation queries the response was YES. [2024-02-02 09:22:56,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7709 conditions, 2944 events. 1383/2944 cut-off events. For 3339/3349 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 21097 event pairs, 273 based on Foata normal form. 56/2991 useless extension candidates. Maximal degree in co-relation 7681. Up to 1313 conditions per place. [2024-02-02 09:22:56,479 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 67 selfloop transitions, 10 changer transitions 4/96 dead transitions. [2024-02-02 09:22:56,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 96 transitions, 668 flow [2024-02-02 09:22:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2024-02-02 09:22:56,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6576923076923077 [2024-02-02 09:22:56,481 INFO L175 Difference]: Start difference. First operand has 82 places, 63 transitions, 368 flow. Second operand 4 states and 171 transitions. [2024-02-02 09:22:56,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 96 transitions, 668 flow [2024-02-02 09:22:56,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 96 transitions, 662 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-02 09:22:56,486 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 398 flow [2024-02-02 09:22:56,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=398, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-02-02 09:22:56,487 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 14 predicate places. [2024-02-02 09:22:56,487 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 398 flow [2024-02-02 09:22:56,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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-02-02 09:22:56,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:56,487 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-02-02 09:22:56,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-02 09:22:56,488 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:56,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1840434139, now seen corresponding path program 2 times [2024-02-02 09:22:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:56,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775291808] [2024-02-02 09:22:56,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:56,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:56,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775291808] [2024-02-02 09:22:56,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775291808] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:56,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:56,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518244807] [2024-02-02 09:22:56,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:56,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:56,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:56,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:56,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:56,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 65 [2024-02-02 09:22:56,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 398 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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-02-02 09:22:56,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:56,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 65 [2024-02-02 09:22:56,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:56,815 INFO L124 PetriNetUnfolderBase]: 1537/3354 cut-off events. [2024-02-02 09:22:56,815 INFO L125 PetriNetUnfolderBase]: For 5523/5535 co-relation queries the response was YES. [2024-02-02 09:22:56,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9254 conditions, 3354 events. 1537/3354 cut-off events. For 5523/5535 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 25450 event pairs, 647 based on Foata normal form. 56/3381 useless extension candidates. Maximal degree in co-relation 9224. Up to 1258 conditions per place. [2024-02-02 09:22:56,827 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 75 selfloop transitions, 17 changer transitions 0/107 dead transitions. [2024-02-02 09:22:56,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 107 transitions, 820 flow [2024-02-02 09:22:56,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2024-02-02 09:22:56,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6576923076923077 [2024-02-02 09:22:56,829 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 398 flow. Second operand 4 states and 171 transitions. [2024-02-02 09:22:56,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 107 transitions, 820 flow [2024-02-02 09:22:56,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 107 transitions, 802 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-02 09:22:56,837 INFO L231 Difference]: Finished difference. Result has 82 places, 73 transitions, 545 flow [2024-02-02 09:22:56,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=545, PETRI_PLACES=82, PETRI_TRANSITIONS=73} [2024-02-02 09:22:56,837 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 13 predicate places. [2024-02-02 09:22:56,837 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 545 flow [2024-02-02 09:22:56,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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-02-02 09:22:56,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:56,837 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-02-02 09:22:56,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-02 09:22:56,838 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:56,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:56,838 INFO L85 PathProgramCache]: Analyzing trace with hash -991029077, now seen corresponding path program 1 times [2024-02-02 09:22:56,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:56,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476075099] [2024-02-02 09:22:56,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:56,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:56,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:56,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476075099] [2024-02-02 09:22:56,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476075099] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:56,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:56,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:22:56,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801955337] [2024-02-02 09:22:56,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:56,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:22:56,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:56,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:22:56,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:22:56,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-02-02 09:22:56,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 545 flow. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 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-02-02 09:22:56,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:56,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-02-02 09:22:56,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:57,237 INFO L124 PetriNetUnfolderBase]: 1745/3524 cut-off events. [2024-02-02 09:22:57,238 INFO L125 PetriNetUnfolderBase]: For 6154/6176 co-relation queries the response was YES. [2024-02-02 09:22:57,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10303 conditions, 3524 events. 1745/3524 cut-off events. For 6154/6176 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 25314 event pairs, 283 based on Foata normal form. 120/3635 useless extension candidates. Maximal degree in co-relation 10274. Up to 1446 conditions per place. [2024-02-02 09:22:57,250 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 84 selfloop transitions, 11 changer transitions 4/111 dead transitions. [2024-02-02 09:22:57,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 111 transitions, 909 flow [2024-02-02 09:22:57,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:22:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:22:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2024-02-02 09:22:57,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5846153846153846 [2024-02-02 09:22:57,251 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 545 flow. Second operand 5 states and 190 transitions. [2024-02-02 09:22:57,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 111 transitions, 909 flow [2024-02-02 09:22:57,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 111 transitions, 902 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:57,257 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 554 flow [2024-02-02 09:22:57,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=554, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2024-02-02 09:22:57,258 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 14 predicate places. [2024-02-02 09:22:57,258 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 554 flow [2024-02-02 09:22:57,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 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-02-02 09:22:57,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:57,258 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-02-02 09:22:57,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-02 09:22:57,258 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:57,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1702112306, now seen corresponding path program 1 times [2024-02-02 09:22:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:57,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604340620] [2024-02-02 09:22:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:57,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:57,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604340620] [2024-02-02 09:22:57,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604340620] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:57,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:57,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:22:57,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051352141] [2024-02-02 09:22:57,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:57,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:22:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:57,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:22:57,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:22:57,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-02-02 09:22:57,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 554 flow. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 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-02-02 09:22:57,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:57,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-02-02 09:22:57,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:57,630 INFO L124 PetriNetUnfolderBase]: 1642/3345 cut-off events. [2024-02-02 09:22:57,631 INFO L125 PetriNetUnfolderBase]: For 6635/6651 co-relation queries the response was YES. [2024-02-02 09:22:57,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10224 conditions, 3345 events. 1642/3345 cut-off events. For 6635/6651 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 23995 event pairs, 338 based on Foata normal form. 72/3408 useless extension candidates. Maximal degree in co-relation 10196. Up to 1193 conditions per place. [2024-02-02 09:22:57,643 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 76 selfloop transitions, 22 changer transitions 2/112 dead transitions. [2024-02-02 09:22:57,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 112 transitions, 938 flow [2024-02-02 09:22:57,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:22:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:22:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 192 transitions. [2024-02-02 09:22:57,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5907692307692308 [2024-02-02 09:22:57,644 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 554 flow. Second operand 5 states and 192 transitions. [2024-02-02 09:22:57,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 112 transitions, 938 flow [2024-02-02 09:22:57,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 112 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:57,650 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 656 flow [2024-02-02 09:22:57,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=656, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2024-02-02 09:22:57,651 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 14 predicate places. [2024-02-02 09:22:57,651 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 656 flow [2024-02-02 09:22:57,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 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-02-02 09:22:57,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:57,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] [2024-02-02 09:22:57,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-02 09:22:57,652 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:57,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:57,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1225873599, now seen corresponding path program 1 times [2024-02-02 09:22:57,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:57,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316002757] [2024-02-02 09:22:57,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:57,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:57,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:57,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316002757] [2024-02-02 09:22:57,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316002757] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:57,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:57,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:57,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989006963] [2024-02-02 09:22:57,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:57,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:57,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2024-02-02 09:22:57,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 656 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-02-02 09:22:57,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:57,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2024-02-02 09:22:57,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:57,896 INFO L124 PetriNetUnfolderBase]: 951/2208 cut-off events. [2024-02-02 09:22:57,896 INFO L125 PetriNetUnfolderBase]: For 7158/7215 co-relation queries the response was YES. [2024-02-02 09:22:57,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6839 conditions, 2208 events. 951/2208 cut-off events. For 7158/7215 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16118 event pairs, 343 based on Foata normal form. 69/2260 useless extension candidates. Maximal degree in co-relation 6810. Up to 1254 conditions per place. [2024-02-02 09:22:57,908 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 50 selfloop transitions, 18 changer transitions 2/87 dead transitions. [2024-02-02 09:22:57,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 87 transitions, 785 flow [2024-02-02 09:22:57,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2024-02-02 09:22:57,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6692307692307692 [2024-02-02 09:22:57,909 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 656 flow. Second operand 4 states and 174 transitions. [2024-02-02 09:22:57,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 87 transitions, 785 flow [2024-02-02 09:22:57,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 87 transitions, 734 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-02-02 09:22:57,915 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 572 flow [2024-02-02 09:22:57,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=572, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2024-02-02 09:22:57,915 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 14 predicate places. [2024-02-02 09:22:57,916 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 572 flow [2024-02-02 09:22:57,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-02-02 09:22:57,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:57,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:57,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-02 09:22:57,916 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:57,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash -379328288, now seen corresponding path program 1 times [2024-02-02 09:22:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357408784] [2024-02-02 09:22:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:57,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:57,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357408784] [2024-02-02 09:22:57,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357408784] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:57,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:57,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:57,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558308697] [2024-02-02 09:22:57,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:57,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:57,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:57,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:57,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:57,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 65 [2024-02-02 09:22:57,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 69 transitions, 572 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:57,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:57,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 65 [2024-02-02 09:22:57,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:58,177 INFO L124 PetriNetUnfolderBase]: 931/2208 cut-off events. [2024-02-02 09:22:58,177 INFO L125 PetriNetUnfolderBase]: For 5310/5364 co-relation queries the response was YES. [2024-02-02 09:22:58,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6697 conditions, 2208 events. 931/2208 cut-off events. For 5310/5364 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16252 event pairs, 301 based on Foata normal form. 39/2224 useless extension candidates. Maximal degree in co-relation 6668. Up to 1000 conditions per place. [2024-02-02 09:22:58,188 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 50 selfloop transitions, 22 changer transitions 2/91 dead transitions. [2024-02-02 09:22:58,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 91 transitions, 792 flow [2024-02-02 09:22:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2024-02-02 09:22:58,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-02-02 09:22:58,189 INFO L175 Difference]: Start difference. First operand has 83 places, 69 transitions, 572 flow. Second operand 4 states and 169 transitions. [2024-02-02 09:22:58,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 91 transitions, 792 flow [2024-02-02 09:22:58,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 91 transitions, 751 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-02 09:22:58,194 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 600 flow [2024-02-02 09:22:58,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=600, PETRI_PLACES=84, PETRI_TRANSITIONS=69} [2024-02-02 09:22:58,195 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 15 predicate places. [2024-02-02 09:22:58,195 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 600 flow [2024-02-02 09:22:58,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:58,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:58,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:58,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-02 09:22:58,196 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:22:58,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1820982657, now seen corresponding path program 1 times [2024-02-02 09:22:58,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:58,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089471782] [2024-02-02 09:22:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:22:58,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:22:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:22:58,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:22:58,238 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:22:58,239 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread3Err3ASSERT_VIOLATIONERROR_FUNCTION (32 of 33 remaining) [2024-02-02 09:22:58,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 33 remaining) [2024-02-02 09:22:58,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 33 remaining) [2024-02-02 09:22:58,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 33 remaining) [2024-02-02 09:22:58,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 33 remaining) [2024-02-02 09:22:58,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 33 remaining) [2024-02-02 09:22:58,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 33 remaining) [2024-02-02 09:22:58,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 33 remaining) [2024-02-02 09:22:58,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 33 remaining) [2024-02-02 09:22:58,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 33 remaining) [2024-02-02 09:22:58,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 33 remaining) [2024-02-02 09:22:58,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 33 remaining) [2024-02-02 09:22:58,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 33 remaining) [2024-02-02 09:22:58,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONERROR_FUNCTION (19 of 33 remaining) [2024-02-02 09:22:58,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 33 remaining) [2024-02-02 09:22:58,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 33 remaining) [2024-02-02 09:22:58,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 33 remaining) [2024-02-02 09:22:58,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 33 remaining) [2024-02-02 09:22:58,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 33 remaining) [2024-02-02 09:22:58,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 33 remaining) [2024-02-02 09:22:58,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 33 remaining) [2024-02-02 09:22:58,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 33 remaining) [2024-02-02 09:22:58,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 33 remaining) [2024-02-02 09:22:58,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 33 remaining) [2024-02-02 09:22:58,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 33 remaining) [2024-02-02 09:22:58,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 33 remaining) [2024-02-02 09:22:58,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 33 remaining) [2024-02-02 09:22:58,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 33 remaining) [2024-02-02 09:22:58,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 33 remaining) [2024-02-02 09:22:58,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 33 remaining) [2024-02-02 09:22:58,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 33 remaining) [2024-02-02 09:22:58,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 33 remaining) [2024-02-02 09:22:58,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 33 remaining) [2024-02-02 09:22:58,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-02 09:22:58,245 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:58,250 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:22:58,250 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:22:58,277 INFO L503 ceAbstractionStarter]: Automizer considered 15 witness invariants [2024-02-02 09:22:58,279 INFO L504 ceAbstractionStarter]: WitnessConsidered=15 [2024-02-02 09:22:58,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:22:58 BasicIcfg [2024-02-02 09:22:58,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:22:58,280 INFO L158 Benchmark]: Toolchain (without parser) took 7997.57ms. Allocated memory was 132.1MB in the beginning and 752.9MB in the end (delta: 620.8MB). Free memory was 95.1MB in the beginning and 631.1MB in the end (delta: -536.0MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2024-02-02 09:22:58,281 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 132.1MB. Free memory was 94.9MB in the beginning and 94.8MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:22:58,281 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory was 106.9MB in the beginning and 106.9MB in the end (delta: 83.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:22:58,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.46ms. Allocated memory is still 132.1MB. Free memory was 95.1MB in the beginning and 71.3MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-02-02 09:22:58,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.16ms. Allocated memory is still 132.1MB. Free memory was 71.3MB in the beginning and 69.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:22:58,282 INFO L158 Benchmark]: Boogie Preprocessor took 50.06ms. Allocated memory is still 132.1MB. Free memory was 69.2MB in the beginning and 66.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:22:58,282 INFO L158 Benchmark]: RCFGBuilder took 531.34ms. Allocated memory is still 132.1MB. Free memory was 66.7MB in the beginning and 100.9MB in the end (delta: -34.2MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2024-02-02 09:22:58,282 INFO L158 Benchmark]: TraceAbstraction took 6899.68ms. Allocated memory was 132.1MB in the beginning and 752.9MB in the end (delta: 620.8MB). Free memory was 100.3MB in the beginning and 631.1MB in the end (delta: -530.8MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2024-02-02 09:22:58,283 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 132.1MB. Free memory was 94.9MB in the beginning and 94.8MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory was 106.9MB in the beginning and 106.9MB in the end (delta: 83.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.46ms. Allocated memory is still 132.1MB. Free memory was 95.1MB in the beginning and 71.3MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.16ms. Allocated memory is still 132.1MB. Free memory was 71.3MB in the beginning and 69.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.06ms. Allocated memory is still 132.1MB. Free memory was 69.2MB in the beginning and 66.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 531.34ms. Allocated memory is still 132.1MB. Free memory was 66.7MB in the beginning and 100.9MB in the end (delta: -34.2MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6899.68ms. Allocated memory was 132.1MB in the beginning and 752.9MB in the end (delta: 620.8MB). Free memory was 100.3MB in the beginning and 631.1MB in the end (delta: -530.8MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L703] 0 int data = 0; [L730] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data],IntegerLiteral[0]]]] [L731] 0 pthread_t t1, t2, t3; VAL [data=0, mutex={3:0}, t1={7:0}, t2={5:0}, t3={6:0}] [L732] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data],IntegerLiteral[0]]]] [L732] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, data=0, mutex={3:0}, t1={7:0}, t2={5:0}, t3={6:0}] [L706] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, data=0, mutex={3:0}] [L733] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, data=0, mutex={3:0}, t1={7:0}, t2={5:0}, t3={6:0}] [L734] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=0, mutex={3:0}, t1={7:0}, t2={5:0}, t3={6:0}] [L713] 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}, arg={0:0}, data=0, mutex={3:0}] [L720] 3 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}, arg={0:0}, arg={0:0}, data=0, mutex={3:0}] [L707] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[data]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L707] 1 data++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=1, mutex={3:0}] [L708] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[data]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=1, mutex={3:0}] [L714] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[data]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L714] 2 data+=2 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L715] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[data]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L721] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[data]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L721] COND TRUE 3 data >= 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L722] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[data]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[COMPNEQ,IdentifierExpression[data],IntegerLiteral[0]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L722] 3 reach_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] - 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: 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: 713]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 716]: 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: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: 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: 732]: 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: 733]: 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 7 procedures, 115 locations, 33 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: 6.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1378 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 948 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2465 IncrementalHoareTripleChecker+Invalid, 2616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 91 mSDtfsCounter, 2465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=656occurred in iteration=17, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 1209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-02-02 09:22:58,317 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