./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_true.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_19-publish-precision_true.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_19-publish-precision_true.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_19-publish-precision_true.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:21:24,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:21:24,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:21:25,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:21:25,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:21:25,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:21:25,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:21:25,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:21:25,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:21:25,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:21:25,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:21:25,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:21:25,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:21:25,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:21:25,034 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:21:25,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:21:25,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:21:25,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:21:25,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:21:25,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:21:25,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:21:25,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:21:25,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:21:25,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:21:25,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:21:25,036 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:21:25,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:21:25,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:21:25,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:21:25,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:21:25,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:21:25,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:21:25,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:21:25,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:21:25,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:21:25,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:21:25,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:21:25,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:21:25,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:21:25,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:21:25,040 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:21:25,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:21:25,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:21:25,041 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:21:25,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:21:25,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:21:25,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:21:25,244 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:21:25,244 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:21:25,245 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_19-publish-precision_true.yml/witness.yml [2024-01-30 14:21:25,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:21:25,332 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:21:25,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_true.i [2024-01-30 14:21:26,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:21:26,812 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:21:26,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_true.i [2024-01-30 14:21:26,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57367a3c7/e99c753fd65543c7b9d9a6421da7cd88/FLAG4936d36e0 [2024-01-30 14:21:26,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57367a3c7/e99c753fd65543c7b9d9a6421da7cd88 [2024-01-30 14:21:26,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:21:26,852 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:21:26,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:21:26,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:21:26,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:21:26,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:21:25" (1/2) ... [2024-01-30 14:21:26,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6114c90a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:21:26, skipping insertion in model container [2024-01-30 14:21:26,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:21:25" (1/2) ... [2024-01-30 14:21:26,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6f2ab31b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:21:26, skipping insertion in model container [2024-01-30 14:21:26,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:21:26" (2/2) ... [2024-01-30 14:21:26,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6114c90a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:26, skipping insertion in model container [2024-01-30 14:21:26,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:21:26" (2/2) ... [2024-01-30 14:21:26,860 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:21:26,892 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:21:26,893 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (unsigned long )arg == 0UL [2024-01-30 14:21:26,894 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-01-30 14:21:26,894 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (glob1 == 5) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:26,894 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (glob1 == 0 || glob1 == 5) && (glob1 == 0 || glob1 == 5) [2024-01-30 14:21:26,895 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:26,895 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:26,895 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] glob1 == 0 [2024-01-30 14:21:26,895 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] (glob1 == 5) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:26,895 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:26,896 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (glob1 == 5) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:26,896 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] glob1 == 0 [2024-01-30 14:21:26,896 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:26,896 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] glob1 == 0 [2024-01-30 14:21:26,896 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (glob1 == 5) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:26,931 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:21:27,096 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_19-publish-precision_true.i[1094,1107] [2024-01-30 14:21:27,212 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:21:27,221 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:21:27,230 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_19-publish-precision_true.i[1094,1107] [2024-01-30 14:21:27,230 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 Start Parsing Local Start Parsing Local [2024-01-30 14:21:27,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:21:27,317 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:21:27,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27 WrapperNode [2024-01-30 14:21:27,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:21:27,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:21:27,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:21:27,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:21:27,324 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:21:27" (1/1) ... [2024-01-30 14:21:27,332 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:21:27" (1/1) ... [2024-01-30 14:21:27,355 INFO L138 Inliner]: procedures = 163, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2024-01-30 14:21:27,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:21:27,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:21:27,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:21:27,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:21:27,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27" (1/1) ... [2024-01-30 14:21:27,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27" (1/1) ... [2024-01-30 14:21:27,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27" (1/1) ... [2024-01-30 14:21:27,398 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2024-01-30 14:21:27,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27" (1/1) ... [2024-01-30 14:21:27,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27" (1/1) ... [2024-01-30 14:21:27,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27" (1/1) ... [2024-01-30 14:21:27,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27" (1/1) ... [2024-01-30 14:21:27,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27" (1/1) ... [2024-01-30 14:21:27,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27" (1/1) ... [2024-01-30 14:21:27,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:21:27,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:21:27,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:21:27,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:21:27,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27" (1/1) ... [2024-01-30 14:21:27,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:21:27,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:21:27,468 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:21:27,512 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:21:27,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:21:27,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:21:27,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:21:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:21:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:21:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:21:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:21:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:21:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-30 14:21:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:21:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:21:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-30 14:21:27,539 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-30 14:21:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:21:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:21:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:21:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:21:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:21:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-30 14:21:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:21:27,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:21:27,542 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:21:27,657 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:21:27,660 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:21:27,871 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:21:27,871 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:21:27,941 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:21:27,941 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-30 14:21:27,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:21:27 BoogieIcfgContainer [2024-01-30 14:21:27,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:21:27,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:21:27,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:21:27,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:21:27,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:21:25" (1/4) ... [2024-01-30 14:21:27,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f9a527 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:21:27, skipping insertion in model container [2024-01-30 14:21:27,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:21:26" (2/4) ... [2024-01-30 14:21:27,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f9a527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:21:27, skipping insertion in model container [2024-01-30 14:21:27,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:27" (3/4) ... [2024-01-30 14:21:27,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f9a527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:21:27, skipping insertion in model container [2024-01-30 14:21:27,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:21:27" (4/4) ... [2024-01-30 14:21:27,948 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_19-publish-precision_true.i [2024-01-30 14:21:27,964 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:21:27,964 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-01-30 14:21:27,964 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:21:28,019 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-30 14:21:28,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 59 transitions, 125 flow [2024-01-30 14:21:28,078 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2024-01-30 14:21:28,078 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-30 14:21:28,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 58 events. 2/58 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-01-30 14:21:28,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 59 transitions, 125 flow [2024-01-30 14:21:28,083 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 56 transitions, 115 flow [2024-01-30 14:21:28,090 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:21:28,095 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;@73ace581, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:21:28,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-01-30 14:21:28,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:21:28,098 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:21:28,098 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:21:28,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:28,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:21:28,099 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 24 more)] === [2024-01-30 14:21:28,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash 8333, now seen corresponding path program 1 times [2024-01-30 14:21:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916297112] [2024-01-30 14:21:28,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:28,266 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:21:28,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:28,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916297112] [2024-01-30 14:21:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916297112] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:28,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:21:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536427398] [2024-01-30 14:21:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:28,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:21:28,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:28,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:21:28,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:21:28,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-01-30 14:21:28,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:21:28,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:28,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-01-30 14:21:28,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:28,399 INFO L124 PetriNetUnfolderBase]: 88/346 cut-off events. [2024-01-30 14:21:28,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:21:28,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 346 events. 88/346 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1594 event pairs, 51 based on Foata normal form. 23/350 useless extension candidates. Maximal degree in co-relation 561. Up to 145 conditions per place. [2024-01-30 14:21:28,403 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 31 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-01-30 14:21:28,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 193 flow [2024-01-30 14:21:28,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:21:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:21:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-01-30 14:21:28,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6949152542372882 [2024-01-30 14:21:28,414 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 115 flow. Second operand 3 states and 123 transitions. [2024-01-30 14:21:28,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 193 flow [2024-01-30 14:21:28,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:21:28,418 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 134 flow [2024-01-30 14:21:28,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2024-01-30 14:21:28,422 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2024-01-30 14:21:28,422 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 134 flow [2024-01-30 14:21:28,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:21:28,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:28,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:21:28,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:21:28,423 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 24 more)] === [2024-01-30 14:21:28,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:28,424 INFO L85 PathProgramCache]: Analyzing trace with hash 8015998, now seen corresponding path program 1 times [2024-01-30 14:21:28,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:28,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055226991] [2024-01-30 14:21:28,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:28,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:28,545 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:21:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055226991] [2024-01-30 14:21:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055226991] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:28,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:28,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:21:28,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399768856] [2024-01-30 14:21:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:28,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:28,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:28,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:28,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:28,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2024-01-30 14:21:28,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:21:28,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:28,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2024-01-30 14:21:28,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:28,682 INFO L124 PetriNetUnfolderBase]: 88/344 cut-off events. [2024-01-30 14:21:28,683 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-01-30 14:21:28,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 344 events. 88/344 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1599 event pairs, 51 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 639. Up to 144 conditions per place. [2024-01-30 14:21:28,685 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 30 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2024-01-30 14:21:28,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 216 flow [2024-01-30 14:21:28,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-01-30 14:21:28,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5635593220338984 [2024-01-30 14:21:28,686 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 134 flow. Second operand 4 states and 133 transitions. [2024-01-30 14:21:28,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 216 flow [2024-01-30 14:21:28,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:21:28,689 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 134 flow [2024-01-30 14:21:28,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-01-30 14:21:28,689 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2024-01-30 14:21:28,689 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 134 flow [2024-01-30 14:21:28,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:21:28,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:28,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:28,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:21:28,690 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 24 more)] === [2024-01-30 14:21:28,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:28,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1529388601, now seen corresponding path program 1 times [2024-01-30 14:21:28,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:28,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239275707] [2024-01-30 14:21:28,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:28,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:28,781 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:21:28,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239275707] [2024-01-30 14:21:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239275707] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:28,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:28,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:21:28,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950673001] [2024-01-30 14:21:28,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:28,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:28,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:28,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:28,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:28,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 59 [2024-01-30 14:21:28,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:28,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:28,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 59 [2024-01-30 14:21:28,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:28,905 INFO L124 PetriNetUnfolderBase]: 58/304 cut-off events. [2024-01-30 14:21:28,905 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-01-30 14:21:28,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 304 events. 58/304 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1448 event pairs, 10 based on Foata normal form. 5/280 useless extension candidates. Maximal degree in co-relation 502. Up to 139 conditions per place. [2024-01-30 14:21:28,909 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 23 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-01-30 14:21:28,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 188 flow [2024-01-30 14:21:28,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2024-01-30 14:21:28,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6567796610169492 [2024-01-30 14:21:28,914 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 134 flow. Second operand 4 states and 155 transitions. [2024-01-30 14:21:28,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 188 flow [2024-01-30 14:21:28,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-30 14:21:28,917 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 122 flow [2024-01-30 14:21:28,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-01-30 14:21:28,918 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2024-01-30 14:21:28,919 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 122 flow [2024-01-30 14:21:28,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:28,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:28,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:28,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:21:28,919 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 24 more)] === [2024-01-30 14:21:28,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1002449412, now seen corresponding path program 1 times [2024-01-30 14:21:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:28,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520979177] [2024-01-30 14:21:28,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:28,972 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:21:28,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520979177] [2024-01-30 14:21:28,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520979177] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:28,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:28,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:21:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289970962] [2024-01-30 14:21:28,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:28,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:28,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:28,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:29,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-01-30 14:21:29,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:21:29,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:29,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-01-30 14:21:29,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:29,074 INFO L124 PetriNetUnfolderBase]: 98/339 cut-off events. [2024-01-30 14:21:29,075 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-01-30 14:21:29,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 339 events. 98/339 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1451 event pairs, 11 based on Foata normal form. 6/331 useless extension candidates. Maximal degree in co-relation 644. Up to 116 conditions per place. [2024-01-30 14:21:29,078 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 37 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-01-30 14:21:29,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 224 flow [2024-01-30 14:21:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2024-01-30 14:21:29,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-01-30 14:21:29,080 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 122 flow. Second operand 4 states and 118 transitions. [2024-01-30 14:21:29,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 224 flow [2024-01-30 14:21:29,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:21:29,082 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 121 flow [2024-01-30 14:21:29,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-01-30 14:21:29,084 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2024-01-30 14:21:29,084 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 121 flow [2024-01-30 14:21:29,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:21:29,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:29,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:29,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:21:29,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 24 more)] === [2024-01-30 14:21:29,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1421221215, now seen corresponding path program 1 times [2024-01-30 14:21:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:29,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139230255] [2024-01-30 14:21:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:29,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:29,152 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:21:29,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:29,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139230255] [2024-01-30 14:21:29,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139230255] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:29,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:29,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:21:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542417203] [2024-01-30 14:21:29,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:29,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:29,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:29,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-01-30 14:21:29,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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:21:29,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:29,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-01-30 14:21:29,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:29,274 INFO L124 PetriNetUnfolderBase]: 86/273 cut-off events. [2024-01-30 14:21:29,274 INFO L125 PetriNetUnfolderBase]: For 69/70 co-relation queries the response was YES. [2024-01-30 14:21:29,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 273 events. 86/273 cut-off events. For 69/70 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 956 event pairs, 8 based on Foata normal form. 31/295 useless extension candidates. Maximal degree in co-relation 547. Up to 116 conditions per place. [2024-01-30 14:21:29,276 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 34 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2024-01-30 14:21:29,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 201 flow [2024-01-30 14:21:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-01-30 14:21:29,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5338983050847458 [2024-01-30 14:21:29,277 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 121 flow. Second operand 4 states and 126 transitions. [2024-01-30 14:21:29,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 201 flow [2024-01-30 14:21:29,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 193 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-30 14:21:29,279 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 105 flow [2024-01-30 14:21:29,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-01-30 14:21:29,281 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2024-01-30 14:21:29,282 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 105 flow [2024-01-30 14:21:29,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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:21:29,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:29,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:29,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:21:29,282 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 24 more)] === [2024-01-30 14:21:29,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1840716630, now seen corresponding path program 1 times [2024-01-30 14:21:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:29,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700849996] [2024-01-30 14:21:29,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:29,455 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:21:29,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:29,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700849996] [2024-01-30 14:21:29,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700849996] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:29,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:29,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:21:29,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831116532] [2024-01-30 14:21:29,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:29,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:21:29,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:29,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:21:29,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:21:29,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 59 [2024-01-30 14:21:29,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:29,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:29,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 59 [2024-01-30 14:21:29,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:29,495 INFO L124 PetriNetUnfolderBase]: 30/143 cut-off events. [2024-01-30 14:21:29,495 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-30 14:21:29,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 143 events. 30/143 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs, 15 based on Foata normal form. 9/142 useless extension candidates. Maximal degree in co-relation 256. Up to 45 conditions per place. [2024-01-30 14:21:29,495 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 12 selfloop transitions, 6 changer transitions 11/45 dead transitions. [2024-01-30 14:21:29,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 165 flow [2024-01-30 14:21:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-01-30 14:21:29,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.711864406779661 [2024-01-30 14:21:29,497 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 105 flow. Second operand 4 states and 168 transitions. [2024-01-30 14:21:29,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 165 flow [2024-01-30 14:21:29,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 155 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-30 14:21:29,499 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 87 flow [2024-01-30 14:21:29,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2024-01-30 14:21:29,501 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2024-01-30 14:21:29,501 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 87 flow [2024-01-30 14:21:29,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:29,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:29,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:29,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:21:29,501 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 24 more)] === [2024-01-30 14:21:29,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1554068141, now seen corresponding path program 1 times [2024-01-30 14:21:29,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:29,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022938818] [2024-01-30 14:21:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:29,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:21:29,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:21:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:21:29,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:21:29,561 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:21:29,562 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 27 remaining) [2024-01-30 14:21:29,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 27 remaining) [2024-01-30 14:21:29,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (24 of 27 remaining) [2024-01-30 14:21:29,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 27 remaining) [2024-01-30 14:21:29,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 27 remaining) [2024-01-30 14:21:29,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 27 remaining) [2024-01-30 14:21:29,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 27 remaining) [2024-01-30 14:21:29,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 27 remaining) [2024-01-30 14:21:29,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 27 remaining) [2024-01-30 14:21:29,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 27 remaining) [2024-01-30 14:21:29,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 27 remaining) [2024-01-30 14:21:29,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONERROR_FUNCTION (15 of 27 remaining) [2024-01-30 14:21:29,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 27 remaining) [2024-01-30 14:21:29,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 27 remaining) [2024-01-30 14:21:29,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 27 remaining) [2024-01-30 14:21:29,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 27 remaining) [2024-01-30 14:21:29,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 27 remaining) [2024-01-30 14:21:29,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 27 remaining) [2024-01-30 14:21:29,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 27 remaining) [2024-01-30 14:21:29,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 27 remaining) [2024-01-30 14:21:29,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 27 remaining) [2024-01-30 14:21:29,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 27 remaining) [2024-01-30 14:21:29,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 27 remaining) [2024-01-30 14:21:29,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 27 remaining) [2024-01-30 14:21:29,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 27 remaining) [2024-01-30 14:21:29,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 27 remaining) [2024-01-30 14:21:29,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 27 remaining) [2024-01-30 14:21:29,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:21:29,565 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:29,570 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:21:29,570 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:21:29,601 INFO L503 ceAbstractionStarter]: Automizer considered 13 witness invariants [2024-01-30 14:21:29,601 INFO L504 ceAbstractionStarter]: WitnessConsidered=13 [2024-01-30 14:21:29,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:21:29 BasicIcfg [2024-01-30 14:21:29,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:21:29,603 INFO L158 Benchmark]: Toolchain (without parser) took 2750.96ms. Allocated memory was 119.5MB in the beginning and 184.5MB in the end (delta: 65.0MB). Free memory was 61.1MB in the beginning and 95.4MB in the end (delta: -34.4MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2024-01-30 14:21:29,603 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:21:29,603 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:21:29,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.34ms. Allocated memory was 119.5MB in the beginning and 153.1MB in the end (delta: 33.6MB). Free memory was 60.7MB in the beginning and 112.6MB in the end (delta: -51.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-01-30 14:21:29,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.76ms. Allocated memory is still 153.1MB. Free memory was 111.7MB in the beginning and 109.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:21:29,604 INFO L158 Benchmark]: Boogie Preprocessor took 64.00ms. Allocated memory is still 153.1MB. Free memory was 109.6MB in the beginning and 107.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:21:29,604 INFO L158 Benchmark]: RCFGBuilder took 518.90ms. Allocated memory is still 153.1MB. Free memory was 107.5MB in the beginning and 79.4MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-30 14:21:29,606 INFO L158 Benchmark]: TraceAbstraction took 1659.82ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 79.0MB in the beginning and 95.4MB in the end (delta: -16.4MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-01-30 14:21:29,608 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.14ms. Allocated memory is still 119.5MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.34ms. Allocated memory was 119.5MB in the beginning and 153.1MB in the end (delta: 33.6MB). Free memory was 60.7MB in the beginning and 112.6MB in the end (delta: -51.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.76ms. Allocated memory is still 153.1MB. Free memory was 111.7MB in the beginning and 109.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.00ms. Allocated memory is still 153.1MB. Free memory was 109.6MB in the beginning and 107.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 518.90ms. Allocated memory is still 153.1MB. Free memory was 107.5MB in the beginning and 79.4MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1659.82ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 79.0MB in the beginning and 95.4MB in the end (delta: -16.4MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 701]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L681] 0 int glob1 = 0; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L697] 0 pthread_t id; VAL [glob1=0, id={5:0}, mutex1={3:0}, mutex2={4:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] [L698] CALL 0 __VERIFIER_assert(glob1 == 0) [L19] COND FALSE 0 !(!(cond)) VAL [\old(cond)=1, cond=1, glob1=0, mutex1={3:0}, mutex2={4:0}] [L698] RET 0 __VERIFIER_assert(glob1 == 0) [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] [L699] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [glob1=0, id={5:0}, mutex1={3:0}, mutex2={4:0}] [L685] 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}, mutex2={4:0}] [L686] 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}, mutex2={4:0}] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L687] 1 glob1 = 5 VAL [arg={0:0}, arg={0:0}, glob1=5, mutex1={3:0}, mutex2={4:0}] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[5]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=5, mutex1={3:0}, mutex2={4:0}] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] VAL [glob1=5, id={5:0}, mutex1={3:0}, mutex2={4: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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: 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: 689]: 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable 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, 97 locations, 27 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: 1.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 377 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 465 IncrementalHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 35 mSDtfsCounter, 465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=1, InterpolantAutomatonStates: 23, 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.4s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:21:29,639 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