./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.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/13-privatized_18-first-reads_unknown_2_neg.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d25acf6 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/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_18-first-reads_unknown_2_neg.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-3d25acf-m [2024-01-30 14:40:09,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:40:09,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:40:09,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:40:09,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:40:09,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:40:09,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:40:09,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:40:09,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:40:09,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:40:09,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:40:09,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:40:09,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:40:09,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:40:09,636 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:40:09,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:40:09,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:40:09,636 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:40:09,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:40:09,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:40:09,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:40:09,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:40:09,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:40:09,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:40:09,638 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:40:09,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:40:09,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:40:09,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:40:09,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:40:09,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:40:09,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:40:09,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:40:09,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:40:09,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:40:09,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:40:09,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:40:09,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:40:09,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:40:09,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:40:09,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:40:09,641 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:40:09,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:40:09,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:40:09,641 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-30 14:40:09,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:40:09,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:40:09,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:40:09,889 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:40:09,890 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:40:09,891 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/13-privatized_18-first-reads_unknown_2_neg.yml/witness.yml [2024-01-30 14:40:10,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:40:10,023 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:40:10,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i [2024-01-30 14:40:11,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:40:11,289 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:40:11,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i [2024-01-30 14:40:11,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3152d4a2e/b57e82204e884f55959b8f90e93617d4/FLAGad39310a3 [2024-01-30 14:40:11,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3152d4a2e/b57e82204e884f55959b8f90e93617d4 [2024-01-30 14:40:11,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:40:11,323 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:40:11,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:40:11,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:40:11,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:40:11,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:40:10" (1/2) ... [2024-01-30 14:40:11,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2173f389 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:40:11, skipping insertion in model container [2024-01-30 14:40:11,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:40:10" (1/2) ... [2024-01-30 14:40:11,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@b42a980 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:40:11, skipping insertion in model container [2024-01-30 14:40:11,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:40:11" (2/2) ... [2024-01-30 14:40:11,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2173f389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11, skipping insertion in model container [2024-01-30 14:40:11,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:40:11" (2/2) ... [2024-01-30 14:40:11,334 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:40:11,379 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:40:11,380 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] ((glob1 == 0) && (t == 42)) && ((unsigned long )arg == 0UL) [2024-01-30 14:40:11,380 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((((((((0 <= glob1) && (glob1 <= 1)) && (glob1 == 0 || glob1 == 1)) && (0 <= glob1)) && (glob1 <= 1)) && (glob1 == 0 || glob1 == 1)) && (0 <= glob1)) && (glob1 <= 1)) && (glob1 == 0 || glob1 == 1) [2024-01-30 14:40:11,380 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] glob1 == 0 [2024-01-30 14:40:11,381 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (((0 <= t) && (t <= 1)) && ((unsigned long )arg == 0UL)) && (t == 0 || t == 1) [2024-01-30 14:40:11,381 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-01-30 14:40:11,381 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L689] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-01-30 14:40:11,381 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] ((((0 <= t) && (t <= 1)) && (glob1 == 0)) && ((unsigned long )arg == 0UL)) && (t == 0 || t == 1) [2024-01-30 14:40:11,381 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (((0 <= glob1) && (glob1 <= 1)) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 1) [2024-01-30 14:40:11,381 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((((((0 <= glob1) && (0 <= t)) && (glob1 <= 1)) && (t <= 1)) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 1)) && (t == 0 || t == 1) [2024-01-30 14:40:11,381 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] glob1 == 0 [2024-01-30 14:40:11,382 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((((((0 <= glob1) && (0 <= t)) && (glob1 <= 1)) && (t <= 1)) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 1)) && (t == 0 || t == 1) [2024-01-30 14:40:11,382 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-30 14:40:11,420 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:40:11,618 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i[1097,1110] [2024-01-30 14:40:11,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:40:11,761 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:40:11,774 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i[1097,1110] [2024-01-30 14:40:11,775 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-30 14:40:11,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:40:11,866 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:40:11,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11 WrapperNode [2024-01-30 14:40:11,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:40:11,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:40:11,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:40:11,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:40:11,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,901 INFO L138 Inliner]: procedures = 164, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-01-30 14:40:11,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:40:11,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:40:11,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:40:11,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:40:11,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,926 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-01-30 14:40:11,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:40:11,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:40:11,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:40:11,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:40:11,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (1/1) ... [2024-01-30 14:40:11,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:40:11,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:40:12,002 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-30 14:40:12,013 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-30 14:40:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:40:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:40:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:40:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:40:12,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:40:12,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:40:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-30 14:40:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:40:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:40:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-30 14:40:12,044 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-30 14:40:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:40:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:40:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:40:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:40:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-30 14:40:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:40:12,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:40:12,047 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:40:12,159 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:40:12,161 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:40:12,340 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:40:12,340 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:40:12,407 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:40:12,407 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-30 14:40:12,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:40:12 BoogieIcfgContainer [2024-01-30 14:40:12,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:40:12,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:40:12,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:40:12,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:40:12,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:40:10" (1/4) ... [2024-01-30 14:40:12,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c6701c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:40:12, skipping insertion in model container [2024-01-30 14:40:12,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:40:11" (2/4) ... [2024-01-30 14:40:12,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c6701c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:40:12, skipping insertion in model container [2024-01-30 14:40:12,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:40:11" (3/4) ... [2024-01-30 14:40:12,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c6701c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:40:12, skipping insertion in model container [2024-01-30 14:40:12,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:40:12" (4/4) ... [2024-01-30 14:40:12,414 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_18-first-reads_unknown_2_neg.i [2024-01-30 14:40:12,427 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:40:12,427 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-01-30 14:40:12,427 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:40:12,497 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-30 14:40:12,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 44 transitions, 95 flow [2024-01-30 14:40:12,560 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-01-30 14:40:12,560 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-30 14:40:12,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 43 events. 2/43 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-01-30 14:40:12,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 44 transitions, 95 flow [2024-01-30 14:40:12,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 41 transitions, 85 flow [2024-01-30 14:40:12,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:40:12,585 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;@32b5c470, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:40:12,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-01-30 14:40:12,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:40:12,590 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:40:12,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:40:12,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:40:12,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:40:12,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-01-30 14:40:12,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:40:12,596 INFO L85 PathProgramCache]: Analyzing trace with hash 6990, now seen corresponding path program 1 times [2024-01-30 14:40:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:40:12,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398395223] [2024-01-30 14:40:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:40:12,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:40:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:40:12,850 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-30 14:40:12,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:40:12,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398395223] [2024-01-30 14:40:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398395223] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:40:12,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:40:12,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:40:12,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780145925] [2024-01-30 14:40:12,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:40:12,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:40:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:40:12,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:40:12,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:40:12,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 44 [2024-01-30 14:40:12,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-30 14:40:12,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:40:12,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 44 [2024-01-30 14:40:12,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:40:13,026 INFO L124 PetriNetUnfolderBase]: 81/281 cut-off events. [2024-01-30 14:40:13,026 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:40:13,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 281 events. 81/281 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1413 event pairs, 53 based on Foata normal form. 13/271 useless extension candidates. Maximal degree in co-relation 459. Up to 137 conditions per place. [2024-01-30 14:40:13,031 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 25 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-01-30 14:40:13,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 157 flow [2024-01-30 14:40:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:40:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:40:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-01-30 14:40:13,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2024-01-30 14:40:13,044 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 85 flow. Second operand 3 states and 93 transitions. [2024-01-30 14:40:13,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 157 flow [2024-01-30 14:40:13,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:40:13,050 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 106 flow [2024-01-30 14:40:13,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2024-01-30 14:40:13,055 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-01-30 14:40:13,055 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 106 flow [2024-01-30 14:40:13,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-30 14:40:13,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:40:13,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-30 14:40:13,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:40:13,056 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-01-30 14:40:13,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:40:13,057 INFO L85 PathProgramCache]: Analyzing trace with hash 208492308, now seen corresponding path program 1 times [2024-01-30 14:40:13,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:40:13,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155976634] [2024-01-30 14:40:13,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:40:13,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:40:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:40:13,212 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-30 14:40:13,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:40:13,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155976634] [2024-01-30 14:40:13,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155976634] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:40:13,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:40:13,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:40:13,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353746727] [2024-01-30 14:40:13,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:40:13,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:40:13,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:40:13,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:40:13,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:40:13,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 44 [2024-01-30 14:40:13,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-30 14:40:13,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:40:13,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 44 [2024-01-30 14:40:13,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:40:13,325 INFO L124 PetriNetUnfolderBase]: 64/259 cut-off events. [2024-01-30 14:40:13,325 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-30 14:40:13,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 259 events. 64/259 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1295 event pairs, 25 based on Foata normal form. 5/234 useless extension candidates. Maximal degree in co-relation 434. Up to 136 conditions per place. [2024-01-30 14:40:13,327 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 20 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2024-01-30 14:40:13,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 154 flow [2024-01-30 14:40:13,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:40:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:40:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-01-30 14:40:13,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6306818181818182 [2024-01-30 14:40:13,329 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 106 flow. Second operand 4 states and 111 transitions. [2024-01-30 14:40:13,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 154 flow [2024-01-30 14:40:13,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:40:13,330 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 98 flow [2024-01-30 14:40:13,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-01-30 14:40:13,331 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-01-30 14:40:13,331 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 98 flow [2024-01-30 14:40:13,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-30 14:40:13,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:40:13,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:40:13,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:40:13,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-01-30 14:40:13,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:40:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash -647019945, now seen corresponding path program 1 times [2024-01-30 14:40:13,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:40:13,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799025830] [2024-01-30 14:40:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:40:13,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:40:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:40:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:40:13,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:40:13,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799025830] [2024-01-30 14:40:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799025830] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:40:13,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:40:13,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:40:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340168758] [2024-01-30 14:40:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:40:13,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:40:13,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:40:13,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:40:13,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:40:13,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-01-30 14:40:13,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-30 14:40:13,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:40:13,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-01-30 14:40:13,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:40:13,503 INFO L124 PetriNetUnfolderBase]: 105/346 cut-off events. [2024-01-30 14:40:13,504 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-30 14:40:13,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 346 events. 105/346 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1798 event pairs, 9 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 630. Up to 140 conditions per place. [2024-01-30 14:40:13,506 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 34 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2024-01-30 14:40:13,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 218 flow [2024-01-30 14:40:13,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:40:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:40:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-01-30 14:40:13,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-01-30 14:40:13,508 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 98 flow. Second operand 4 states and 100 transitions. [2024-01-30 14:40:13,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 218 flow [2024-01-30 14:40:13,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:40:13,511 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 137 flow [2024-01-30 14:40:13,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-01-30 14:40:13,512 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-01-30 14:40:13,512 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 137 flow [2024-01-30 14:40:13,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-30 14:40:13,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:40:13,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:40:13,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:40:13,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-01-30 14:40:13,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:40:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash 984098266, now seen corresponding path program 1 times [2024-01-30 14:40:13,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:40:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558183962] [2024-01-30 14:40:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:40:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:40:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:40:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:40:13,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:40:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558183962] [2024-01-30 14:40:13,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558183962] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:40:13,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:40:13,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:40:13,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104991050] [2024-01-30 14:40:13,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:40:13,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:40:13,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:40:13,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:40:13,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:40:13,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-01-30 14:40:13,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-30 14:40:13,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:40:13,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-01-30 14:40:13,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:40:13,792 INFO L124 PetriNetUnfolderBase]: 115/350 cut-off events. [2024-01-30 14:40:13,792 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-01-30 14:40:13,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 350 events. 115/350 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1759 event pairs, 9 based on Foata normal form. 6/338 useless extension candidates. Maximal degree in co-relation 754. Up to 151 conditions per place. [2024-01-30 14:40:13,794 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 40 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2024-01-30 14:40:13,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 281 flow [2024-01-30 14:40:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:40:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:40:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-01-30 14:40:13,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-01-30 14:40:13,799 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 137 flow. Second operand 5 states and 105 transitions. [2024-01-30 14:40:13,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 281 flow [2024-01-30 14:40:13,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:40:13,805 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 143 flow [2024-01-30 14:40:13,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-01-30 14:40:13,805 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-01-30 14:40:13,806 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 143 flow [2024-01-30 14:40:13,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-30 14:40:13,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:40:13,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:40:13,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:40:13,806 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-01-30 14:40:13,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:40:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash 442276438, now seen corresponding path program 1 times [2024-01-30 14:40:13,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:40:13,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599943657] [2024-01-30 14:40:13,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:40:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:40:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:40:13,901 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-30 14:40:13,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:40:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599943657] [2024-01-30 14:40:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599943657] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:40:13,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:40:13,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:40:13,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969610462] [2024-01-30 14:40:13,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:40:13,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:40:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:40:13,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:40:13,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:40:13,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-01-30 14:40:13,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-30 14:40:13,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:40:13,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-01-30 14:40:13,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:40:14,039 INFO L124 PetriNetUnfolderBase]: 156/435 cut-off events. [2024-01-30 14:40:14,044 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-01-30 14:40:14,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 435 events. 156/435 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2230 event pairs, 11 based on Foata normal form. 12/418 useless extension candidates. Maximal degree in co-relation 971. Up to 148 conditions per place. [2024-01-30 14:40:14,048 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 46 selfloop transitions, 9 changer transitions 5/67 dead transitions. [2024-01-30 14:40:14,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 331 flow [2024-01-30 14:40:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:40:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:40:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-01-30 14:40:14,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954545454545455 [2024-01-30 14:40:14,049 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 143 flow. Second operand 5 states and 109 transitions. [2024-01-30 14:40:14,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 331 flow [2024-01-30 14:40:14,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 313 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-30 14:40:14,052 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 165 flow [2024-01-30 14:40:14,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-01-30 14:40:14,053 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2024-01-30 14:40:14,053 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 165 flow [2024-01-30 14:40:14,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-30 14:40:14,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:40:14,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:40:14,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:40:14,054 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-01-30 14:40:14,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:40:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash 442275413, now seen corresponding path program 1 times [2024-01-30 14:40:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:40:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876614410] [2024-01-30 14:40:14,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:40:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:40:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:40:14,096 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-30 14:40:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:40:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876614410] [2024-01-30 14:40:14,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876614410] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:40:14,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:40:14,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:40:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941943289] [2024-01-30 14:40:14,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:40:14,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:40:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:40:14,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:40:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:40:14,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-01-30 14:40:14,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-30 14:40:14,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:40:14,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-01-30 14:40:14,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:40:14,184 INFO L124 PetriNetUnfolderBase]: 96/324 cut-off events. [2024-01-30 14:40:14,184 INFO L125 PetriNetUnfolderBase]: For 185/187 co-relation queries the response was YES. [2024-01-30 14:40:14,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 324 events. 96/324 cut-off events. For 185/187 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1568 event pairs, 5 based on Foata normal form. 10/315 useless extension candidates. Maximal degree in co-relation 700. Up to 169 conditions per place. [2024-01-30 14:40:14,186 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 29 selfloop transitions, 3 changer transitions 2/47 dead transitions. [2024-01-30 14:40:14,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 221 flow [2024-01-30 14:40:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:40:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:40:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-01-30 14:40:14,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-01-30 14:40:14,187 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 165 flow. Second operand 4 states and 104 transitions. [2024-01-30 14:40:14,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 221 flow [2024-01-30 14:40:14,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 199 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-01-30 14:40:14,189 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 109 flow [2024-01-30 14:40:14,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-01-30 14:40:14,190 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-01-30 14:40:14,190 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 109 flow [2024-01-30 14:40:14,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-30 14:40:14,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:40:14,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:40:14,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:40:14,190 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-01-30 14:40:14,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:40:14,191 INFO L85 PathProgramCache]: Analyzing trace with hash 825636156, now seen corresponding path program 1 times [2024-01-30 14:40:14,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:40:14,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494123600] [2024-01-30 14:40:14,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:40:14,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:40:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:40:14,256 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-30 14:40:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:40:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494123600] [2024-01-30 14:40:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494123600] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:40:14,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:40:14,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:40:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449749057] [2024-01-30 14:40:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:40:14,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:40:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:40:14,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:40:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:40:14,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-01-30 14:40:14,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-30 14:40:14,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:40:14,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-01-30 14:40:14,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:40:14,357 INFO L124 PetriNetUnfolderBase]: 86/272 cut-off events. [2024-01-30 14:40:14,357 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-01-30 14:40:14,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 272 events. 86/272 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1166 event pairs, 5 based on Foata normal form. 12/271 useless extension candidates. Maximal degree in co-relation 578. Up to 148 conditions per place. [2024-01-30 14:40:14,359 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 34 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2024-01-30 14:40:14,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 211 flow [2024-01-30 14:40:14,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:40:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:40:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-01-30 14:40:14,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2024-01-30 14:40:14,360 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 109 flow. Second operand 5 states and 106 transitions. [2024-01-30 14:40:14,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 211 flow [2024-01-30 14:40:14,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 202 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-30 14:40:14,361 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 100 flow [2024-01-30 14:40:14,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-01-30 14:40:14,362 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-01-30 14:40:14,362 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 100 flow [2024-01-30 14:40:14,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-30 14:40:14,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:40:14,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:40:14,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:40:14,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-01-30 14:40:14,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:40:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash -174097639, now seen corresponding path program 1 times [2024-01-30 14:40:14,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:40:14,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491270097] [2024-01-30 14:40:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:40:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:40:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:40:14,407 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-30 14:40:14,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:40:14,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491270097] [2024-01-30 14:40:14,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491270097] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:40:14,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:40:14,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:40:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213720648] [2024-01-30 14:40:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:40:14,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:40:14,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:40:14,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:40:14,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:40:14,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-01-30 14:40:14,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-30 14:40:14,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:40:14,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-01-30 14:40:14,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:40:14,509 INFO L124 PetriNetUnfolderBase]: 89/251 cut-off events. [2024-01-30 14:40:14,509 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-01-30 14:40:14,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 251 events. 89/251 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1032 event pairs, 44 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 563. Up to 100 conditions per place. [2024-01-30 14:40:14,510 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 27 selfloop transitions, 5 changer transitions 15/55 dead transitions. [2024-01-30 14:40:14,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 242 flow [2024-01-30 14:40:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-30 14:40:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-30 14:40:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-01-30 14:40:14,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-01-30 14:40:14,512 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 100 flow. Second operand 6 states and 149 transitions. [2024-01-30 14:40:14,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 242 flow [2024-01-30 14:40:14,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 230 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-30 14:40:14,513 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 96 flow [2024-01-30 14:40:14,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2024-01-30 14:40:14,514 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2024-01-30 14:40:14,514 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 96 flow [2024-01-30 14:40:14,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-30 14:40:14,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:40:14,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:40:14,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:40:14,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-01-30 14:40:14,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:40:14,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1635145435, now seen corresponding path program 1 times [2024-01-30 14:40:14,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:40:14,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100444585] [2024-01-30 14:40:14,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:40:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:40:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:40:14,550 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-30 14:40:14,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:40:14,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100444585] [2024-01-30 14:40:14,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100444585] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:40:14,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:40:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:40:14,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001606527] [2024-01-30 14:40:14,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:40:14,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:40:14,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:40:14,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:40:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:40:14,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 44 [2024-01-30 14:40:14,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-30 14:40:14,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:40:14,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 44 [2024-01-30 14:40:14,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:40:14,575 INFO L124 PetriNetUnfolderBase]: 23/113 cut-off events. [2024-01-30 14:40:14,576 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-01-30 14:40:14,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 113 events. 23/113 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs, 9 based on Foata normal form. 7/113 useless extension candidates. Maximal degree in co-relation 230. Up to 42 conditions per place. [2024-01-30 14:40:14,576 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 14 selfloop transitions, 4 changer transitions 2/34 dead transitions. [2024-01-30 14:40:14,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 141 flow [2024-01-30 14:40:14,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:40:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:40:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-01-30 14:40:14,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-01-30 14:40:14,577 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 96 flow. Second operand 3 states and 97 transitions. [2024-01-30 14:40:14,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 141 flow [2024-01-30 14:40:14,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 111 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-01-30 14:40:14,578 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 69 flow [2024-01-30 14:40:14,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-01-30 14:40:14,579 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2024-01-30 14:40:14,579 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 69 flow [2024-01-30 14:40:14,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-30 14:40:14,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:40:14,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:40:14,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-30 14:40:14,580 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 20 more)] === [2024-01-30 14:40:14,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:40:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1132596097, now seen corresponding path program 1 times [2024-01-30 14:40:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:40:14,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464369766] [2024-01-30 14:40:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:40:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:40:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:40:14,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:40:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:40:14,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:40:14,606 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:40:14,607 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6ASSERT_VIOLATIONERROR_FUNCTION (22 of 23 remaining) [2024-01-30 14:40:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 23 remaining) [2024-01-30 14:40:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 23 remaining) [2024-01-30 14:40:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 23 remaining) [2024-01-30 14:40:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 23 remaining) [2024-01-30 14:40:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 23 remaining) [2024-01-30 14:40:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 23 remaining) [2024-01-30 14:40:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 23 remaining) [2024-01-30 14:40:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 23 remaining) [2024-01-30 14:40:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 23 remaining) [2024-01-30 14:40:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONERROR_FUNCTION (12 of 23 remaining) [2024-01-30 14:40:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 23 remaining) [2024-01-30 14:40:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 23 remaining) [2024-01-30 14:40:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 23 remaining) [2024-01-30 14:40:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 23 remaining) [2024-01-30 14:40:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 23 remaining) [2024-01-30 14:40:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 23 remaining) [2024-01-30 14:40:14,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 23 remaining) [2024-01-30 14:40:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 23 remaining) [2024-01-30 14:40:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 23 remaining) [2024-01-30 14:40:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 23 remaining) [2024-01-30 14:40:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 23 remaining) [2024-01-30 14:40:14,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 23 remaining) [2024-01-30 14:40:14,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-30 14:40:14,611 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:40:14,616 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:40:14,616 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:40:14,631 INFO L503 ceAbstractionStarter]: Automizer considered 11 witness invariants [2024-01-30 14:40:14,632 INFO L504 ceAbstractionStarter]: WitnessConsidered=11 [2024-01-30 14:40:14,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:40:14 BasicIcfg [2024-01-30 14:40:14,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:40:14,633 INFO L158 Benchmark]: Toolchain (without parser) took 3310.15ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 69.3MB in the beginning and 126.3MB in the end (delta: -56.9MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-01-30 14:40:14,633 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:40:14,633 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:40:14,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.54ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 69.2MB in the beginning and 194.7MB in the end (delta: -125.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-01-30 14:40:14,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.10ms. Allocated memory is still 232.8MB. Free memory was 194.7MB in the beginning and 192.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:40:14,634 INFO L158 Benchmark]: Boogie Preprocessor took 35.18ms. Allocated memory is still 232.8MB. Free memory was 192.6MB in the beginning and 190.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:40:14,634 INFO L158 Benchmark]: RCFGBuilder took 468.42ms. Allocated memory is still 232.8MB. Free memory was 190.5MB in the beginning and 164.3MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-30 14:40:14,634 INFO L158 Benchmark]: TraceAbstraction took 2223.42ms. Allocated memory is still 232.8MB. Free memory was 163.2MB in the beginning and 126.3MB in the end (delta: 36.9MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2024-01-30 14:40:14,635 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.54ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 69.2MB in the beginning and 194.7MB in the end (delta: -125.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.10ms. Allocated memory is still 232.8MB. Free memory was 194.7MB in the beginning and 192.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.18ms. Allocated memory is still 232.8MB. Free memory was 192.6MB in the beginning and 190.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.42ms. Allocated memory is still 232.8MB. Free memory was 190.5MB in the beginning and 164.3MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2223.42ms. Allocated memory is still 232.8MB. Free memory was 163.2MB in the beginning and 126.3MB in the end (delta: 36.9MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int glob1 = 0; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L697] 0 pthread_t id; VAL [glob1=0, id={5:0}, mutex1={3:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] [L698] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [glob1=0, id={5:0}, mutex1={3:0}] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L685] 1 int t = __VERIFIER_nondet_int(); [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L687] COND TRUE 1 t == 42 VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[42]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L688] 1 glob1 = 1 VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]]] [L690] 1 t = glob1 VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]],BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[1]]]]]] [L691] CALL 1 __VERIFIER_assert(!(t == 1)) [L19] COND TRUE 1 !(cond) VAL [\old(cond)=0, cond=0, glob1=1, mutex1={3:0}] [L19] 1 reach_error() VAL [\old(cond)=0, cond=0, glob1=1, mutex1={3:0}] - 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: 700]: 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 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: 685]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 73 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 748 IncrementalHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 41 mSDtfsCounter, 748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-30 14:40:14,672 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