./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 ab2e0ac4 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-ab2e0ac-m [2024-01-29 14:21:24,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:21:24,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:21:24,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:21:24,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:21:24,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:21:24,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:21:24,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:21:24,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:21:24,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:21:24,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:21:24,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:21:24,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:21:24,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:21:24,880 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:21:24,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:21:24,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:21:24,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:21:24,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:21:24,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:21:24,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:21:24,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:21:24,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:21:24,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:21:24,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:21:24,883 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:21:24,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:21:24,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:21:24,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:21:24,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:21:24,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:21:24,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:21:24,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:21:24,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:21:24,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:21:24,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:21:24,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:21:24,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:21:24,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:21:24,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:21:24,887 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:21:24,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:21:24,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:21:24,887 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 14:21:25,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:21:25,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:21:25,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:21:25,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:21:25,156 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:21:25,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stateful01-1.i [2024-01-29 14:21:26,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:21:26,680 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:21:26,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i [2024-01-29 14:21:26,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310d43652/7ad2d83c2fa345beb43e5eb3d8a2afea/FLAG37e0ff565 [2024-01-29 14:21:26,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310d43652/7ad2d83c2fa345beb43e5eb3d8a2afea [2024-01-29 14:21:26,726 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:21:26,727 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:21:26,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/stateful01-1.yml/witness.yml [2024-01-29 14:21:26,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:21:26,852 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:21:26,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:21:26,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:21:26,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:21:26,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:21:26" (1/2) ... [2024-01-29 14:21:26,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714ebdf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:21:26, skipping insertion in model container [2024-01-29 14:21:26,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:21:26" (1/2) ... [2024-01-29 14:21:26,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@874dfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:21:26, skipping insertion in model container [2024-01-29 14:21:26,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:21:26" (2/2) ... [2024-01-29 14:21:26,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714ebdf6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:26, skipping insertion in model container [2024-01-29 14:21:26,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:21:26" (2/2) ... [2024-01-29 14:21:26,860 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:21:26,899 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:21:26,901 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] 15 <= data1 [2024-01-29 14:21:26,901 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (unsigned long )arg == 0UL [2024-01-29 14:21:26,901 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] data1 == 0 [2024-01-29 14:21:26,901 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] data2 == 0 [2024-01-29 14:21:26,901 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] (unsigned long )arg == 0UL [2024-01-29 14:21:26,902 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] 11 <= data1 [2024-01-29 14:21:26,902 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] (unsigned long )arg == 0UL [2024-01-29 14:21:26,902 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] -2147483647 <= data2 [2024-01-29 14:21:26,902 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] 10 <= data1 [2024-01-29 14:21:26,902 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (unsigned long )arg == 0UL [2024-01-29 14:21:26,903 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] data1 == 0 [2024-01-29 14:21:26,903 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] data2 == 0 [2024-01-29 14:21:26,903 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] 10 <= data1 [2024-01-29 14:21:26,903 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] (unsigned long )arg == 0UL [2024-01-29 14:21:26,903 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L712] (unsigned long )arg == 0UL [2024-01-29 14:21:26,903 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] (unsigned long )arg == 0UL [2024-01-29 14:21:26,903 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] data2 <= 2147483641 [2024-01-29 14:21:26,903 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] (unsigned long )arg == 0UL [2024-01-29 14:21:26,904 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] 10 <= data1 [2024-01-29 14:21:26,904 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] 10 <= data1 [2024-01-29 14:21:26,904 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] (unsigned long )arg == 0UL [2024-01-29 14:21:26,904 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (unsigned long )arg == 0UL [2024-01-29 14:21:26,905 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] 10 <= data1 [2024-01-29 14:21:26,905 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (unsigned long )arg == 0UL [2024-01-29 14:21:26,905 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] data1 == 10 [2024-01-29 14:21:26,905 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] data2 == 0 [2024-01-29 14:21:26,905 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] 10 <= data1 [2024-01-29 14:21:26,905 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (unsigned long )arg == 0UL [2024-01-29 14:21:26,905 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (unsigned long )arg == 0UL [2024-01-29 14:21:26,905 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] (unsigned long )arg == 0UL [2024-01-29 14:21:26,906 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] data1 == 10 [2024-01-29 14:21:26,906 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] data2 == 10 [2024-01-29 14:21:26,906 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] data1 == 0 [2024-01-29 14:21:26,906 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] data2 == 0 [2024-01-29 14:21:26,942 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:21:27,378 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i[30826,30839] [2024-01-29 14:21:27,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:21:27,398 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:21:27,507 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i[30826,30839] [2024-01-29 14:21:27,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:21:27,576 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:21:27,590 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27 WrapperNode [2024-01-29 14:21:27,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:21:27,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:21:27,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:21:27,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:21:27,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,644 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2024-01-29 14:21:27,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:21:27,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:21:27,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:21:27,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:21:27,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,685 INFO L175 MemorySlicer]: Split 16 memory accesses to 5 slices as follows [2, 5, 5, 2, 2]. 31 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0, 0]. The 2 writes are split as follows [0, 0, 0, 1, 1]. [2024-01-29 14:21:27,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:21:27,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:21:27,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:21:27,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:21:27,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (1/1) ... [2024-01-29 14:21:27,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:21:27,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:21:27,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 14:21:27,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 14:21:27,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:21:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:21:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:21:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 14:21:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-29 14:21:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:21:27,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:21:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:21:27,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:21:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:21:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:21:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:21:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 14:21:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-29 14:21:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 14:21:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:21:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:21:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:21:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:21:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:21:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:21:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 14:21:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-29 14:21:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 14:21:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:21:27,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:21:27,807 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 14:21:27,925 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:21:27,926 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:21:28,130 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:21:28,130 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:21:28,263 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:21:28,263 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 14:21:28,264 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:21:28 BoogieIcfgContainer [2024-01-29 14:21:28,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:21:28,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:21:28,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:21:28,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:21:28,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:21:26" (1/4) ... [2024-01-29 14:21:28,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6beab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:21:28, skipping insertion in model container [2024-01-29 14:21:28,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:21:26" (2/4) ... [2024-01-29 14:21:28,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6beab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:21:28, skipping insertion in model container [2024-01-29 14:21:28,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:21:27" (3/4) ... [2024-01-29 14:21:28,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6beab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:21:28, skipping insertion in model container [2024-01-29 14:21:28,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:21:28" (4/4) ... [2024-01-29 14:21:28,273 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful01-1.i [2024-01-29 14:21:28,290 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:21:28,291 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-01-29 14:21:28,291 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:21:28,379 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 14:21:28,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 102 transitions, 218 flow [2024-01-29 14:21:28,481 INFO L124 PetriNetUnfolderBase]: 1/100 cut-off events. [2024-01-29 14:21:28,482 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:21:28,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 1/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 144 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-01-29 14:21:28,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 102 transitions, 218 flow [2024-01-29 14:21:28,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 97 transitions, 206 flow [2024-01-29 14:21:28,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:21:28,512 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;@ad8e15e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:21:28,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-01-29 14:21:28,515 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:21:28,515 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:21:28,515 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:21:28,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:28,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:21:28,517 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:28,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:28,522 INFO L85 PathProgramCache]: Analyzing trace with hash 9952, now seen corresponding path program 1 times [2024-01-29 14:21:28,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:28,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964386362] [2024-01-29 14:21:28,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:28,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:28,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:28,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964386362] [2024-01-29 14:21:28,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964386362] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:28,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:28,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:21:28,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225245243] [2024-01-29 14:21:28,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:28,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:21:28,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:28,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:21:28,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:21:28,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 102 [2024-01-29 14:21:28,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 97 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:28,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:28,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 102 [2024-01-29 14:21:28,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:29,075 INFO L124 PetriNetUnfolderBase]: 240/709 cut-off events. [2024-01-29 14:21:29,075 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-29 14:21:29,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 709 events. 240/709 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4410 event pairs, 240 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1074. Up to 444 conditions per place. [2024-01-29 14:21:29,086 INFO L140 encePairwiseOnDemand]: 96/102 looper letters, 33 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-29 14:21:29,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 93 transitions, 268 flow [2024-01-29 14:21:29,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:21:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:21:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2024-01-29 14:21:29,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2024-01-29 14:21:29,100 INFO L175 Difference]: Start difference. First operand has 104 places, 97 transitions, 206 flow. Second operand 3 states and 222 transitions. [2024-01-29 14:21:29,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 93 transitions, 268 flow [2024-01-29 14:21:29,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 260 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:21:29,110 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 194 flow [2024-01-29 14:21:29,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2024-01-29 14:21:29,115 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -6 predicate places. [2024-01-29 14:21:29,115 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 194 flow [2024-01-29 14:21:29,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:29,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:29,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:21:29,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:21:29,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:29,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:29,121 INFO L85 PathProgramCache]: Analyzing trace with hash 308815, now seen corresponding path program 1 times [2024-01-29 14:21:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:29,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305272494] [2024-01-29 14:21:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:29,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:29,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305272494] [2024-01-29 14:21:29,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305272494] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:29,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:29,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:21:29,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007421441] [2024-01-29 14:21:29,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:29,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:21:29,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:29,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:21:29,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:21:29,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 102 [2024-01-29 14:21:29,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:29,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:29,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 102 [2024-01-29 14:21:29,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:29,352 INFO L124 PetriNetUnfolderBase]: 327/1073 cut-off events. [2024-01-29 14:21:29,352 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-29 14:21:29,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 1073 events. 327/1073 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7034 event pairs, 327 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 1667. Up to 595 conditions per place. [2024-01-29 14:21:29,399 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 31 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-01-29 14:21:29,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 90 transitions, 254 flow [2024-01-29 14:21:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:21:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:21:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2024-01-29 14:21:29,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7450980392156863 [2024-01-29 14:21:29,405 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 194 flow. Second operand 3 states and 228 transitions. [2024-01-29 14:21:29,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 90 transitions, 254 flow [2024-01-29 14:21:29,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 90 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:21:29,428 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 188 flow [2024-01-29 14:21:29,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2024-01-29 14:21:29,429 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-29 14:21:29,429 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 188 flow [2024-01-29 14:21:29,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:29,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:29,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:29,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:21:29,429 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:29,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1698758338, now seen corresponding path program 1 times [2024-01-29 14:21:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:29,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078571427] [2024-01-29 14:21:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:29,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:29,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078571427] [2024-01-29 14:21:29,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078571427] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:29,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:29,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:21:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591622908] [2024-01-29 14:21:29,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:29,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:21:29,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:29,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:21:29,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:21:29,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2024-01-29 14:21:29,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 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-01-29 14:21:29,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:29,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2024-01-29 14:21:29,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:29,650 INFO L124 PetriNetUnfolderBase]: 412/1218 cut-off events. [2024-01-29 14:21:29,650 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-29 14:21:29,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1979 conditions, 1218 events. 412/1218 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8198 event pairs, 203 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 1963. Up to 723 conditions per place. [2024-01-29 14:21:29,656 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 40 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2024-01-29 14:21:29,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 95 transitions, 285 flow [2024-01-29 14:21:29,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:21:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:21:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2024-01-29 14:21:29,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.761437908496732 [2024-01-29 14:21:29,658 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 188 flow. Second operand 3 states and 233 transitions. [2024-01-29 14:21:29,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 95 transitions, 285 flow [2024-01-29 14:21:29,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:21:29,661 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 201 flow [2024-01-29 14:21:29,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2024-01-29 14:21:29,663 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -10 predicate places. [2024-01-29 14:21:29,663 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 201 flow [2024-01-29 14:21:29,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 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-01-29 14:21:29,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:29,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:29,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:21:29,664 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:29,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:29,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1121901276, now seen corresponding path program 1 times [2024-01-29 14:21:29,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:29,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619012485] [2024-01-29 14:21:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:29,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:29,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:29,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619012485] [2024-01-29 14:21:29,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619012485] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:29,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:29,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:21:29,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042104085] [2024-01-29 14:21:29,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:29,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:21:29,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:29,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:21:29,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:21:29,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 102 [2024-01-29 14:21:29,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:29,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:29,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 102 [2024-01-29 14:21:29,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:29,837 INFO L124 PetriNetUnfolderBase]: 240/783 cut-off events. [2024-01-29 14:21:29,837 INFO L125 PetriNetUnfolderBase]: For 44/66 co-relation queries the response was YES. [2024-01-29 14:21:29,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 783 events. 240/783 cut-off events. For 44/66 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4769 event pairs, 90 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 979. Up to 325 conditions per place. [2024-01-29 14:21:29,842 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 47 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2024-01-29 14:21:29,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 102 transitions, 330 flow [2024-01-29 14:21:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:21:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:21:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2024-01-29 14:21:29,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7875816993464052 [2024-01-29 14:21:29,844 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 201 flow. Second operand 3 states and 241 transitions. [2024-01-29 14:21:29,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 102 transitions, 330 flow [2024-01-29 14:21:29,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 102 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:21:29,849 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 213 flow [2024-01-29 14:21:29,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2024-01-29 14:21:29,851 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-29 14:21:29,851 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 213 flow [2024-01-29 14:21:29,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:29,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:29,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:29,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:21:29,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:29,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:29,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1332084932, now seen corresponding path program 1 times [2024-01-29 14:21:29,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:29,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957616568] [2024-01-29 14:21:29,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:29,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:30,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:30,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957616568] [2024-01-29 14:21:30,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957616568] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:30,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:30,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:21:30,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048576477] [2024-01-29 14:21:30,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:30,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:21:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:30,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:21:30,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:21:30,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-29 14:21:30,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:30,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:30,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-29 14:21:30,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:30,149 INFO L124 PetriNetUnfolderBase]: 213/865 cut-off events. [2024-01-29 14:21:30,149 INFO L125 PetriNetUnfolderBase]: For 83/93 co-relation queries the response was YES. [2024-01-29 14:21:30,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 865 events. 213/865 cut-off events. For 83/93 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5568 event pairs, 101 based on Foata normal form. 108/804 useless extension candidates. Maximal degree in co-relation 553. Up to 367 conditions per place. [2024-01-29 14:21:30,153 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 40 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-29 14:21:30,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 309 flow [2024-01-29 14:21:30,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:21:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:21:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 305 transitions. [2024-01-29 14:21:30,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7475490196078431 [2024-01-29 14:21:30,155 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 213 flow. Second operand 4 states and 305 transitions. [2024-01-29 14:21:30,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 309 flow [2024-01-29 14:21:30,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 94 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:21:30,158 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 200 flow [2024-01-29 14:21:30,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2024-01-29 14:21:30,160 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -14 predicate places. [2024-01-29 14:21:30,160 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 200 flow [2024-01-29 14:21:30,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:30,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:30,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:30,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:21:30,161 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:30,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:30,162 INFO L85 PathProgramCache]: Analyzing trace with hash -234538837, now seen corresponding path program 1 times [2024-01-29 14:21:30,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:30,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658159576] [2024-01-29 14:21:30,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:30,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:30,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:30,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658159576] [2024-01-29 14:21:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658159576] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:30,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:21:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927833197] [2024-01-29 14:21:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:30,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:21:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:21:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:21:30,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-29 14:21:30,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:30,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:30,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-29 14:21:30,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:30,408 INFO L124 PetriNetUnfolderBase]: 213/654 cut-off events. [2024-01-29 14:21:30,408 INFO L125 PetriNetUnfolderBase]: For 74/90 co-relation queries the response was YES. [2024-01-29 14:21:30,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 654 events. 213/654 cut-off events. For 74/90 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3785 event pairs, 49 based on Foata normal form. 108/714 useless extension candidates. Maximal degree in co-relation 1126. Up to 337 conditions per place. [2024-01-29 14:21:30,411 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 47 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-29 14:21:30,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 94 transitions, 327 flow [2024-01-29 14:21:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:21:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:21:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2024-01-29 14:21:30,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-01-29 14:21:30,413 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 200 flow. Second operand 4 states and 312 transitions. [2024-01-29 14:21:30,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 94 transitions, 327 flow [2024-01-29 14:21:30,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 94 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:21:30,415 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 187 flow [2024-01-29 14:21:30,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2024-01-29 14:21:30,418 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-29 14:21:30,418 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 187 flow [2024-01-29 14:21:30,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:30,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:30,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:30,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:21:30,419 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:30,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:30,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2070598463, now seen corresponding path program 1 times [2024-01-29 14:21:30,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:30,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012615566] [2024-01-29 14:21:30,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:30,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:30,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012615566] [2024-01-29 14:21:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012615566] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:30,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:21:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309370721] [2024-01-29 14:21:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:30,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:21:30,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:21:30,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:21:30,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 102 [2024-01-29 14:21:30,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:30,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:30,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 102 [2024-01-29 14:21:30,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:30,595 INFO L124 PetriNetUnfolderBase]: 327/876 cut-off events. [2024-01-29 14:21:30,595 INFO L125 PetriNetUnfolderBase]: For 95/99 co-relation queries the response was YES. [2024-01-29 14:21:30,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 876 events. 327/876 cut-off events. For 95/99 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4867 event pairs, 143 based on Foata normal form. 22/850 useless extension candidates. Maximal degree in co-relation 1569. Up to 572 conditions per place. [2024-01-29 14:21:30,600 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 39 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2024-01-29 14:21:30,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 266 flow [2024-01-29 14:21:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:21:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:21:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2024-01-29 14:21:30,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6838235294117647 [2024-01-29 14:21:30,602 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 187 flow. Second operand 4 states and 279 transitions. [2024-01-29 14:21:30,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 266 flow [2024-01-29 14:21:30,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:21:30,605 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 172 flow [2024-01-29 14:21:30,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2024-01-29 14:21:30,606 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -26 predicate places. [2024-01-29 14:21:30,607 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 172 flow [2024-01-29 14:21:30,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:30,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:30,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:30,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:21:30,608 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:30,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash 922078032, now seen corresponding path program 1 times [2024-01-29 14:21:30,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:30,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674240145] [2024-01-29 14:21:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:30,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674240145] [2024-01-29 14:21:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674240145] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:30,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:30,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:21:30,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204256133] [2024-01-29 14:21:30,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:30,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:21:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:30,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:21:30,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:21:30,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 102 [2024-01-29 14:21:30,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:30,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:30,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 102 [2024-01-29 14:21:30,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:30,800 INFO L124 PetriNetUnfolderBase]: 327/883 cut-off events. [2024-01-29 14:21:30,800 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-01-29 14:21:30,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 883 events. 327/883 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4889 event pairs, 63 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 1577. Up to 458 conditions per place. [2024-01-29 14:21:30,804 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 46 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-01-29 14:21:30,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 295 flow [2024-01-29 14:21:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:21:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:21:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2024-01-29 14:21:30,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6936274509803921 [2024-01-29 14:21:30,805 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 172 flow. Second operand 4 states and 283 transitions. [2024-01-29 14:21:30,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 295 flow [2024-01-29 14:21:30,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 81 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:21:30,808 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 172 flow [2024-01-29 14:21:30,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2024-01-29 14:21:30,809 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -26 predicate places. [2024-01-29 14:21:30,809 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 172 flow [2024-01-29 14:21:30,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:30,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:30,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:30,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:21:30,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:30,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash -595792375, now seen corresponding path program 1 times [2024-01-29 14:21:30,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:30,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402034325] [2024-01-29 14:21:30,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:30,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:30,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:30,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402034325] [2024-01-29 14:21:30,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402034325] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:30,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:30,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:21:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179871472] [2024-01-29 14:21:30,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:30,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:21:30,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:30,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:21:30,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:21:30,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 102 [2024-01-29 14:21:30,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:30,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:30,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 102 [2024-01-29 14:21:30,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:30,957 INFO L124 PetriNetUnfolderBase]: 221/602 cut-off events. [2024-01-29 14:21:30,957 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-01-29 14:21:30,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 602 events. 221/602 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3166 event pairs, 68 based on Foata normal form. 14/579 useless extension candidates. Maximal degree in co-relation 1114. Up to 150 conditions per place. [2024-01-29 14:21:30,960 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 55 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2024-01-29 14:21:30,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 90 transitions, 346 flow [2024-01-29 14:21:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:21:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:21:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions. [2024-01-29 14:21:30,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7720588235294118 [2024-01-29 14:21:30,961 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 172 flow. Second operand 4 states and 315 transitions. [2024-01-29 14:21:30,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 90 transitions, 346 flow [2024-01-29 14:21:30,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 90 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:21:30,963 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 183 flow [2024-01-29 14:21:30,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-01-29 14:21:30,963 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -24 predicate places. [2024-01-29 14:21:30,964 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 183 flow [2024-01-29 14:21:30,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:30,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:30,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:30,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:21:30,964 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:30,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1931389560, now seen corresponding path program 1 times [2024-01-29 14:21:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117331064] [2024-01-29 14:21:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:31,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117331064] [2024-01-29 14:21:31,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117331064] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:31,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:31,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:21:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021570152] [2024-01-29 14:21:31,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:31,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:21:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:31,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:21:31,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:21:31,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-29 14:21:31,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:31,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:31,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-29 14:21:31,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:31,113 INFO L124 PetriNetUnfolderBase]: 231/640 cut-off events. [2024-01-29 14:21:31,113 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2024-01-29 14:21:31,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 640 events. 231/640 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3439 event pairs, 91 based on Foata normal form. 20/614 useless extension candidates. Maximal degree in co-relation 1229. Up to 179 conditions per place. [2024-01-29 14:21:31,116 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 54 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-01-29 14:21:31,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 92 transitions, 363 flow [2024-01-29 14:21:31,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:21:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:21:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 322 transitions. [2024-01-29 14:21:31,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7892156862745098 [2024-01-29 14:21:31,118 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 183 flow. Second operand 4 states and 322 transitions. [2024-01-29 14:21:31,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 92 transitions, 363 flow [2024-01-29 14:21:31,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 92 transitions, 354 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-29 14:21:31,120 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 218 flow [2024-01-29 14:21:31,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2024-01-29 14:21:31,121 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-29 14:21:31,121 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 218 flow [2024-01-29 14:21:31,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:31,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:31,121 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] [2024-01-29 14:21:31,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:21:31,122 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:31,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1434952835, now seen corresponding path program 1 times [2024-01-29 14:21:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:31,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240241858] [2024-01-29 14:21:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:31,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240241858] [2024-01-29 14:21:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240241858] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:31,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:31,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:21:31,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116883507] [2024-01-29 14:21:31,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:31,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:21:31,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:21:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:21:31,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 102 [2024-01-29 14:21:31,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:31,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:31,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 102 [2024-01-29 14:21:31,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:31,259 INFO L124 PetriNetUnfolderBase]: 116/492 cut-off events. [2024-01-29 14:21:31,259 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2024-01-29 14:21:31,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 492 events. 116/492 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2327 event pairs, 45 based on Foata normal form. 32/506 useless extension candidates. Maximal degree in co-relation 870. Up to 144 conditions per place. [2024-01-29 14:21:31,261 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 30 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-01-29 14:21:31,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 77 transitions, 302 flow [2024-01-29 14:21:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:21:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:21:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-01-29 14:21:31,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8398692810457516 [2024-01-29 14:21:31,262 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 218 flow. Second operand 3 states and 257 transitions. [2024-01-29 14:21:31,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 77 transitions, 302 flow [2024-01-29 14:21:31,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 77 transitions, 290 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-29 14:21:31,264 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 214 flow [2024-01-29 14:21:31,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-01-29 14:21:31,265 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-29 14:21:31,265 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 214 flow [2024-01-29 14:21:31,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:31,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:31,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:31,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 14:21:31,266 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:31,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1463062187, now seen corresponding path program 1 times [2024-01-29 14:21:31,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:31,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32107086] [2024-01-29 14:21:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:31,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:31,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32107086] [2024-01-29 14:21:31,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32107086] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:31,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:31,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:21:31,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197012114] [2024-01-29 14:21:31,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:31,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 14:21:31,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:31,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 14:21:31,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 14:21:31,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-29 14:21:31,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:31,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:31,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-29 14:21:31,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:31,427 INFO L124 PetriNetUnfolderBase]: 120/453 cut-off events. [2024-01-29 14:21:31,428 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-01-29 14:21:31,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 453 events. 120/453 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2036 event pairs, 49 based on Foata normal form. 6/431 useless extension candidates. Maximal degree in co-relation 880. Up to 101 conditions per place. [2024-01-29 14:21:31,430 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 52 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2024-01-29 14:21:31,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 90 transitions, 394 flow [2024-01-29 14:21:31,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:21:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:21:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2024-01-29 14:21:31,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7529411764705882 [2024-01-29 14:21:31,431 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 214 flow. Second operand 5 states and 384 transitions. [2024-01-29 14:21:31,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 90 transitions, 394 flow [2024-01-29 14:21:31,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 368 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 14:21:31,433 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 206 flow [2024-01-29 14:21:31,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=84, PETRI_TRANSITIONS=69} [2024-01-29 14:21:31,434 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-29 14:21:31,434 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 206 flow [2024-01-29 14:21:31,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:31,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:31,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:31,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 14:21:31,435 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:31,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:31,435 INFO L85 PathProgramCache]: Analyzing trace with hash -478832956, now seen corresponding path program 1 times [2024-01-29 14:21:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:31,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750687766] [2024-01-29 14:21:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:21:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:21:31,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:21:31,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750687766] [2024-01-29 14:21:31,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750687766] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:21:31,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:21:31,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:21:31,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498425454] [2024-01-29 14:21:31,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:21:31,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 14:21:31,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:21:31,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 14:21:31,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 14:21:31,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-29 14:21:31,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:31,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:21:31,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-29 14:21:31,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:21:31,590 INFO L124 PetriNetUnfolderBase]: 116/433 cut-off events. [2024-01-29 14:21:31,591 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2024-01-29 14:21:31,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 433 events. 116/433 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1961 event pairs, 65 based on Foata normal form. 4/399 useless extension candidates. Maximal degree in co-relation 814. Up to 146 conditions per place. [2024-01-29 14:21:31,605 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 48 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2024-01-29 14:21:31,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 345 flow [2024-01-29 14:21:31,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:21:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:21:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 376 transitions. [2024-01-29 14:21:31,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7372549019607844 [2024-01-29 14:21:31,607 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 206 flow. Second operand 5 states and 376 transitions. [2024-01-29 14:21:31,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 345 flow [2024-01-29 14:21:31,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 326 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-01-29 14:21:31,608 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 191 flow [2024-01-29 14:21:31,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2024-01-29 14:21:31,609 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -22 predicate places. [2024-01-29 14:21:31,609 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 191 flow [2024-01-29 14:21:31,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:21:31,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:21:31,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:31,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 14:21:31,610 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 14:21:31,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:21:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1529960877, now seen corresponding path program 1 times [2024-01-29 14:21:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:21:31,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743936668] [2024-01-29 14:21:31,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:21:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:21:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:21:31,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:21:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:21:31,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:21:31,663 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:21:31,664 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (60 of 61 remaining) [2024-01-29 14:21:31,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 61 remaining) [2024-01-29 14:21:31,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 61 remaining) [2024-01-29 14:21:31,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 61 remaining) [2024-01-29 14:21:31,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 61 remaining) [2024-01-29 14:21:31,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 61 remaining) [2024-01-29 14:21:31,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 61 remaining) [2024-01-29 14:21:31,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 61 remaining) [2024-01-29 14:21:31,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 61 remaining) [2024-01-29 14:21:31,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 61 remaining) [2024-01-29 14:21:31,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 61 remaining) [2024-01-29 14:21:31,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 61 remaining) [2024-01-29 14:21:31,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 61 remaining) [2024-01-29 14:21:31,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 61 remaining) [2024-01-29 14:21:31,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 61 remaining) [2024-01-29 14:21:31,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 61 remaining) [2024-01-29 14:21:31,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 61 remaining) [2024-01-29 14:21:31,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 61 remaining) [2024-01-29 14:21:31,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 61 remaining) [2024-01-29 14:21:31,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 61 remaining) [2024-01-29 14:21:31,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 61 remaining) [2024-01-29 14:21:31,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 61 remaining) [2024-01-29 14:21:31,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 61 remaining) [2024-01-29 14:21:31,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 61 remaining) [2024-01-29 14:21:31,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 61 remaining) [2024-01-29 14:21:31,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 61 remaining) [2024-01-29 14:21:31,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 61 remaining) [2024-01-29 14:21:31,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 61 remaining) [2024-01-29 14:21:31,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 61 remaining) [2024-01-29 14:21:31,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 61 remaining) [2024-01-29 14:21:31,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 61 remaining) [2024-01-29 14:21:31,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 61 remaining) [2024-01-29 14:21:31,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 61 remaining) [2024-01-29 14:21:31,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 61 remaining) [2024-01-29 14:21:31,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 61 remaining) [2024-01-29 14:21:31,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2024-01-29 14:21:31,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2024-01-29 14:21:31,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 61 remaining) [2024-01-29 14:21:31,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 61 remaining) [2024-01-29 14:21:31,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 61 remaining) [2024-01-29 14:21:31,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 61 remaining) [2024-01-29 14:21:31,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 61 remaining) [2024-01-29 14:21:31,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 61 remaining) [2024-01-29 14:21:31,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 61 remaining) [2024-01-29 14:21:31,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 61 remaining) [2024-01-29 14:21:31,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 61 remaining) [2024-01-29 14:21:31,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 61 remaining) [2024-01-29 14:21:31,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 61 remaining) [2024-01-29 14:21:31,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 61 remaining) [2024-01-29 14:21:31,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 61 remaining) [2024-01-29 14:21:31,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 61 remaining) [2024-01-29 14:21:31,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 61 remaining) [2024-01-29 14:21:31,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 61 remaining) [2024-01-29 14:21:31,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 61 remaining) [2024-01-29 14:21:31,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 61 remaining) [2024-01-29 14:21:31,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 61 remaining) [2024-01-29 14:21:31,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 61 remaining) [2024-01-29 14:21:31,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 61 remaining) [2024-01-29 14:21:31,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 61 remaining) [2024-01-29 14:21:31,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 61 remaining) [2024-01-29 14:21:31,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 61 remaining) [2024-01-29 14:21:31,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 14:21:31,674 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:21:31,679 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:21:31,679 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:21:31,729 INFO L503 ceAbstractionStarter]: Automizer considered 34 witness invariants [2024-01-29 14:21:31,729 INFO L504 ceAbstractionStarter]: WitnessConsidered=34 [2024-01-29 14:21:31,730 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:21:31 BasicIcfg [2024-01-29 14:21:31,730 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:21:31,731 INFO L158 Benchmark]: Toolchain (without parser) took 4878.91ms. Allocated memory was 182.5MB in the beginning and 260.0MB in the end (delta: 77.6MB). Free memory was 108.2MB in the beginning and 188.7MB in the end (delta: -80.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:21:31,731 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory was 149.8MB in the beginning and 149.8MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:21:31,731 INFO L158 Benchmark]: Witness Parser took 0.30ms. Allocated memory is still 182.5MB. Free memory was 111.8MB in the beginning and 111.4MB in the end (delta: 492.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:21:31,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 737.96ms. Allocated memory is still 182.5MB. Free memory was 108.2MB in the beginning and 131.7MB in the end (delta: -23.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-01-29 14:21:31,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.97ms. Allocated memory is still 182.5MB. Free memory was 131.7MB in the beginning and 129.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 14:21:31,732 INFO L158 Benchmark]: Boogie Preprocessor took 76.64ms. Allocated memory is still 182.5MB. Free memory was 129.7MB in the beginning and 127.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 14:21:31,732 INFO L158 Benchmark]: RCFGBuilder took 542.28ms. Allocated memory is still 182.5MB. Free memory was 127.6MB in the beginning and 94.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-01-29 14:21:31,732 INFO L158 Benchmark]: TraceAbstraction took 3464.13ms. Allocated memory was 182.5MB in the beginning and 260.0MB in the end (delta: 77.6MB). Free memory was 93.3MB in the beginning and 188.7MB in the end (delta: -95.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:21:31,733 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory was 149.8MB in the beginning and 149.8MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.30ms. Allocated memory is still 182.5MB. Free memory was 111.8MB in the beginning and 111.4MB in the end (delta: 492.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 737.96ms. Allocated memory is still 182.5MB. Free memory was 108.2MB in the beginning and 131.7MB in the end (delta: -23.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.97ms. Allocated memory is still 182.5MB. Free memory was 131.7MB in the beginning and 129.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.64ms. Allocated memory is still 182.5MB. Free memory was 129.7MB in the beginning and 127.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.28ms. Allocated memory is still 182.5MB. Free memory was 127.6MB in the beginning and 94.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3464.13ms. Allocated memory was 182.5MB in the beginning and 260.0MB in the end (delta: 77.6MB). Free memory was 93.3MB in the beginning and 188.7MB in the end (delta: -95.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 727]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L693] 0 int data1, data2; [L716] 0 pthread_t t1, t2; VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L717] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]] VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L717] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]]]] [L718] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]] VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L718] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]]]] [L719] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]] VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L719] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]]]] [L719] 0 data1 = 10 VAL [data1=10, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L720] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]] VAL [data1=10, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L720] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]]]] [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[COMPEQ,IdentifierExpression[data2],IntegerLiteral[10]]]] VAL [data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L721] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]]]] [L721] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L696] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] [L697] 1 data1++ VAL [arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L698] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L698] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[11],IdentifierExpression[data1]]]] VAL [arg={0:0}, arg={0:0}, data1=11, 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}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L700] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] VAL [arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L700] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L700] 1 data2++ VAL [arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] VAL [arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[data2]]]] VAL [arg={0:0}, arg={0:0}, data1=11, 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; [L722] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=11, 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 [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L707] 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=11, data2=11, ma={3:0}, mb={4:0}] [L707] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] [L707] 2 data1+=5 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}] [L708] 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}] [L708] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[15],IdentifierExpression[data1]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L709] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L710] 2 CodeAnnotStmt[Assertion[BinaryExpression[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] 0 \read(t1) 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[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] [L710] 2 data2-=6 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L711] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L711] 2 CodeAnnotStmt[Assertion[BinaryExpression[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}] [L711] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[data2],IntegerLiteral[2147483641]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L712] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L712] 2 return 0; [L724] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L725] COND TRUE 0 data1==16 && data2==5 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L727] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 172 locations, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 835 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 566 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1201 IncrementalHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 67 mSDtfsCounter, 1201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=10, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 672 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 14:21:31,756 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