./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 a340643f 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-a340643-m [2024-01-27 14:59:28,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 14:59:28,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 14:59:28,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 14:59:28,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 14:59:28,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 14:59:28,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 14:59:28,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 14:59:28,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 14:59:28,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 14:59:28,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 14:59:28,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 14:59:28,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 14:59:28,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 14:59:28,577 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 14:59:28,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 14:59:28,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 14:59:28,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 14:59:28,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 14:59:28,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 14:59:28,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 14:59:28,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 14:59:28,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 14:59:28,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 14:59:28,579 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 14:59:28,579 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 14:59:28,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 14:59:28,580 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 14:59:28,580 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 14:59:28,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 14:59:28,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 14:59:28,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 14:59:28,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:59:28,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 14:59:28,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 14:59:28,582 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 14:59:28,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 14:59:28,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 14:59:28,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 14:59:28,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 14:59:28,586 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 14:59:28,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 14:59:28,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 14:59:28,587 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-27 14:59:28,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 14:59:29,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 14:59:29,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 14:59:29,012 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 14:59:29,013 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 14:59:29,013 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-27 14:59:29,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 14:59:29,173 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 14:59:29,176 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-27 14:59:30,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 14:59:30,348 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 14:59:30,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i [2024-01-27 14:59:30,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db4e9d45/2a991521133541ba86b000037592ac00/FLAG4e5042a80 [2024-01-27 14:59:30,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db4e9d45/2a991521133541ba86b000037592ac00 [2024-01-27 14:59:30,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 14:59:30,372 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 14:59:30,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 14:59:30,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 14:59:30,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 14:59:30,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:59:29" (1/2) ... [2024-01-27 14:59:30,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5302aef8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:59:30, skipping insertion in model container [2024-01-27 14:59:30,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:59:29" (1/2) ... [2024-01-27 14:59:30,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@186d17df and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:59:30, skipping insertion in model container [2024-01-27 14:59:30,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:59:30" (2/2) ... [2024-01-27 14:59:30,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5302aef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30, skipping insertion in model container [2024-01-27 14:59:30,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:59:30" (2/2) ... [2024-01-27 14:59:30,381 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 14:59:30,422 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 14:59:30,423 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] glob1 == 0 [2024-01-27 14:59:30,423 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (unsigned long )arg == 0UL [2024-01-27 14:59:30,424 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] 0 <= t [2024-01-27 14:59:30,424 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] glob1 == 0 [2024-01-27 14:59:30,424 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] t <= 1 [2024-01-27 14:59:30,425 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] t == 0 || t == 1 [2024-01-27 14:59:30,425 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] glob1 == 0 || glob1 == 1 [2024-01-27 14:59:30,425 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (unsigned long )arg == 0UL [2024-01-27 14:59:30,425 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] glob1 <= 1 [2024-01-27 14:59:30,425 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] 0 <= glob1 [2024-01-27 14:59:30,425 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] glob1 == 0 [2024-01-27 14:59:30,425 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] t == 42 [2024-01-27 14:59:30,425 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] glob1 == 0 [2024-01-27 14:59:30,426 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (unsigned long )arg == 0UL [2024-01-27 14:59:30,426 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-27 14:59:30,426 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L689] glob1 == 0 [2024-01-27 14:59:30,426 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L689] (unsigned long )arg == 0UL [2024-01-27 14:59:30,426 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-01-27 14:59:30,426 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] glob1 == 0 || glob1 == 1 [2024-01-27 14:59:30,426 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] glob1 == 0 || glob1 == 1 [2024-01-27 14:59:30,427 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= glob1 [2024-01-27 14:59:30,427 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] glob1 == 0 || glob1 == 1 [2024-01-27 14:59:30,427 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= glob1 [2024-01-27 14:59:30,427 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] glob1 <= 1 [2024-01-27 14:59:30,427 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] glob1 <= 1 [2024-01-27 14:59:30,428 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= glob1 [2024-01-27 14:59:30,428 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] glob1 <= 1 [2024-01-27 14:59:30,428 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] 0 <= glob1 [2024-01-27 14:59:30,428 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (unsigned long )arg == 0UL [2024-01-27 14:59:30,428 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] glob1 <= 1 [2024-01-27 14:59:30,428 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] t == 0 || t == 1 [2024-01-27 14:59:30,428 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] 0 <= t [2024-01-27 14:59:30,429 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] t <= 1 [2024-01-27 14:59:30,429 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] glob1 == 0 || glob1 == 1 [2024-01-27 14:59:30,429 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] 0 <= t [2024-01-27 14:59:30,429 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] 0 <= glob1 [2024-01-27 14:59:30,429 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] glob1 <= 1 [2024-01-27 14:59:30,430 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] t <= 1 [2024-01-27 14:59:30,430 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (unsigned long )arg == 0UL [2024-01-27 14:59:30,431 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] t == 0 || t == 1 [2024-01-27 14:59:30,431 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] glob1 == 0 || glob1 == 1 [2024-01-27 14:59:30,431 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] t <= 1 [2024-01-27 14:59:30,431 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] 0 <= t [2024-01-27 14:59:30,431 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (unsigned long )arg == 0UL [2024-01-27 14:59:30,432 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] t == 0 || t == 1 [2024-01-27 14:59:30,467 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 14:59:30,604 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-27 14:59:30,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:59:30,734 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 14:59:30,743 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-27 14:59:30,744 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 14:59:30,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:59:30,840 INFO L206 MainTranslator]: Completed translation [2024-01-27 14:59:30,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30 WrapperNode [2024-01-27 14:59:30,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 14:59:30,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 14:59:30,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 14:59:30,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 14:59:30,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,881 INFO L138 Inliner]: procedures = 164, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2024-01-27 14:59:30,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 14:59:30,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 14:59:30,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 14:59:30,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 14:59:30,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,920 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-27 14:59:30,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 14:59:30,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 14:59:30,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 14:59:30,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 14:59:30,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (1/1) ... [2024-01-27 14:59:30,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:59:30,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:59:30,997 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-27 14:59:31,034 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-27 14:59:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 14:59:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 14:59:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 14:59:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 14:59:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 14:59:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 14:59:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 14:59:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 14:59:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 14:59:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-27 14:59:31,083 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-27 14:59:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 14:59:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 14:59:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 14:59:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 14:59:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 14:59:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 14:59:31,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 14:59:31,086 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 14:59:31,227 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 14:59:31,229 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 14:59:31,391 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 14:59:31,392 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 14:59:31,455 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 14:59:31,456 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 14:59:31,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:59:31 BoogieIcfgContainer [2024-01-27 14:59:31,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 14:59:31,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 14:59:31,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 14:59:31,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 14:59:31,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:59:29" (1/4) ... [2024-01-27 14:59:31,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f604fdb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:59:31, skipping insertion in model container [2024-01-27 14:59:31,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 02:59:30" (2/4) ... [2024-01-27 14:59:31,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f604fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:59:31, skipping insertion in model container [2024-01-27 14:59:31,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:30" (3/4) ... [2024-01-27 14:59:31,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f604fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:59:31, skipping insertion in model container [2024-01-27 14:59:31,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:59:31" (4/4) ... [2024-01-27 14:59:31,462 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_18-first-reads_unknown_2_neg.i [2024-01-27 14:59:31,473 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 14:59:31,474 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-01-27 14:59:31,474 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 14:59:31,533 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-27 14:59:31,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 94 transitions, 195 flow [2024-01-27 14:59:31,582 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2024-01-27 14:59:31,582 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 14:59:31,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 93 events. 2/93 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2024-01-27 14:59:31,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 94 transitions, 195 flow [2024-01-27 14:59:31,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 91 transitions, 185 flow [2024-01-27 14:59:31,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 14:59:31,597 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;@3059e3d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 14:59:31,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2024-01-27 14:59:31,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 14:59:31,599 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 14:59:31,599 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:59:31,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:31,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 14:59:31,600 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-27 14:59:31,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash 8684, now seen corresponding path program 1 times [2024-01-27 14:59:31,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:31,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632757728] [2024-01-27 14:59:31,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:31,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:31,732 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-27 14:59:31,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632757728] [2024-01-27 14:59:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632757728] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:31,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:31,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:59:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230508411] [2024-01-27 14:59:31,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:31,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:59:31,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:59:31,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:59:31,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 94 [2024-01-27 14:59:31,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-27 14:59:31,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:31,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 94 [2024-01-27 14:59:31,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:31,922 INFO L124 PetriNetUnfolderBase]: 131/575 cut-off events. [2024-01-27 14:59:31,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:59:31,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 575 events. 131/575 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3367 event pairs, 67 based on Foata normal form. 47/481 useless extension candidates. Maximal degree in co-relation 899. Up to 175 conditions per place. [2024-01-27 14:59:31,926 INFO L140 encePairwiseOnDemand]: 75/94 looper letters, 35 selfloop transitions, 4 changer transitions 0/95 dead transitions. [2024-01-27 14:59:31,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 95 transitions, 271 flow [2024-01-27 14:59:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:59:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:59:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2024-01-27 14:59:31,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8014184397163121 [2024-01-27 14:59:31,937 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 185 flow. Second operand 3 states and 226 transitions. [2024-01-27 14:59:31,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 95 transitions, 271 flow [2024-01-27 14:59:31,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 95 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:59:31,942 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 218 flow [2024-01-27 14:59:31,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2024-01-27 14:59:31,945 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -1 predicate places. [2024-01-27 14:59:31,946 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 218 flow [2024-01-27 14:59:31,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-27 14:59:31,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:31,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 14:59:31,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 14:59:31,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-27 14:59:31,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash 259105612, now seen corresponding path program 1 times [2024-01-27 14:59:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:31,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327098334] [2024-01-27 14:59:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:32,069 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-27 14:59:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:32,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327098334] [2024-01-27 14:59:32,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327098334] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:32,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:59:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101687280] [2024-01-27 14:59:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:32,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:59:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:32,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:59:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:59:32,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 94 [2024-01-27 14:59:32,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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-27 14:59:32,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:32,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 94 [2024-01-27 14:59:32,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:32,257 INFO L124 PetriNetUnfolderBase]: 73/646 cut-off events. [2024-01-27 14:59:32,257 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-01-27 14:59:32,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 646 events. 73/646 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4131 event pairs, 10 based on Foata normal form. 60/594 useless extension candidates. Maximal degree in co-relation 929. Up to 154 conditions per place. [2024-01-27 14:59:32,261 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 20 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-01-27 14:59:32,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 83 transitions, 252 flow [2024-01-27 14:59:32,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:59:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:59:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2024-01-27 14:59:32,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7712765957446809 [2024-01-27 14:59:32,278 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 218 flow. Second operand 4 states and 290 transitions. [2024-01-27 14:59:32,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 83 transitions, 252 flow [2024-01-27 14:59:32,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:59:32,281 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 196 flow [2024-01-27 14:59:32,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2024-01-27 14:59:32,282 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -9 predicate places. [2024-01-27 14:59:32,282 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 196 flow [2024-01-27 14:59:32,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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-27 14:59:32,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:32,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:59:32,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 14:59:32,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-27 14:59:32,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:32,283 INFO L85 PathProgramCache]: Analyzing trace with hash 766826439, now seen corresponding path program 1 times [2024-01-27 14:59:32,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:32,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322394850] [2024-01-27 14:59:32,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:32,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:32,319 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-27 14:59:32,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:32,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322394850] [2024-01-27 14:59:32,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322394850] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:32,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:32,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 14:59:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293575438] [2024-01-27 14:59:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:32,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:59:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:59:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:59:32,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 94 [2024-01-27 14:59:32,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-27 14:59:32,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:32,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 94 [2024-01-27 14:59:32,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:32,423 INFO L124 PetriNetUnfolderBase]: 150/621 cut-off events. [2024-01-27 14:59:32,423 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-01-27 14:59:32,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 621 events. 150/621 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3596 event pairs, 126 based on Foata normal form. 5/553 useless extension candidates. Maximal degree in co-relation 1068. Up to 307 conditions per place. [2024-01-27 14:59:32,426 INFO L140 encePairwiseOnDemand]: 91/94 looper letters, 33 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-01-27 14:59:32,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 274 flow [2024-01-27 14:59:32,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:59:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:59:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2024-01-27 14:59:32,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7730496453900709 [2024-01-27 14:59:32,429 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 196 flow. Second operand 3 states and 218 transitions. [2024-01-27 14:59:32,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 274 flow [2024-01-27 14:59:32,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 83 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:59:32,433 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 201 flow [2024-01-27 14:59:32,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2024-01-27 14:59:32,434 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -9 predicate places. [2024-01-27 14:59:32,434 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 201 flow [2024-01-27 14:59:32,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-27 14:59:32,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:32,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:59:32,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 14:59:32,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-27 14:59:32,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1998183826, now seen corresponding path program 1 times [2024-01-27 14:59:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:32,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65652351] [2024-01-27 14:59:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:32,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:32,498 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-27 14:59:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:32,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65652351] [2024-01-27 14:59:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65652351] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 14:59:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289919900] [2024-01-27 14:59:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:32,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:59:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:32,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:59:32,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:59:32,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 94 [2024-01-27 14:59:32,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-27 14:59:32,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:32,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 94 [2024-01-27 14:59:32,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:32,579 INFO L124 PetriNetUnfolderBase]: 77/395 cut-off events. [2024-01-27 14:59:32,579 INFO L125 PetriNetUnfolderBase]: For 81/92 co-relation queries the response was YES. [2024-01-27 14:59:32,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 395 events. 77/395 cut-off events. For 81/92 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2042 event pairs, 55 based on Foata normal form. 56/372 useless extension candidates. Maximal degree in co-relation 620. Up to 140 conditions per place. [2024-01-27 14:59:32,581 INFO L140 encePairwiseOnDemand]: 82/94 looper letters, 26 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-01-27 14:59:32,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 75 transitions, 229 flow [2024-01-27 14:59:32,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:59:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:59:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-01-27 14:59:32,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7943262411347518 [2024-01-27 14:59:32,583 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 201 flow. Second operand 3 states and 224 transitions. [2024-01-27 14:59:32,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 75 transitions, 229 flow [2024-01-27 14:59:32,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:59:32,585 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 163 flow [2024-01-27 14:59:32,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2024-01-27 14:59:32,585 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -17 predicate places. [2024-01-27 14:59:32,585 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 163 flow [2024-01-27 14:59:32,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-27 14:59:32,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:32,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:59:32,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 14:59:32,586 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-27 14:59:32,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 542414041, now seen corresponding path program 1 times [2024-01-27 14:59:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:32,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682981728] [2024-01-27 14:59:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:32,619 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-27 14:59:32,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:32,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682981728] [2024-01-27 14:59:32,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682981728] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:32,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:32,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 14:59:32,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3965145] [2024-01-27 14:59:32,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:32,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:59:32,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:32,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:59:32,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:59:32,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2024-01-27 14:59:32,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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-27 14:59:32,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:32,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2024-01-27 14:59:32,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:32,807 INFO L124 PetriNetUnfolderBase]: 159/699 cut-off events. [2024-01-27 14:59:32,807 INFO L125 PetriNetUnfolderBase]: For 81/83 co-relation queries the response was YES. [2024-01-27 14:59:32,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 699 events. 159/699 cut-off events. For 81/83 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3883 event pairs, 84 based on Foata normal form. 60/721 useless extension candidates. Maximal degree in co-relation 1157. Up to 183 conditions per place. [2024-01-27 14:59:32,809 INFO L140 encePairwiseOnDemand]: 78/94 looper letters, 41 selfloop transitions, 4 changer transitions 5/83 dead transitions. [2024-01-27 14:59:32,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 293 flow [2024-01-27 14:59:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:59:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:59:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2024-01-27 14:59:32,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6329787234042553 [2024-01-27 14:59:32,811 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 163 flow. Second operand 4 states and 238 transitions. [2024-01-27 14:59:32,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 293 flow [2024-01-27 14:59:32,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 83 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:59:32,814 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 190 flow [2024-01-27 14:59:32,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2024-01-27 14:59:32,816 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -14 predicate places. [2024-01-27 14:59:32,816 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 190 flow [2024-01-27 14:59:32,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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-27 14:59:32,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:32,817 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-27 14:59:32,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 14:59:32,817 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-27 14:59:32,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2145858055, now seen corresponding path program 1 times [2024-01-27 14:59:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:32,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258148616] [2024-01-27 14:59:32,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:32,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:32,929 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-27 14:59:32,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:32,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258148616] [2024-01-27 14:59:32,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258148616] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:32,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:32,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:59:32,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503648174] [2024-01-27 14:59:32,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:32,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:59:32,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:32,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:59:32,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:59:32,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 94 [2024-01-27 14:59:32,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-27 14:59:32,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:32,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 94 [2024-01-27 14:59:32,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:32,978 INFO L124 PetriNetUnfolderBase]: 29/332 cut-off events. [2024-01-27 14:59:32,978 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-01-27 14:59:32,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 332 events. 29/332 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1535 event pairs, 9 based on Foata normal form. 10/332 useless extension candidates. Maximal degree in co-relation 493. Up to 60 conditions per place. [2024-01-27 14:59:32,980 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 15 selfloop transitions, 4 changer transitions 2/71 dead transitions. [2024-01-27 14:59:32,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 71 transitions, 236 flow [2024-01-27 14:59:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:59:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:59:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2024-01-27 14:59:32,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-01-27 14:59:32,981 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 190 flow. Second operand 3 states and 247 transitions. [2024-01-27 14:59:32,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 71 transitions, 236 flow [2024-01-27 14:59:32,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 213 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-01-27 14:59:32,984 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 169 flow [2024-01-27 14:59:32,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2024-01-27 14:59:32,984 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -16 predicate places. [2024-01-27 14:59:32,985 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 169 flow [2024-01-27 14:59:32,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-27 14:59:32,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:32,985 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-27 14:59:32,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 14:59:32,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-27 14:59:32,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:32,986 INFO L85 PathProgramCache]: Analyzing trace with hash -352987537, now seen corresponding path program 1 times [2024-01-27 14:59:32,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:32,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117486213] [2024-01-27 14:59:32,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:32,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:33,015 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-27 14:59:33,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:33,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117486213] [2024-01-27 14:59:33,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117486213] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:33,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:33,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:59:33,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545995655] [2024-01-27 14:59:33,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:33,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:59:33,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:33,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:59:33,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:59:33,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 94 [2024-01-27 14:59:33,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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-27 14:59:33,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:33,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 94 [2024-01-27 14:59:33,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:33,133 INFO L124 PetriNetUnfolderBase]: 34/261 cut-off events. [2024-01-27 14:59:33,134 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-01-27 14:59:33,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 261 events. 34/261 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 943 event pairs, 19 based on Foata normal form. 50/296 useless extension candidates. Maximal degree in co-relation 400. Up to 62 conditions per place. [2024-01-27 14:59:33,135 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 20 selfloop transitions, 2 changer transitions 24/65 dead transitions. [2024-01-27 14:59:33,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 223 flow [2024-01-27 14:59:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:59:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:59:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2024-01-27 14:59:33,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6148936170212767 [2024-01-27 14:59:33,136 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 169 flow. Second operand 5 states and 289 transitions. [2024-01-27 14:59:33,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 223 flow [2024-01-27 14:59:33,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:59:33,138 INFO L231 Difference]: Finished difference. Result has 66 places, 36 transitions, 93 flow [2024-01-27 14:59:33,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=66, PETRI_TRANSITIONS=36} [2024-01-27 14:59:33,139 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -27 predicate places. [2024-01-27 14:59:33,139 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 36 transitions, 93 flow [2024-01-27 14:59:33,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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-27 14:59:33,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:33,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:59:33,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 14:59:33,140 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-27 14:59:33,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash 322047283, now seen corresponding path program 1 times [2024-01-27 14:59:33,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:33,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572893146] [2024-01-27 14:59:33,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:33,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:59:33,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:33,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572893146] [2024-01-27 14:59:33,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572893146] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:33,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:33,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:59:33,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836281751] [2024-01-27 14:59:33,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:33,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 14:59:33,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:33,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 14:59:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 14:59:33,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 94 [2024-01-27 14:59:33,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 36 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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-27 14:59:33,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:33,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 94 [2024-01-27 14:59:33,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:33,337 INFO L124 PetriNetUnfolderBase]: 29/175 cut-off events. [2024-01-27 14:59:33,337 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-27 14:59:33,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 175 events. 29/175 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 614 event pairs, 13 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 291. Up to 43 conditions per place. [2024-01-27 14:59:33,338 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 17 selfloop transitions, 2 changer transitions 11/46 dead transitions. [2024-01-27 14:59:33,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 171 flow [2024-01-27 14:59:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 14:59:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 14:59:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 282 transitions. [2024-01-27 14:59:33,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-01-27 14:59:33,339 INFO L175 Difference]: Start difference. First operand has 66 places, 36 transitions, 93 flow. Second operand 6 states and 282 transitions. [2024-01-27 14:59:33,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 171 flow [2024-01-27 14:59:33,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:59:33,341 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 88 flow [2024-01-27 14:59:33,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2024-01-27 14:59:33,341 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -41 predicate places. [2024-01-27 14:59:33,341 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 88 flow [2024-01-27 14:59:33,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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-27 14:59:33,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:33,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:59:33,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 14:59:33,342 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-27 14:59:33,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1271264989, now seen corresponding path program 1 times [2024-01-27 14:59:33,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:33,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26266632] [2024-01-27 14:59:33,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:33,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:59:33,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 14:59:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:59:33,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 14:59:33,370 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 14:59:33,371 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr18ASSERT_VIOLATIONERROR_FUNCTION (72 of 73 remaining) [2024-01-27 14:59:33,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 73 remaining) [2024-01-27 14:59:33,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 73 remaining) [2024-01-27 14:59:33,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (69 of 73 remaining) [2024-01-27 14:59:33,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 73 remaining) [2024-01-27 14:59:33,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 73 remaining) [2024-01-27 14:59:33,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 73 remaining) [2024-01-27 14:59:33,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 73 remaining) [2024-01-27 14:59:33,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 73 remaining) [2024-01-27 14:59:33,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 73 remaining) [2024-01-27 14:59:33,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 73 remaining) [2024-01-27 14:59:33,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 73 remaining) [2024-01-27 14:59:33,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 73 remaining) [2024-01-27 14:59:33,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 73 remaining) [2024-01-27 14:59:33,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 73 remaining) [2024-01-27 14:59:33,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 73 remaining) [2024-01-27 14:59:33,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 73 remaining) [2024-01-27 14:59:33,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 73 remaining) [2024-01-27 14:59:33,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 73 remaining) [2024-01-27 14:59:33,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 73 remaining) [2024-01-27 14:59:33,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 73 remaining) [2024-01-27 14:59:33,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 73 remaining) [2024-01-27 14:59:33,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONERROR_FUNCTION (50 of 73 remaining) [2024-01-27 14:59:33,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 73 remaining) [2024-01-27 14:59:33,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 73 remaining) [2024-01-27 14:59:33,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 73 remaining) [2024-01-27 14:59:33,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 73 remaining) [2024-01-27 14:59:33,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 73 remaining) [2024-01-27 14:59:33,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr24ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 73 remaining) [2024-01-27 14:59:33,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr25ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 73 remaining) [2024-01-27 14:59:33,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr26ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 73 remaining) [2024-01-27 14:59:33,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr27ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 73 remaining) [2024-01-27 14:59:33,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr28ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 73 remaining) [2024-01-27 14:59:33,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr29ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 73 remaining) [2024-01-27 14:59:33,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr30ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 73 remaining) [2024-01-27 14:59:33,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr31ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 73 remaining) [2024-01-27 14:59:33,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr32ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 73 remaining) [2024-01-27 14:59:33,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr33ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 73 remaining) [2024-01-27 14:59:33,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr34ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 73 remaining) [2024-01-27 14:59:33,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 73 remaining) [2024-01-27 14:59:33,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 73 remaining) [2024-01-27 14:59:33,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 73 remaining) [2024-01-27 14:59:33,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 73 remaining) [2024-01-27 14:59:33,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 73 remaining) [2024-01-27 14:59:33,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 73 remaining) [2024-01-27 14:59:33,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 73 remaining) [2024-01-27 14:59:33,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 73 remaining) [2024-01-27 14:59:33,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 73 remaining) [2024-01-27 14:59:33,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 73 remaining) [2024-01-27 14:59:33,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 73 remaining) [2024-01-27 14:59:33,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 73 remaining) [2024-01-27 14:59:33,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 73 remaining) [2024-01-27 14:59:33,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 73 remaining) [2024-01-27 14:59:33,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 73 remaining) [2024-01-27 14:59:33,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 73 remaining) [2024-01-27 14:59:33,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 73 remaining) [2024-01-27 14:59:33,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 73 remaining) [2024-01-27 14:59:33,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 73 remaining) [2024-01-27 14:59:33,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 73 remaining) [2024-01-27 14:59:33,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 73 remaining) [2024-01-27 14:59:33,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 73 remaining) [2024-01-27 14:59:33,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 73 remaining) [2024-01-27 14:59:33,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr24ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 73 remaining) [2024-01-27 14:59:33,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr25ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 73 remaining) [2024-01-27 14:59:33,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr26ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 73 remaining) [2024-01-27 14:59:33,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr27ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 73 remaining) [2024-01-27 14:59:33,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr28ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 73 remaining) [2024-01-27 14:59:33,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr29ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 73 remaining) [2024-01-27 14:59:33,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr30ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 73 remaining) [2024-01-27 14:59:33,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr31ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 73 remaining) [2024-01-27 14:59:33,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr32ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 73 remaining) [2024-01-27 14:59:33,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr33ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 73 remaining) [2024-01-27 14:59:33,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr34ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 73 remaining) [2024-01-27 14:59:33,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 14:59:33,382 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:59:33,387 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 14:59:33,387 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 14:59:33,407 INFO L503 ceAbstractionStarter]: Automizer considered 36 witness invariants [2024-01-27 14:59:33,407 INFO L504 ceAbstractionStarter]: WitnessConsidered=36 [2024-01-27 14:59:33,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 02:59:33 BasicIcfg [2024-01-27 14:59:33,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 14:59:33,408 INFO L158 Benchmark]: Toolchain (without parser) took 3036.12ms. Allocated memory was 195.0MB in the beginning and 264.2MB in the end (delta: 69.2MB). Free memory was 155.1MB in the beginning and 113.1MB in the end (delta: 41.9MB). Peak memory consumption was 111.2MB. Max. memory is 16.1GB. [2024-01-27 14:59:33,408 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:59:33,408 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:59:33,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.35ms. Allocated memory is still 195.0MB. Free memory was 154.5MB in the beginning and 129.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-27 14:59:33,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.69ms. Allocated memory is still 195.0MB. Free memory was 129.9MB in the beginning and 127.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:59:33,409 INFO L158 Benchmark]: Boogie Preprocessor took 57.16ms. Allocated memory is still 195.0MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:59:33,409 INFO L158 Benchmark]: RCFGBuilder took 516.11ms. Allocated memory is still 195.0MB. Free memory was 125.8MB in the beginning and 141.5MB in the end (delta: -15.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-01-27 14:59:33,410 INFO L158 Benchmark]: TraceAbstraction took 1950.48ms. Allocated memory was 195.0MB in the beginning and 264.2MB in the end (delta: 69.2MB). Free memory was 140.5MB in the beginning and 113.1MB in the end (delta: 27.4MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. [2024-01-27 14:59:33,411 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.13ms. Allocated memory is still 109.1MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.35ms. Allocated memory is still 195.0MB. Free memory was 154.5MB in the beginning and 129.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.69ms. Allocated memory is still 195.0MB. Free memory was 129.9MB in the beginning and 127.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.16ms. Allocated memory is still 195.0MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 516.11ms. Allocated memory is still 195.0MB. Free memory was 125.8MB in the beginning and 141.5MB in the end (delta: -15.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1950.48ms. Allocated memory was 195.0MB in the beginning and 264.2MB in the end (delta: 69.2MB). Free memory was 140.5MB in the beginning and 113.1MB in the end (delta: 27.4MB). Peak memory consumption was 99.6MB. 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[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[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] 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[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[42]]]] [L688] 1 glob1 = 1 VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[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[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[1]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]]] [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: 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: 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: 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: 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: 691]: 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: 691]: 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: 691]: 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: 692]: 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: 692]: 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: 692]: 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: 693]: 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: 693]: 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. - UnprovableResult [Line: 694]: 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. - 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, 173 locations, 73 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.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 764 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 497 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 716 IncrementalHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 91 mSDtfsCounter, 716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=1, InterpolantAutomatonStates: 31, 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, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-27 14:59:33,451 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