./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/stateful01-1.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/stateful01-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/stateful01-1.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/stateful01-1.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-59af5db-m [2024-02-02 09:23:01,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:23:01,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:23:01,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:23:01,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:23:01,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:23:01,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:23:01,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:23:01,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:23:01,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:23:01,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:23:01,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:23:01,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:23:01,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:23:01,786 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:23:01,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:23:01,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:23:01,786 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:23:01,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:23:01,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:23:01,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:23:01,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:23:01,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:23:01,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:23:01,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:23:01,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:23:01,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:23:01,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:23:01,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:23:01,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:23:01,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:23:01,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:23:01,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:23:01,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:23:01,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:23:01,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:23:01,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:23:01,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:23:01,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:23:01,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:23:01,792 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:23:01,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:23:01,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:23:01,792 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:23:01,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:23:01,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:23:01,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:23:01,983 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:23:01,983 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:23:01,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/stateful01-1.yml/witness.yml [2024-02-02 09:23:02,089 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:23:02,090 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:23:02,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stateful01-1.i [2024-02-02 09:23:03,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:23:03,293 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:23:03,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i [2024-02-02 09:23:03,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409130dbe/b0b02b87d02c4c22a19674b5adbad936/FLAGa80d10c89 [2024-02-02 09:23:03,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409130dbe/b0b02b87d02c4c22a19674b5adbad936 [2024-02-02 09:23:03,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:23:03,325 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:23:03,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:23:03,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:23:03,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:23:03,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:23:02" (1/2) ... [2024-02-02 09:23:03,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae04e90 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:23:03, skipping insertion in model container [2024-02-02 09:23:03,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:23:02" (1/2) ... [2024-02-02 09:23:03,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4cade797 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:23:03, skipping insertion in model container [2024-02-02 09:23:03,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:23:03" (2/2) ... [2024-02-02 09:23:03,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae04e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03, skipping insertion in model container [2024-02-02 09:23:03,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:23:03" (2/2) ... [2024-02-02 09:23:03,333 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:23:03,360 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:23:03,362 INFO L101 nessWitnessExtractor]: Location invariant before [L719-L719] (data1 == 0) && (data2 == 0) [2024-02-02 09:23:03,362 INFO L101 nessWitnessExtractor]: Location invariant before [L711-L711] ((10 <= data1) && (data2 <= 2147483641)) && ((unsigned long )arg == 0UL) [2024-02-02 09:23:03,362 INFO L101 nessWitnessExtractor]: Location invariant before [L696-L696] (unsigned long )arg == 0UL [2024-02-02 09:23:03,362 INFO L101 nessWitnessExtractor]: Location invariant before [L700-L700] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-02-02 09:23:03,362 INFO L101 nessWitnessExtractor]: Location invariant before [L718-L718] (data1 == 0) && (data2 == 0) [2024-02-02 09:23:03,363 INFO L101 nessWitnessExtractor]: Location invariant before [L698-L698] (11 <= data1) && ((unsigned long )arg == 0UL) [2024-02-02 09:23:03,363 INFO L101 nessWitnessExtractor]: Location invariant before [L706-L706] (unsigned long )arg == 0UL [2024-02-02 09:23:03,363 INFO L101 nessWitnessExtractor]: Location invariant before [L708-L708] (15 <= data1) && ((unsigned long )arg == 0UL) [2024-02-02 09:23:03,363 INFO L101 nessWitnessExtractor]: Location invariant before [L709-L709] (unsigned long )arg == 0UL [2024-02-02 09:23:03,364 INFO L101 nessWitnessExtractor]: Location invariant before [L699-L699] (unsigned long )arg == 0UL [2024-02-02 09:23:03,364 INFO L101 nessWitnessExtractor]: Location invariant before [L710-L710] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-02-02 09:23:03,364 INFO L101 nessWitnessExtractor]: Location invariant before [L702-L702] (unsigned long )arg == 0UL [2024-02-02 09:23:03,364 INFO L101 nessWitnessExtractor]: Location invariant before [L701-L701] ((-2147483647 <= data2) && (10 <= data1)) && ((unsigned long )arg == 0UL) [2024-02-02 09:23:03,364 INFO L101 nessWitnessExtractor]: Location invariant before [L707-L707] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-02-02 09:23:03,364 INFO L101 nessWitnessExtractor]: Location invariant before [L721-L721] (data1 == 10) && (data2 == 10) [2024-02-02 09:23:03,364 INFO L101 nessWitnessExtractor]: Location invariant before [L720-L720] (data1 == 10) && (data2 == 0) [2024-02-02 09:23:03,365 INFO L101 nessWitnessExtractor]: Location invariant before [L697-L697] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-02-02 09:23:03,365 INFO L101 nessWitnessExtractor]: Location invariant before [L712-L712] (unsigned long )arg == 0UL [2024-02-02 09:23:03,365 INFO L101 nessWitnessExtractor]: Location invariant before [L717-L717] (data1 == 0) && (data2 == 0) [2024-02-02 09:23:03,401 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:23:03,617 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i[30826,30839] [2024-02-02 09:23:03,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:23:03,630 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-02 09:23:03,737 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i[30826,30839] [2024-02-02 09:23:03,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:23:03,766 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:23:03,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03 WrapperNode [2024-02-02 09:23:03,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:23:03,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:23:03,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:23:03,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:23:03,773 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:23:03" (1/1) ... [2024-02-02 09:23:03,784 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:23:03" (1/1) ... [2024-02-02 09:23:03,855 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2024-02-02 09:23:03,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:23:03,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:23:03,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:23:03,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:23:03,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03" (1/1) ... [2024-02-02 09:23:03,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03" (1/1) ... [2024-02-02 09:23:03,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03" (1/1) ... [2024-02-02 09:23:03,894 INFO L175 MemorySlicer]: Split 16 memory accesses to 5 slices as follows [2, 5, 5, 2, 2]. 31 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0, 0]. The 2 writes are split as follows [0, 0, 0, 1, 1]. [2024-02-02 09:23:03,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03" (1/1) ... [2024-02-02 09:23:03,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03" (1/1) ... [2024-02-02 09:23:03,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03" (1/1) ... [2024-02-02 09:23:03,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03" (1/1) ... [2024-02-02 09:23:03,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03" (1/1) ... [2024-02-02 09:23:03,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03" (1/1) ... [2024-02-02 09:23:03,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:23:03,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:23:03,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:23:03,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:23:03,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03" (1/1) ... [2024-02-02 09:23:03,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:23:03,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:23:03,942 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:23:03,943 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:23:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:23:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:23:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:23:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:23:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-02 09:23:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:23:03,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:23:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 09:23:03,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 09:23:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:23:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:23:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:23:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:23:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-02 09:23:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-02 09:23:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:23:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:23:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:23:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:23:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:23:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:23:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:23:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-02 09:23:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-02 09:23:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:23:03,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:23:03,971 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:23:04,073 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:23:04,075 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:23:04,315 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:23:04,316 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:23:04,437 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:23:04,437 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-02 09:23:04,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:23:04 BoogieIcfgContainer [2024-02-02 09:23:04,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:23:04,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:23:04,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:23:04,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:23:04,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:23:02" (1/4) ... [2024-02-02 09:23:04,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c48742f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:23:04, skipping insertion in model container [2024-02-02 09:23:04,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:23:03" (2/4) ... [2024-02-02 09:23:04,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c48742f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:23:04, skipping insertion in model container [2024-02-02 09:23:04,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:23:03" (3/4) ... [2024-02-02 09:23:04,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c48742f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:23:04, skipping insertion in model container [2024-02-02 09:23:04,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:23:04" (4/4) ... [2024-02-02 09:23:04,448 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful01-1.i [2024-02-02 09:23:04,462 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:23:04,462 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-02-02 09:23:04,462 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:23:04,523 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-02 09:23:04,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 72 transitions, 158 flow [2024-02-02 09:23:04,589 INFO L124 PetriNetUnfolderBase]: 1/70 cut-off events. [2024-02-02 09:23:04,589 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:23:04,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 70 events. 1/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-02-02 09:23:04,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 72 transitions, 158 flow [2024-02-02 09:23:04,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 67 transitions, 146 flow [2024-02-02 09:23:04,604 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:23:04,613 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;@6f484ea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:23:04,613 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-02-02 09:23:04,616 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:23:04,616 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:23:04,617 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:23:04,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:04,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:23:04,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:04,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:04,622 INFO L85 PathProgramCache]: Analyzing trace with hash 9449, now seen corresponding path program 1 times [2024-02-02 09:23:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:04,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53979079] [2024-02-02 09:23:04,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:23:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:04,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53979079] [2024-02-02 09:23:04,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53979079] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:04,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:04,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:23:04,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324570326] [2024-02-02 09:23:04,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:04,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:23:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:04,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:23:04,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:23:04,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 72 [2024-02-02 09:23:04,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:23:04,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:04,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 72 [2024-02-02 09:23:04,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:05,087 INFO L124 PetriNetUnfolderBase]: 297/777 cut-off events. [2024-02-02 09:23:05,088 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-02-02 09:23:05,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 777 events. 297/777 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4301 event pairs, 297 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 1244. Up to 543 conditions per place. [2024-02-02 09:23:05,097 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 30 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-02-02 09:23:05,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 204 flow [2024-02-02 09:23:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:23:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:23:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2024-02-02 09:23:05,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-02-02 09:23:05,110 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 146 flow. Second operand 3 states and 140 transitions. [2024-02-02 09:23:05,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 204 flow [2024-02-02 09:23:05,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:23:05,115 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 136 flow [2024-02-02 09:23:05,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-02-02 09:23:05,120 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2024-02-02 09:23:05,120 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 136 flow [2024-02-02 09:23:05,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:23:05,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:05,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:23:05,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:23:05,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:05,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash 281774487, now seen corresponding path program 1 times [2024-02-02 09:23:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:05,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513363068] [2024-02-02 09:23:05,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:05,195 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:23:05,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:05,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513363068] [2024-02-02 09:23:05,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513363068] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:05,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:05,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:23:05,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786117915] [2024-02-02 09:23:05,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:05,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:23:05,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:05,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:23:05,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:23:05,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 72 [2024-02-02 09:23:05,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:23:05,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:05,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 72 [2024-02-02 09:23:05,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:05,333 INFO L124 PetriNetUnfolderBase]: 240/707 cut-off events. [2024-02-02 09:23:05,333 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-02 09:23:05,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 707 events. 240/707 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4085 event pairs, 240 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 1155. Up to 443 conditions per place. [2024-02-02 09:23:05,337 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 27 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2024-02-02 09:23:05,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 194 flow [2024-02-02 09:23:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:23:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:23:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2024-02-02 09:23:05,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6493055555555556 [2024-02-02 09:23:05,339 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 136 flow. Second operand 4 states and 187 transitions. [2024-02-02 09:23:05,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 194 flow [2024-02-02 09:23:05,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:23:05,341 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 136 flow [2024-02-02 09:23:05,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2024-02-02 09:23:05,342 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2024-02-02 09:23:05,342 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 136 flow [2024-02-02 09:23:05,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:23:05,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:05,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 09:23:05,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:23:05,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:05,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash 145074782, now seen corresponding path program 1 times [2024-02-02 09:23:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:05,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227209232] [2024-02-02 09:23:05,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:05,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:05,391 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:23:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227209232] [2024-02-02 09:23:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227209232] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:05,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:23:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670517166] [2024-02-02 09:23:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:05,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:23:05,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:05,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:23:05,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:23:05,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 72 [2024-02-02 09:23:05,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:23:05,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:05,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 72 [2024-02-02 09:23:05,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:05,539 INFO L124 PetriNetUnfolderBase]: 240/703 cut-off events. [2024-02-02 09:23:05,539 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-02 09:23:05,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 703 events. 240/703 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4033 event pairs, 105 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 1149. Up to 425 conditions per place. [2024-02-02 09:23:05,542 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 33 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-02-02 09:23:05,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 223 flow [2024-02-02 09:23:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:23:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:23:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2024-02-02 09:23:05,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6736111111111112 [2024-02-02 09:23:05,546 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 136 flow. Second operand 4 states and 194 transitions. [2024-02-02 09:23:05,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 223 flow [2024-02-02 09:23:05,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 217 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 09:23:05,549 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 147 flow [2024-02-02 09:23:05,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-02-02 09:23:05,549 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2024-02-02 09:23:05,550 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 147 flow [2024-02-02 09:23:05,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:23:05,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:05,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:05,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:23:05,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:05,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1186100666, now seen corresponding path program 1 times [2024-02-02 09:23:05,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:05,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774741022] [2024-02-02 09:23:05,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:05,642 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:23:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774741022] [2024-02-02 09:23:05,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774741022] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:05,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:05,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:23:05,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372600818] [2024-02-02 09:23:05,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:05,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:23:05,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:05,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:23:05,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:23:05,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 72 [2024-02-02 09:23:05,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:05,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:05,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 72 [2024-02-02 09:23:05,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:05,758 INFO L124 PetriNetUnfolderBase]: 213/673 cut-off events. [2024-02-02 09:23:05,759 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2024-02-02 09:23:05,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 673 events. 213/673 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3871 event pairs, 107 based on Foata normal form. 36/640 useless extension candidates. Maximal degree in co-relation 408. Up to 367 conditions per place. [2024-02-02 09:23:05,762 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 38 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-02-02 09:23:05,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 245 flow [2024-02-02 09:23:05,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:23:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:23:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2024-02-02 09:23:05,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6840277777777778 [2024-02-02 09:23:05,764 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 147 flow. Second operand 4 states and 197 transitions. [2024-02-02 09:23:05,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 245 flow [2024-02-02 09:23:05,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:23:05,768 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 140 flow [2024-02-02 09:23:05,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-02-02 09:23:05,770 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2024-02-02 09:23:05,770 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 140 flow [2024-02-02 09:23:05,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:05,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:05,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:05,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:23:05,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:05,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:05,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1675956508, now seen corresponding path program 1 times [2024-02-02 09:23:05,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:05,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292505600] [2024-02-02 09:23:05,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:05,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:05,867 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:23:05,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:05,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292505600] [2024-02-02 09:23:05,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292505600] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:05,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:05,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:23:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986212063] [2024-02-02 09:23:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:05,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:23:05,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:05,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:23:05,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:23:05,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 72 [2024-02-02 09:23:05,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:05,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:05,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 72 [2024-02-02 09:23:05,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:06,008 INFO L124 PetriNetUnfolderBase]: 213/640 cut-off events. [2024-02-02 09:23:06,008 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-02-02 09:23:06,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 640 events. 213/640 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3711 event pairs, 11 based on Foata normal form. 36/629 useless extension candidates. Maximal degree in co-relation 1069. Up to 337 conditions per place. [2024-02-02 09:23:06,011 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 45 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-02-02 09:23:06,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 267 flow [2024-02-02 09:23:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:23:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:23:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2024-02-02 09:23:06,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2024-02-02 09:23:06,013 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 140 flow. Second operand 4 states and 204 transitions. [2024-02-02 09:23:06,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 267 flow [2024-02-02 09:23:06,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:23:06,015 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 135 flow [2024-02-02 09:23:06,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2024-02-02 09:23:06,017 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2024-02-02 09:23:06,017 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 135 flow [2024-02-02 09:23:06,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:06,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:06,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:06,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:23:06,018 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:06,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash 429324338, now seen corresponding path program 1 times [2024-02-02 09:23:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:06,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701028997] [2024-02-02 09:23:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:06,059 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:23:06,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701028997] [2024-02-02 09:23:06,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701028997] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:06,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:06,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:23:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529997645] [2024-02-02 09:23:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:06,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:23:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:06,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:23:06,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:23:06,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-02-02 09:23:06,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:06,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:06,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-02-02 09:23:06,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:06,214 INFO L124 PetriNetUnfolderBase]: 387/889 cut-off events. [2024-02-02 09:23:06,215 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-02-02 09:23:06,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 889 events. 387/889 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4588 event pairs, 183 based on Foata normal form. 22/901 useless extension candidates. Maximal degree in co-relation 1475. Up to 612 conditions per place. [2024-02-02 09:23:06,218 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 47 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-02-02 09:23:06,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 68 transitions, 258 flow [2024-02-02 09:23:06,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:23:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:23:06,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2024-02-02 09:23:06,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5868055555555556 [2024-02-02 09:23:06,219 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 135 flow. Second operand 4 states and 169 transitions. [2024-02-02 09:23:06,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 68 transitions, 258 flow [2024-02-02 09:23:06,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 68 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:23:06,221 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 132 flow [2024-02-02 09:23:06,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-02-02 09:23:06,221 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2024-02-02 09:23:06,221 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 132 flow [2024-02-02 09:23:06,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:06,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:06,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:06,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:23:06,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:06,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:06,222 INFO L85 PathProgramCache]: Analyzing trace with hash 424152925, now seen corresponding path program 1 times [2024-02-02 09:23:06,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:06,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862357946] [2024-02-02 09:23:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:06,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:06,268 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:23:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:06,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862357946] [2024-02-02 09:23:06,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862357946] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:06,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:06,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:23:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97565661] [2024-02-02 09:23:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:06,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:23:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:23:06,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:23:06,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-02-02 09:23:06,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:06,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:06,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-02-02 09:23:06,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:06,458 INFO L124 PetriNetUnfolderBase]: 431/987 cut-off events. [2024-02-02 09:23:06,459 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-02-02 09:23:06,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 987 events. 431/987 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5277 event pairs, 183 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1675. Up to 592 conditions per place. [2024-02-02 09:23:06,462 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 56 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2024-02-02 09:23:06,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 310 flow [2024-02-02 09:23:06,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:23:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:23:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2024-02-02 09:23:06,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-02-02 09:23:06,463 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 132 flow. Second operand 5 states and 207 transitions. [2024-02-02 09:23:06,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 310 flow [2024-02-02 09:23:06,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 80 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:23:06,465 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 160 flow [2024-02-02 09:23:06,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2024-02-02 09:23:06,465 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2024-02-02 09:23:06,466 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 160 flow [2024-02-02 09:23:06,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:06,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:06,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:06,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:23:06,466 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:06,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:06,466 INFO L85 PathProgramCache]: Analyzing trace with hash -574135609, now seen corresponding path program 1 times [2024-02-02 09:23:06,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:06,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644367864] [2024-02-02 09:23:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:06,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:06,508 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:23:06,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:06,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644367864] [2024-02-02 09:23:06,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644367864] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:06,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:06,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:23:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752199918] [2024-02-02 09:23:06,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:06,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:23:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:23:06,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:23:06,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-02-02 09:23:06,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:23:06,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:06,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-02-02 09:23:06,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:06,643 INFO L124 PetriNetUnfolderBase]: 441/984 cut-off events. [2024-02-02 09:23:06,643 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-02-02 09:23:06,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2012 conditions, 984 events. 441/984 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5227 event pairs, 71 based on Foata normal form. 22/999 useless extension candidates. Maximal degree in co-relation 1988. Up to 664 conditions per place. [2024-02-02 09:23:06,648 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 50 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-02-02 09:23:06,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 290 flow [2024-02-02 09:23:06,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:23:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:23:06,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2024-02-02 09:23:06,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5868055555555556 [2024-02-02 09:23:06,649 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 160 flow. Second operand 4 states and 169 transitions. [2024-02-02 09:23:06,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 290 flow [2024-02-02 09:23:06,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:23:06,650 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 157 flow [2024-02-02 09:23:06,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2024-02-02 09:23:06,651 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2024-02-02 09:23:06,651 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 157 flow [2024-02-02 09:23:06,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:23:06,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:06,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:06,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:23:06,652 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:06,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash -618334337, now seen corresponding path program 1 times [2024-02-02 09:23:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:06,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42960488] [2024-02-02 09:23:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:06,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:06,697 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:23:06,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:06,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42960488] [2024-02-02 09:23:06,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42960488] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:06,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:06,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:23:06,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785399592] [2024-02-02 09:23:06,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:06,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:23:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:23:06,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:23:06,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-02-02 09:23:06,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:06,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:06,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-02-02 09:23:06,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:06,857 INFO L124 PetriNetUnfolderBase]: 441/960 cut-off events. [2024-02-02 09:23:06,857 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2024-02-02 09:23:06,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2010 conditions, 960 events. 441/960 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4947 event pairs, 71 based on Foata normal form. 26/979 useless extension candidates. Maximal degree in co-relation 1986. Up to 560 conditions per place. [2024-02-02 09:23:06,861 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 58 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-02-02 09:23:06,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 334 flow [2024-02-02 09:23:06,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:23:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:23:06,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2024-02-02 09:23:06,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-02-02 09:23:06,862 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 157 flow. Second operand 5 states and 205 transitions. [2024-02-02 09:23:06,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 334 flow [2024-02-02 09:23:06,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:23:06,864 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 162 flow [2024-02-02 09:23:06,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-02-02 09:23:06,865 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2024-02-02 09:23:06,865 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 162 flow [2024-02-02 09:23:06,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:06,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:06,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:06,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-02 09:23:06,865 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:06,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash 346957208, now seen corresponding path program 1 times [2024-02-02 09:23:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:06,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108321173] [2024-02-02 09:23:06,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:06,969 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:23:06,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:06,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108321173] [2024-02-02 09:23:06,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108321173] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:06,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:06,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-02 09:23:06,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350901883] [2024-02-02 09:23:06,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:06,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 09:23:06,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:06,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 09:23:06,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 09:23:07,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-02-02 09:23:07,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 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:23:07,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:07,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-02-02 09:23:07,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:07,186 INFO L124 PetriNetUnfolderBase]: 393/911 cut-off events. [2024-02-02 09:23:07,186 INFO L125 PetriNetUnfolderBase]: For 234/237 co-relation queries the response was YES. [2024-02-02 09:23:07,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 911 events. 393/911 cut-off events. For 234/237 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4704 event pairs, 59 based on Foata normal form. 2/867 useless extension candidates. Maximal degree in co-relation 1685. Up to 251 conditions per place. [2024-02-02 09:23:07,190 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 70 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2024-02-02 09:23:07,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 431 flow [2024-02-02 09:23:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 09:23:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 09:23:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 254 transitions. [2024-02-02 09:23:07,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5879629629629629 [2024-02-02 09:23:07,192 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 162 flow. Second operand 6 states and 254 transitions. [2024-02-02 09:23:07,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 431 flow [2024-02-02 09:23:07,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 96 transitions, 423 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 09:23:07,193 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 222 flow [2024-02-02 09:23:07,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2024-02-02 09:23:07,194 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -2 predicate places. [2024-02-02 09:23:07,194 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 222 flow [2024-02-02 09:23:07,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 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:23:07,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:07,195 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:23:07,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-02 09:23:07,195 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:07,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1994266963, now seen corresponding path program 1 times [2024-02-02 09:23:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012283476] [2024-02-02 09:23:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:07,269 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:23:07,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:07,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012283476] [2024-02-02 09:23:07,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012283476] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:07,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:07,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-02 09:23:07,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654149262] [2024-02-02 09:23:07,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:07,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 09:23:07,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:07,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 09:23:07,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-02 09:23:07,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-02-02 09:23:07,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:07,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:07,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-02-02 09:23:07,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:07,518 INFO L124 PetriNetUnfolderBase]: 406/897 cut-off events. [2024-02-02 09:23:07,518 INFO L125 PetriNetUnfolderBase]: For 485/485 co-relation queries the response was YES. [2024-02-02 09:23:07,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 897 events. 406/897 cut-off events. For 485/485 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4587 event pairs, 61 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 2068. Up to 262 conditions per place. [2024-02-02 09:23:07,523 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 70 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-02-02 09:23:07,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 497 flow [2024-02-02 09:23:07,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 09:23:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 09:23:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 258 transitions. [2024-02-02 09:23:07,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2024-02-02 09:23:07,525 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 222 flow. Second operand 6 states and 258 transitions. [2024-02-02 09:23:07,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 497 flow [2024-02-02 09:23:07,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 492 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:23:07,528 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 301 flow [2024-02-02 09:23:07,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2024-02-02 09:23:07,529 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2024-02-02 09:23:07,529 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 301 flow [2024-02-02 09:23:07,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:07,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:07,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:07,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-02 09:23:07,530 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:07,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2142017965, now seen corresponding path program 1 times [2024-02-02 09:23:07,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:07,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920655916] [2024-02-02 09:23:07,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:07,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:07,610 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:23:07,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:07,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920655916] [2024-02-02 09:23:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920655916] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:07,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:07,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:23:07,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346708961] [2024-02-02 09:23:07,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:07,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:23:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:07,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:23:07,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:23:07,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 72 [2024-02-02 09:23:07,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 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:23:07,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:07,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 72 [2024-02-02 09:23:07,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:07,672 INFO L124 PetriNetUnfolderBase]: 146/475 cut-off events. [2024-02-02 09:23:07,673 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2024-02-02 09:23:07,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 475 events. 146/475 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2280 event pairs, 46 based on Foata normal form. 41/502 useless extension candidates. Maximal degree in co-relation 1053. Up to 176 conditions per place. [2024-02-02 09:23:07,675 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 38 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2024-02-02 09:23:07,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 409 flow [2024-02-02 09:23:07,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:23:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:23:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2024-02-02 09:23:07,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7731481481481481 [2024-02-02 09:23:07,677 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 301 flow. Second operand 3 states and 167 transitions. [2024-02-02 09:23:07,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 409 flow [2024-02-02 09:23:07,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 73 transitions, 389 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-02-02 09:23:07,680 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 297 flow [2024-02-02 09:23:07,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2024-02-02 09:23:07,681 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2024-02-02 09:23:07,681 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 297 flow [2024-02-02 09:23:07,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 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:23:07,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:07,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:07,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-02 09:23:07,682 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:07,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2032871053, now seen corresponding path program 1 times [2024-02-02 09:23:07,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:07,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767128835] [2024-02-02 09:23:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:23:07,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:07,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767128835] [2024-02-02 09:23:07,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767128835] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:07,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:07,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 09:23:07,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091577101] [2024-02-02 09:23:07,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:07,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-02 09:23:07,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:07,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-02 09:23:07,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-02-02 09:23:07,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-02-02 09:23:07,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:07,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:07,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-02-02 09:23:07,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:08,080 INFO L124 PetriNetUnfolderBase]: 278/727 cut-off events. [2024-02-02 09:23:08,080 INFO L125 PetriNetUnfolderBase]: For 483/485 co-relation queries the response was YES. [2024-02-02 09:23:08,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1802 conditions, 727 events. 278/727 cut-off events. For 483/485 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3705 event pairs, 89 based on Foata normal form. 6/726 useless extension candidates. Maximal degree in co-relation 1769. Up to 195 conditions per place. [2024-02-02 09:23:08,085 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 79 selfloop transitions, 15 changer transitions 0/111 dead transitions. [2024-02-02 09:23:08,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 634 flow [2024-02-02 09:23:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-02 09:23:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-02 09:23:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 298 transitions. [2024-02-02 09:23:08,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5912698412698413 [2024-02-02 09:23:08,087 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 297 flow. Second operand 7 states and 298 transitions. [2024-02-02 09:23:08,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 634 flow [2024-02-02 09:23:08,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 111 transitions, 610 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:23:08,090 INFO L231 Difference]: Finished difference. Result has 89 places, 68 transitions, 347 flow [2024-02-02 09:23:08,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=347, PETRI_PLACES=89, PETRI_TRANSITIONS=68} [2024-02-02 09:23:08,092 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2024-02-02 09:23:08,092 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 68 transitions, 347 flow [2024-02-02 09:23:08,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:08,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:08,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:08,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-02 09:23:08,094 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:08,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:08,094 INFO L85 PathProgramCache]: Analyzing trace with hash 713933860, now seen corresponding path program 1 times [2024-02-02 09:23:08,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:08,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869195708] [2024-02-02 09:23:08,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:08,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:08,223 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:23:08,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:08,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869195708] [2024-02-02 09:23:08,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869195708] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:08,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:08,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 09:23:08,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433631809] [2024-02-02 09:23:08,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:08,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-02 09:23:08,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:08,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-02 09:23:08,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-02-02 09:23:08,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-02-02 09:23:08,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 68 transitions, 347 flow. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:08,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:08,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-02-02 09:23:08,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:08,503 INFO L124 PetriNetUnfolderBase]: 347/963 cut-off events. [2024-02-02 09:23:08,504 INFO L125 PetriNetUnfolderBase]: For 945/959 co-relation queries the response was YES. [2024-02-02 09:23:08,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 963 events. 347/963 cut-off events. For 945/959 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5489 event pairs, 67 based on Foata normal form. 10/966 useless extension candidates. Maximal degree in co-relation 2027. Up to 190 conditions per place. [2024-02-02 09:23:08,509 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 95 selfloop transitions, 16 changer transitions 0/127 dead transitions. [2024-02-02 09:23:08,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 127 transitions, 758 flow [2024-02-02 09:23:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-02 09:23:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-02 09:23:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 304 transitions. [2024-02-02 09:23:08,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2024-02-02 09:23:08,510 INFO L175 Difference]: Start difference. First operand has 89 places, 68 transitions, 347 flow. Second operand 7 states and 304 transitions. [2024-02-02 09:23:08,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 127 transitions, 758 flow [2024-02-02 09:23:08,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 127 transitions, 706 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-02-02 09:23:08,515 INFO L231 Difference]: Finished difference. Result has 91 places, 72 transitions, 380 flow [2024-02-02 09:23:08,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=380, PETRI_PLACES=91, PETRI_TRANSITIONS=72} [2024-02-02 09:23:08,516 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2024-02-02 09:23:08,516 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 72 transitions, 380 flow [2024-02-02 09:23:08,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:08,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:08,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:08,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-02 09:23:08,517 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:08,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:08,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1735046634, now seen corresponding path program 2 times [2024-02-02 09:23:08,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:08,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492698472] [2024-02-02 09:23:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:08,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:08,662 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:23:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492698472] [2024-02-02 09:23:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492698472] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:08,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 09:23:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104481882] [2024-02-02 09:23:08,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:08,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-02 09:23:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:08,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-02 09:23:08,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-02-02 09:23:08,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-02-02 09:23:08,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 72 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:08,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:08,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-02-02 09:23:08,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:08,937 INFO L124 PetriNetUnfolderBase]: 373/1031 cut-off events. [2024-02-02 09:23:08,937 INFO L125 PetriNetUnfolderBase]: For 995/1009 co-relation queries the response was YES. [2024-02-02 09:23:08,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2441 conditions, 1031 events. 373/1031 cut-off events. For 995/1009 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 6055 event pairs, 97 based on Foata normal form. 10/1033 useless extension candidates. Maximal degree in co-relation 2281. Up to 282 conditions per place. [2024-02-02 09:23:08,943 INFO L140 encePairwiseOnDemand]: 63/72 looper letters, 87 selfloop transitions, 18 changer transitions 0/121 dead transitions. [2024-02-02 09:23:08,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 121 transitions, 725 flow [2024-02-02 09:23:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-02 09:23:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-02 09:23:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 298 transitions. [2024-02-02 09:23:08,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5912698412698413 [2024-02-02 09:23:08,944 INFO L175 Difference]: Start difference. First operand has 91 places, 72 transitions, 380 flow. Second operand 7 states and 298 transitions. [2024-02-02 09:23:08,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 121 transitions, 725 flow [2024-02-02 09:23:08,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 121 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:23:08,948 INFO L231 Difference]: Finished difference. Result has 97 places, 73 transitions, 434 flow [2024-02-02 09:23:08,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=434, PETRI_PLACES=97, PETRI_TRANSITIONS=73} [2024-02-02 09:23:08,949 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 23 predicate places. [2024-02-02 09:23:08,949 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 73 transitions, 434 flow [2024-02-02 09:23:08,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:08,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:08,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:08,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-02 09:23:08,950 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:08,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:08,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1403748165, now seen corresponding path program 2 times [2024-02-02 09:23:08,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:08,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336586243] [2024-02-02 09:23:08,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:08,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:09,040 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:23:09,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:09,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336586243] [2024-02-02 09:23:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336586243] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:09,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 09:23:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484592485] [2024-02-02 09:23:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:09,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-02 09:23:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:09,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-02 09:23:09,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-02 09:23:09,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-02-02 09:23:09,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 73 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:09,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:09,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-02-02 09:23:09,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:09,366 INFO L124 PetriNetUnfolderBase]: 436/1185 cut-off events. [2024-02-02 09:23:09,366 INFO L125 PetriNetUnfolderBase]: For 1599/1603 co-relation queries the response was YES. [2024-02-02 09:23:09,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 1185 events. 436/1185 cut-off events. For 1599/1603 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7426 event pairs, 117 based on Foata normal form. 6/1184 useless extension candidates. Maximal degree in co-relation 2813. Up to 281 conditions per place. [2024-02-02 09:23:09,374 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 89 selfloop transitions, 21 changer transitions 0/127 dead transitions. [2024-02-02 09:23:09,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 127 transitions, 837 flow [2024-02-02 09:23:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 09:23:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 09:23:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 337 transitions. [2024-02-02 09:23:09,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5850694444444444 [2024-02-02 09:23:09,375 INFO L175 Difference]: Start difference. First operand has 97 places, 73 transitions, 434 flow. Second operand 8 states and 337 transitions. [2024-02-02 09:23:09,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 127 transitions, 837 flow [2024-02-02 09:23:09,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 127 transitions, 805 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-02-02 09:23:09,381 INFO L231 Difference]: Finished difference. Result has 103 places, 76 transitions, 511 flow [2024-02-02 09:23:09,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=511, PETRI_PLACES=103, PETRI_TRANSITIONS=76} [2024-02-02 09:23:09,381 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 29 predicate places. [2024-02-02 09:23:09,381 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 76 transitions, 511 flow [2024-02-02 09:23:09,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:09,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:09,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:09,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-02 09:23:09,382 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:09,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash -647895063, now seen corresponding path program 3 times [2024-02-02 09:23:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:09,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391076005] [2024-02-02 09:23:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:09,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:09,476 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:23:09,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:09,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391076005] [2024-02-02 09:23:09,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391076005] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:09,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:09,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 09:23:09,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801825780] [2024-02-02 09:23:09,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:09,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-02 09:23:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-02 09:23:09,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-02-02 09:23:09,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-02-02 09:23:09,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 76 transitions, 511 flow. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:09,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:09,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-02-02 09:23:09,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:09,784 INFO L124 PetriNetUnfolderBase]: 430/1175 cut-off events. [2024-02-02 09:23:09,784 INFO L125 PetriNetUnfolderBase]: For 2037/2041 co-relation queries the response was YES. [2024-02-02 09:23:09,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 1175 events. 430/1175 cut-off events. For 2037/2041 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7398 event pairs, 67 based on Foata normal form. 6/1174 useless extension candidates. Maximal degree in co-relation 2884. Up to 331 conditions per place. [2024-02-02 09:23:09,789 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 77 selfloop transitions, 23 changer transitions 0/117 dead transitions. [2024-02-02 09:23:09,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 117 transitions, 825 flow [2024-02-02 09:23:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-02 09:23:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-02 09:23:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 354 transitions. [2024-02-02 09:23:09,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-02-02 09:23:09,791 INFO L175 Difference]: Start difference. First operand has 103 places, 76 transitions, 511 flow. Second operand 9 states and 354 transitions. [2024-02-02 09:23:09,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 117 transitions, 825 flow [2024-02-02 09:23:09,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 117 transitions, 765 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-02-02 09:23:09,797 INFO L231 Difference]: Finished difference. Result has 104 places, 75 transitions, 491 flow [2024-02-02 09:23:09,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=491, PETRI_PLACES=104, PETRI_TRANSITIONS=75} [2024-02-02 09:23:09,798 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 30 predicate places. [2024-02-02 09:23:09,798 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 75 transitions, 491 flow [2024-02-02 09:23:09,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:09,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:09,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:09,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-02 09:23:09,799 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:09,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:09,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2112930640, now seen corresponding path program 3 times [2024-02-02 09:23:09,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:09,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116503191] [2024-02-02 09:23:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:09,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:09,896 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:23:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116503191] [2024-02-02 09:23:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116503191] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:09,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:09,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 09:23:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653931533] [2024-02-02 09:23:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:09,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-02 09:23:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:09,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-02 09:23:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-02-02 09:23:09,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-02-02 09:23:09,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 75 transitions, 491 flow. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:09,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:09,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-02-02 09:23:09,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:10,191 INFO L124 PetriNetUnfolderBase]: 463/1265 cut-off events. [2024-02-02 09:23:10,192 INFO L125 PetriNetUnfolderBase]: For 1859/1873 co-relation queries the response was YES. [2024-02-02 09:23:10,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1265 events. 463/1265 cut-off events. For 1859/1873 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8038 event pairs, 123 based on Foata normal form. 10/1264 useless extension candidates. Maximal degree in co-relation 2859. Up to 342 conditions per place. [2024-02-02 09:23:10,199 INFO L140 encePairwiseOnDemand]: 63/72 looper letters, 92 selfloop transitions, 22 changer transitions 0/129 dead transitions. [2024-02-02 09:23:10,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 129 transitions, 875 flow [2024-02-02 09:23:10,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 09:23:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 09:23:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 332 transitions. [2024-02-02 09:23:10,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2024-02-02 09:23:10,200 INFO L175 Difference]: Start difference. First operand has 104 places, 75 transitions, 491 flow. Second operand 8 states and 332 transitions. [2024-02-02 09:23:10,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 129 transitions, 875 flow [2024-02-02 09:23:10,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 129 transitions, 812 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-02-02 09:23:10,206 INFO L231 Difference]: Finished difference. Result has 106 places, 77 transitions, 520 flow [2024-02-02 09:23:10,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=520, PETRI_PLACES=106, PETRI_TRANSITIONS=77} [2024-02-02 09:23:10,206 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 32 predicate places. [2024-02-02 09:23:10,207 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 77 transitions, 520 flow [2024-02-02 09:23:10,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:10,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:10,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:10,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-02 09:23:10,207 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:10,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2091662366, now seen corresponding path program 4 times [2024-02-02 09:23:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:10,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643180067] [2024-02-02 09:23:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:23:10,308 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:23:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:23:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643180067] [2024-02-02 09:23:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643180067] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:23:10,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:23:10,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-02 09:23:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471151224] [2024-02-02 09:23:10,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:23:10,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-02 09:23:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:23:10,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-02 09:23:10,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-02 09:23:10,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-02-02 09:23:10,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 77 transitions, 520 flow. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:10,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:23:10,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-02-02 09:23:10,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:23:10,594 INFO L124 PetriNetUnfolderBase]: 462/1254 cut-off events. [2024-02-02 09:23:10,594 INFO L125 PetriNetUnfolderBase]: For 2176/2190 co-relation queries the response was YES. [2024-02-02 09:23:10,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1254 events. 462/1254 cut-off events. For 2176/2190 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7933 event pairs, 95 based on Foata normal form. 10/1255 useless extension candidates. Maximal degree in co-relation 2835. Up to 342 conditions per place. [2024-02-02 09:23:10,601 INFO L140 encePairwiseOnDemand]: 63/72 looper letters, 76 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2024-02-02 09:23:10,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 116 transitions, 820 flow [2024-02-02 09:23:10,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-02 09:23:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-02 09:23:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 346 transitions. [2024-02-02 09:23:10,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339506172839507 [2024-02-02 09:23:10,602 INFO L175 Difference]: Start difference. First operand has 106 places, 77 transitions, 520 flow. Second operand 9 states and 346 transitions. [2024-02-02 09:23:10,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 116 transitions, 820 flow [2024-02-02 09:23:10,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 116 transitions, 773 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-02-02 09:23:10,608 INFO L231 Difference]: Finished difference. Result has 106 places, 76 transitions, 515 flow [2024-02-02 09:23:10,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=515, PETRI_PLACES=106, PETRI_TRANSITIONS=76} [2024-02-02 09:23:10,608 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 32 predicate places. [2024-02-02 09:23:10,609 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 76 transitions, 515 flow [2024-02-02 09:23:10,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:23:10,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:23:10,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:10,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-02 09:23:10,609 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:23:10,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:23:10,610 INFO L85 PathProgramCache]: Analyzing trace with hash 429941126, now seen corresponding path program 1 times [2024-02-02 09:23:10,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:23:10,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454754295] [2024-02-02 09:23:10,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:23:10,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:23:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:23:10,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:23:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:23:10,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:23:10,665 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:23:10,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (35 of 36 remaining) [2024-02-02 09:23:10,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 36 remaining) [2024-02-02 09:23:10,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 36 remaining) [2024-02-02 09:23:10,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 36 remaining) [2024-02-02 09:23:10,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 36 remaining) [2024-02-02 09:23:10,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 36 remaining) [2024-02-02 09:23:10,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 36 remaining) [2024-02-02 09:23:10,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 36 remaining) [2024-02-02 09:23:10,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 36 remaining) [2024-02-02 09:23:10,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 36 remaining) [2024-02-02 09:23:10,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 36 remaining) [2024-02-02 09:23:10,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 36 remaining) [2024-02-02 09:23:10,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 36 remaining) [2024-02-02 09:23:10,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 36 remaining) [2024-02-02 09:23:10,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 36 remaining) [2024-02-02 09:23:10,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 36 remaining) [2024-02-02 09:23:10,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 36 remaining) [2024-02-02 09:23:10,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 36 remaining) [2024-02-02 09:23:10,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 36 remaining) [2024-02-02 09:23:10,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 36 remaining) [2024-02-02 09:23:10,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 36 remaining) [2024-02-02 09:23:10,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 36 remaining) [2024-02-02 09:23:10,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 36 remaining) [2024-02-02 09:23:10,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 36 remaining) [2024-02-02 09:23:10,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 36 remaining) [2024-02-02 09:23:10,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 36 remaining) [2024-02-02 09:23:10,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 36 remaining) [2024-02-02 09:23:10,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 36 remaining) [2024-02-02 09:23:10,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 36 remaining) [2024-02-02 09:23:10,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 36 remaining) [2024-02-02 09:23:10,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 36 remaining) [2024-02-02 09:23:10,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 36 remaining) [2024-02-02 09:23:10,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 36 remaining) [2024-02-02 09:23:10,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 36 remaining) [2024-02-02 09:23:10,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 36 remaining) [2024-02-02 09:23:10,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 36 remaining) [2024-02-02 09:23:10,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-02 09:23:10,673 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:23:10,678 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:23:10,678 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:23:10,710 INFO L503 ceAbstractionStarter]: Automizer considered 19 witness invariants [2024-02-02 09:23:10,710 INFO L504 ceAbstractionStarter]: WitnessConsidered=19 [2024-02-02 09:23:10,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:23:10 BasicIcfg [2024-02-02 09:23:10,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:23:10,711 INFO L158 Benchmark]: Toolchain (without parser) took 7386.18ms. Allocated memory was 174.1MB in the beginning and 358.6MB in the end (delta: 184.5MB). Free memory was 97.9MB in the beginning and 210.2MB in the end (delta: -112.3MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2024-02-02 09:23:10,711 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:23:10,711 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:23:10,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.04ms. Allocated memory is still 174.1MB. Free memory was 97.6MB in the beginning and 73.6MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-02-02 09:23:10,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.58ms. Allocated memory is still 174.1MB. Free memory was 73.6MB in the beginning and 144.3MB in the end (delta: -70.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-02-02 09:23:10,712 INFO L158 Benchmark]: Boogie Preprocessor took 59.31ms. Allocated memory is still 174.1MB. Free memory was 144.3MB in the beginning and 141.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:23:10,712 INFO L158 Benchmark]: RCFGBuilder took 522.98ms. Allocated memory is still 174.1MB. Free memory was 141.7MB in the beginning and 108.2MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-02 09:23:10,712 INFO L158 Benchmark]: TraceAbstraction took 6269.71ms. Allocated memory was 174.1MB in the beginning and 358.6MB in the end (delta: 184.5MB). Free memory was 107.0MB in the beginning and 210.2MB in the end (delta: -103.3MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. [2024-02-02 09:23:10,713 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.16ms. Allocated memory is still 121.6MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.04ms. Allocated memory is still 174.1MB. Free memory was 97.6MB in the beginning and 73.6MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.58ms. Allocated memory is still 174.1MB. Free memory was 73.6MB in the beginning and 144.3MB in the end (delta: -70.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.31ms. Allocated memory is still 174.1MB. Free memory was 144.3MB in the beginning and 141.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 522.98ms. Allocated memory is still 174.1MB. Free memory was 141.7MB in the beginning and 108.2MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6269.71ms. Allocated memory was 174.1MB in the beginning and 358.6MB in the end (delta: 184.5MB). Free memory was 107.0MB in the beginning and 210.2MB in the end (delta: -103.3MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 727]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L693] 0 int data1, data2; [L716] 0 pthread_t t1, t2; VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L717] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]]] [L718] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]]] [L719] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]]] [L719] 0 data1 = 10 VAL [data1=10, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L720] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]]] [L720] 0 data2 = 10 VAL [data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L721] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[10]]]]] [L721] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L722] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L706] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}] [L707] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L707] 2 data1+=5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=15, data2=10, ma={3:0}, mb={4:0}] [L723] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=15, data2=10, ma={3:0}, mb={4:0}] [L708] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[15],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=15, data2=10, ma={3:0}, mb={4:0}] [L696] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=15, data2=10, ma={3:0}, mb={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L697] 1 data1++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=10, ma={3:0}, mb={4:0}] [L698] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[11],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=10, ma={3:0}, mb={4:0}] [L699] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=10, ma={3:0}, mb={4:0}] [L700] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L700] 1 data2++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[data2]],BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L702] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L702] 1 return 0; [L709] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L723] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L724] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L710] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L710] 2 data2-=6 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L711] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPLEQ,IdentifierExpression[data2],IntegerLiteral[2147483641]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L712] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L712] 2 return 0; [L724] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L725] COND TRUE 0 data1==16 && data2==5 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L727] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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 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: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 122 locations, 36 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.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2226 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1680 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4067 IncrementalHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 89 mSDtfsCounter, 4067 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=520occurred in iteration=18, InterpolantAutomatonStates: 107, 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.3s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 3198 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:23:10,755 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