./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_1_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_1_neg.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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_1_neg.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_18-first-reads_unknown_1_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-8857f20-m [2024-01-29 23:21:19,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 23:21:19,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 23:21:19,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 23:21:19,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 23:21:19,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 23:21:19,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 23:21:19,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 23:21:19,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 23:21:19,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 23:21:19,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 23:21:19,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 23:21:19,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 23:21:19,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 23:21:19,379 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 23:21:19,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 23:21:19,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 23:21:19,380 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 23:21:19,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 23:21:19,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 23:21:19,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 23:21:19,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 23:21:19,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 23:21:19,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 23:21:19,382 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 23:21:19,382 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 23:21:19,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 23:21:19,382 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 23:21:19,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 23:21:19,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 23:21:19,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 23:21:19,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 23:21:19,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:19,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 23:21:19,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 23:21:19,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 23:21:19,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 23:21:19,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 23:21:19,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 23:21:19,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 23:21:19,385 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 23:21:19,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 23:21:19,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 23:21:19,386 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 23:21:19,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 23:21:19,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 23:21:19,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 23:21:19,617 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 23:21:19,619 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 23:21:19,620 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_1_neg.yml/witness.yml [2024-01-29 23:21:19,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 23:21:19,721 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 23:21:19,721 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_1_neg.i [2024-01-29 23:21:20,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 23:21:20,975 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 23:21:20,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_1_neg.i [2024-01-29 23:21:20,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad8ae0801/c2ee5bd7ef3d4891835e2977b129ac1b/FLAG45287ceae [2024-01-29 23:21:20,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad8ae0801/c2ee5bd7ef3d4891835e2977b129ac1b [2024-01-29 23:21:20,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 23:21:20,999 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 23:21:21,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:21,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 23:21:21,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 23:21:21,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:19" (1/2) ... [2024-01-29 23:21:21,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba1e059 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21, skipping insertion in model container [2024-01-29 23:21:21,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:19" (1/2) ... [2024-01-29 23:21:21,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6359e485 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:21, skipping insertion in model container [2024-01-29 23:21:21,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:20" (2/2) ... [2024-01-29 23:21:21,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba1e059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21, skipping insertion in model container [2024-01-29 23:21:21,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:20" (2/2) ... [2024-01-29 23:21:21,017 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 23:21:21,058 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 23:21:21,059 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] 0 <= t [2024-01-29 23:21:21,059 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (0 <= t) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:21,060 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (0 <= t) && (t == 0 || t == 1) [2024-01-29 23:21:21,060 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (0 <= t) && (t <= 1) [2024-01-29 23:21:21,060 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-01-29 23:21:21,060 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (0 <= glob1) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:21,061 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] 0 <= glob1 [2024-01-29 23:21:21,061 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] ((0 <= glob1) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:21,061 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (0 <= glob1) && (glob1 <= 1) [2024-01-29 23:21:21,061 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] glob1 == 0 [2024-01-29 23:21:21,061 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] ((0 <= t) && (t <= 1)) && (glob1 == 0) [2024-01-29 23:21:21,061 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (((0 <= t) && (t <= 1)) && (glob1 == 0)) && (t == 0 || t == 1) [2024-01-29 23:21:21,061 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (0 <= t) && (t <= 1) [2024-01-29 23:21:21,062 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (((0 <= t) && (t <= 1)) && (glob1 == 0)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:21,062 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] 0 <= t [2024-01-29 23:21:21,062 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && (0 <= t)) && (t == 0 || t == 1) [2024-01-29 23:21:21,062 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (0 <= glob1) && (0 <= t) [2024-01-29 23:21:21,062 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && (0 <= t)) && (t <= 1) [2024-01-29 23:21:21,062 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && (0 <= t)) && (glob1 <= 1) [2024-01-29 23:21:21,062 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && (0 <= t)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:21,062 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] 0 <= glob1 [2024-01-29 23:21:21,063 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && (0 <= t)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:21,063 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:21,063 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] glob1 == 0 [2024-01-29 23:21:21,063 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (glob1 == 0) && (t == 42) [2024-01-29 23:21:21,063 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] glob1 == 0 [2024-01-29 23:21:21,064 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:21,064 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 == 0 || glob1 == 1)) && (0 <= glob1) [2024-01-29 23:21:21,064 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= glob1 [2024-01-29 23:21:21,064 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 == 0 || glob1 == 1)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:21,064 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (glob1 <= 1) [2024-01-29 23:21:21,064 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 == 0 || glob1 == 1)) && (glob1 <= 1) [2024-01-29 23:21:21,064 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 == 0 || glob1 == 1)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:21,065 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 == 0 || glob1 == 1)) && (glob1 <= 1) [2024-01-29 23:21:21,065 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 == 0 || glob1 == 1)) && (0 <= glob1) [2024-01-29 23:21:21,065 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-29 23:21:21,065 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((0 <= glob1) && ((unsigned long )arg == 0UL)) && (t == 0 || t == 1) [2024-01-29 23:21:21,065 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (0 <= glob1) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:21,066 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] 0 <= glob1 [2024-01-29 23:21:21,066 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((0 <= glob1) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:21,067 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (0 <= glob1) && (glob1 <= 1) [2024-01-29 23:21:21,067 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (0 <= glob1) && (t <= 1) [2024-01-29 23:21:21,067 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (0 <= glob1) && (0 <= t) [2024-01-29 23:21:21,067 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L689] glob1 == 0 [2024-01-29 23:21:21,067 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L689] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:21,104 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 23:21:21,268 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_1_neg.i[1097,1110] [2024-01-29 23:21:21,415 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:21,424 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 23:21:21,435 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_1_neg.i[1097,1110] [2024-01-29 23:21:21,435 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-29 23:21:21,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:21,564 INFO L206 MainTranslator]: Completed translation [2024-01-29 23:21:21,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21 WrapperNode [2024-01-29 23:21:21,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:21,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:21,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 23:21:21,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 23:21:21,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,626 INFO L138 Inliner]: procedures = 164, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2024-01-29 23:21:21,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:21,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 23:21:21,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 23:21:21,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 23:21:21,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,668 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-29 23:21:21,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 23:21:21,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 23:21:21,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 23:21:21,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 23:21:21,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (1/1) ... [2024-01-29 23:21:21,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:21,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 23:21:21,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 23:21:21,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 23:21:21,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 23:21:21,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 23:21:21,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 23:21:21,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 23:21:21,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 23:21:21,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 23:21:21,748 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 23:21:21,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 23:21:21,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 23:21:21,748 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-29 23:21:21,748 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-29 23:21:21,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 23:21:21,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 23:21:21,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 23:21:21,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 23:21:21,749 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 23:21:21,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 23:21:21,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 23:21:21,750 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 23:21:21,841 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 23:21:21,843 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 23:21:22,063 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 23:21:22,063 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 23:21:22,135 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 23:21:22,139 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 23:21:22,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:22 BoogieIcfgContainer [2024-01-29 23:21:22,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 23:21:22,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 23:21:22,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 23:21:22,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 23:21:22,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:19" (1/4) ... [2024-01-29 23:21:22,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd2fc82 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:21:22, skipping insertion in model container [2024-01-29 23:21:22,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:21:20" (2/4) ... [2024-01-29 23:21:22,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd2fc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:21:22, skipping insertion in model container [2024-01-29 23:21:22,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:21" (3/4) ... [2024-01-29 23:21:22,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd2fc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:21:22, skipping insertion in model container [2024-01-29 23:21:22,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:22" (4/4) ... [2024-01-29 23:21:22,150 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_18-first-reads_unknown_1_neg.i [2024-01-29 23:21:22,163 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 23:21:22,163 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-01-29 23:21:22,164 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 23:21:22,257 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-29 23:21:22,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 94 transitions, 195 flow [2024-01-29 23:21:22,323 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2024-01-29 23:21:22,325 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 23:21:22,328 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-29 23:21:22,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 94 transitions, 195 flow [2024-01-29 23:21:22,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 91 transitions, 185 flow [2024-01-29 23:21:22,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 23:21:22,355 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;@6f62f1a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 23:21:22,355 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2024-01-29 23:21:22,359 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 23:21:22,359 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 23:21:22,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:22,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:22,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 23:21:22,360 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-29 23:21:22,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash 8684, now seen corresponding path program 1 times [2024-01-29 23:21:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:22,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132394861] [2024-01-29 23:21:22,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:22,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132394861] [2024-01-29 23:21:22,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132394861] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:22,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:22,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:21:22,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647083984] [2024-01-29 23:21:22,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:22,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:21:22,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:22,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:21:22,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:21:22,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 94 [2024-01-29 23:21:22,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:22,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:22,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 94 [2024-01-29 23:21:22,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:23,032 INFO L124 PetriNetUnfolderBase]: 129/822 cut-off events. [2024-01-29 23:21:23,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:23,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 822 events. 129/822 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5405 event pairs, 83 based on Foata normal form. 43/674 useless extension candidates. Maximal degree in co-relation 1127. Up to 204 conditions per place. [2024-01-29 23:21:23,042 INFO L140 encePairwiseOnDemand]: 80/94 looper letters, 35 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2024-01-29 23:21:23,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 96 transitions, 273 flow [2024-01-29 23:21:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:21:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:21:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-01-29 23:21:23,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7943262411347518 [2024-01-29 23:21:23,056 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 185 flow. Second operand 3 states and 224 transitions. [2024-01-29 23:21:23,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 96 transitions, 273 flow [2024-01-29 23:21:23,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:21:23,063 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 212 flow [2024-01-29 23:21:23,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2024-01-29 23:21:23,068 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 0 predicate places. [2024-01-29 23:21:23,069 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 212 flow [2024-01-29 23:21:23,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:23,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 23:21:23,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 23:21:23,076 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-29 23:21:23,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash 259105612, now seen corresponding path program 1 times [2024-01-29 23:21:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:23,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706531915] [2024-01-29 23:21:23,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:23,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:23,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706531915] [2024-01-29 23:21:23,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706531915] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:23,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:23,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:23,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040201795] [2024-01-29 23:21:23,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:23,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:23,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:23,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:23,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:23,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2024-01-29 23:21:23,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:23,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2024-01-29 23:21:23,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:23,356 INFO L124 PetriNetUnfolderBase]: 69/707 cut-off events. [2024-01-29 23:21:23,356 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-01-29 23:21:23,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 707 events. 69/707 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4734 event pairs, 6 based on Foata normal form. 5/520 useless extension candidates. Maximal degree in co-relation 942. Up to 146 conditions per place. [2024-01-29 23:21:23,360 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 20 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-01-29 23:21:23,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 91 transitions, 260 flow [2024-01-29 23:21:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 311 transitions. [2024-01-29 23:21:23,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8271276595744681 [2024-01-29 23:21:23,366 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 212 flow. Second operand 4 states and 311 transitions. [2024-01-29 23:21:23,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 91 transitions, 260 flow [2024-01-29 23:21:23,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:23,371 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 204 flow [2024-01-29 23:21:23,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-01-29 23:21:23,372 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -1 predicate places. [2024-01-29 23:21:23,372 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 204 flow [2024-01-29 23:21:23,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:23,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:23,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 23:21:23,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:23,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash -323900529, now seen corresponding path program 1 times [2024-01-29 23:21:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:23,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275242412] [2024-01-29 23:21:23,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:23,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:23,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275242412] [2024-01-29 23:21:23,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275242412] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:23,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:23,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:21:23,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111983390] [2024-01-29 23:21:23,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:23,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:23,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:23,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:23,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:23,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 94 [2024-01-29 23:21:23,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:23,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 94 [2024-01-29 23:21:23,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:23,722 INFO L124 PetriNetUnfolderBase]: 236/973 cut-off events. [2024-01-29 23:21:23,723 INFO L125 PetriNetUnfolderBase]: For 47/48 co-relation queries the response was YES. [2024-01-29 23:21:23,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 973 events. 236/973 cut-off events. For 47/48 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6094 event pairs, 21 based on Foata normal form. 7/795 useless extension candidates. Maximal degree in co-relation 1640. Up to 262 conditions per place. [2024-01-29 23:21:23,726 INFO L140 encePairwiseOnDemand]: 78/94 looper letters, 60 selfloop transitions, 11 changer transitions 0/113 dead transitions. [2024-01-29 23:21:23,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 113 transitions, 402 flow [2024-01-29 23:21:23,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2024-01-29 23:21:23,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6622340425531915 [2024-01-29 23:21:23,728 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 204 flow. Second operand 4 states and 249 transitions. [2024-01-29 23:21:23,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 113 transitions, 402 flow [2024-01-29 23:21:23,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 113 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:23,730 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 271 flow [2024-01-29 23:21:23,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2024-01-29 23:21:23,731 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 0 predicate places. [2024-01-29 23:21:23,731 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 271 flow [2024-01-29 23:21:23,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:23,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:23,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 23:21:23,732 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:23,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1471187363, now seen corresponding path program 1 times [2024-01-29 23:21:23,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:23,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201891025] [2024-01-29 23:21:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:23,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:23,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201891025] [2024-01-29 23:21:23,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201891025] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:23,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:23,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:21:23,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267553824] [2024-01-29 23:21:23,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:23,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:23,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:23,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:23,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:23,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2024-01-29 23:21:23,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:23,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:23,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2024-01-29 23:21:23,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:24,066 INFO L124 PetriNetUnfolderBase]: 254/965 cut-off events. [2024-01-29 23:21:24,067 INFO L125 PetriNetUnfolderBase]: For 260/277 co-relation queries the response was YES. [2024-01-29 23:21:24,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 965 events. 254/965 cut-off events. For 260/277 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5971 event pairs, 155 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1841. Up to 387 conditions per place. [2024-01-29 23:21:24,071 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 60 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2024-01-29 23:21:24,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 108 transitions, 439 flow [2024-01-29 23:21:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2024-01-29 23:21:24,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-01-29 23:21:24,076 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 271 flow. Second operand 4 states and 240 transitions. [2024-01-29 23:21:24,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 108 transitions, 439 flow [2024-01-29 23:21:24,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 108 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:24,083 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 266 flow [2024-01-29 23:21:24,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2024-01-29 23:21:24,084 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 0 predicate places. [2024-01-29 23:21:24,084 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 266 flow [2024-01-29 23:21:24,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:24,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:24,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 23:21:24,085 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:24,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:24,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1998183826, now seen corresponding path program 1 times [2024-01-29 23:21:24,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:24,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729329270] [2024-01-29 23:21:24,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:24,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:24,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729329270] [2024-01-29 23:21:24,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729329270] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:24,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:24,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:21:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772868681] [2024-01-29 23:21:24,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:24,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:21:24,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:24,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:21:24,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:21:24,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 94 [2024-01-29 23:21:24,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:24,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 94 [2024-01-29 23:21:24,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:24,252 INFO L124 PetriNetUnfolderBase]: 97/698 cut-off events. [2024-01-29 23:21:24,252 INFO L125 PetriNetUnfolderBase]: For 176/183 co-relation queries the response was YES. [2024-01-29 23:21:24,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 698 events. 97/698 cut-off events. For 176/183 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4382 event pairs, 75 based on Foata normal form. 39/615 useless extension candidates. Maximal degree in co-relation 1075. Up to 186 conditions per place. [2024-01-29 23:21:24,255 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 30 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-01-29 23:21:24,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 85 transitions, 286 flow [2024-01-29 23:21:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:21:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:21:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-01-29 23:21:24,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7943262411347518 [2024-01-29 23:21:24,256 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 266 flow. Second operand 3 states and 224 transitions. [2024-01-29 23:21:24,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 85 transitions, 286 flow [2024-01-29 23:21:24,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 85 transitions, 260 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-01-29 23:21:24,258 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 186 flow [2024-01-29 23:21:24,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2024-01-29 23:21:24,259 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -8 predicate places. [2024-01-29 23:21:24,259 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 186 flow [2024-01-29 23:21:24,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:24,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:24,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 23:21:24,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:24,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1814156117, now seen corresponding path program 1 times [2024-01-29 23:21:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:24,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073139004] [2024-01-29 23:21:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073139004] [2024-01-29 23:21:24,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073139004] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:24,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:24,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:24,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838402328] [2024-01-29 23:21:24,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:24,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:24,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:24,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:24,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:24,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 94 [2024-01-29 23:21:24,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:24,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 94 [2024-01-29 23:21:24,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:24,491 INFO L124 PetriNetUnfolderBase]: 148/738 cut-off events. [2024-01-29 23:21:24,491 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-01-29 23:21:24,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 738 events. 148/738 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4264 event pairs, 5 based on Foata normal form. 24/643 useless extension candidates. Maximal degree in co-relation 1143. Up to 244 conditions per place. [2024-01-29 23:21:24,494 INFO L140 encePairwiseOnDemand]: 87/94 looper letters, 45 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2024-01-29 23:21:24,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 300 flow [2024-01-29 23:21:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 248 transitions. [2024-01-29 23:21:24,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-01-29 23:21:24,495 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 186 flow. Second operand 4 states and 248 transitions. [2024-01-29 23:21:24,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 300 flow [2024-01-29 23:21:24,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 90 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:24,497 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 171 flow [2024-01-29 23:21:24,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2024-01-29 23:21:24,498 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -11 predicate places. [2024-01-29 23:21:24,498 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 171 flow [2024-01-29 23:21:24,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:24,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:24,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 23:21:24,499 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:24,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:24,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1783618102, now seen corresponding path program 1 times [2024-01-29 23:21:24,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:24,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780995633] [2024-01-29 23:21:24,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:24,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:24,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:24,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780995633] [2024-01-29 23:21:24,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780995633] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:24,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:24,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:24,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544824211] [2024-01-29 23:21:24,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:24,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:24,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:24,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:24,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 94 [2024-01-29 23:21:24,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:24,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 94 [2024-01-29 23:21:24,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:24,785 INFO L124 PetriNetUnfolderBase]: 279/915 cut-off events. [2024-01-29 23:21:24,786 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-01-29 23:21:24,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1685 conditions, 915 events. 279/915 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4889 event pairs, 21 based on Foata normal form. 66/919 useless extension candidates. Maximal degree in co-relation 1672. Up to 291 conditions per place. [2024-01-29 23:21:24,789 INFO L140 encePairwiseOnDemand]: 71/94 looper letters, 64 selfloop transitions, 5 changer transitions 10/101 dead transitions. [2024-01-29 23:21:24,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 101 transitions, 387 flow [2024-01-29 23:21:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:21:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:21:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2024-01-29 23:21:24,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46170212765957447 [2024-01-29 23:21:24,791 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 171 flow. Second operand 5 states and 217 transitions. [2024-01-29 23:21:24,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 101 transitions, 387 flow [2024-01-29 23:21:24,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 101 transitions, 381 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 23:21:24,793 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 216 flow [2024-01-29 23:21:24,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2024-01-29 23:21:24,793 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -8 predicate places. [2024-01-29 23:21:24,794 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 216 flow [2024-01-29 23:21:24,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:24,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:24,794 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-29 23:21:24,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 23:21:24,794 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:24,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:24,795 INFO L85 PathProgramCache]: Analyzing trace with hash 781913263, now seen corresponding path program 1 times [2024-01-29 23:21:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:24,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922937375] [2024-01-29 23:21:24,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:24,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:24,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:24,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922937375] [2024-01-29 23:21:24,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922937375] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:24,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:24,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:24,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62806372] [2024-01-29 23:21:24,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:24,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:21:24,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:24,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:21:24,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:21:24,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 94 [2024-01-29 23:21:24,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 74 transitions, 216 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-29 23:21:24,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:24,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 94 [2024-01-29 23:21:24,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:24,876 INFO L124 PetriNetUnfolderBase]: 29/351 cut-off events. [2024-01-29 23:21:24,876 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-01-29 23:21:24,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 351 events. 29/351 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1696 event pairs, 7 based on Foata normal form. 10/347 useless extension candidates. Maximal degree in co-relation 537. Up to 61 conditions per place. [2024-01-29 23:21:24,878 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 15 selfloop transitions, 4 changer transitions 2/77 dead transitions. [2024-01-29 23:21:24,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 77 transitions, 265 flow [2024-01-29 23:21:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:21:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:21:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2024-01-29 23:21:24,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-01-29 23:21:24,879 INFO L175 Difference]: Start difference. First operand has 85 places, 74 transitions, 216 flow. Second operand 3 states and 247 transitions. [2024-01-29 23:21:24,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 77 transitions, 265 flow [2024-01-29 23:21:24,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 233 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-01-29 23:21:24,881 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 187 flow [2024-01-29 23:21:24,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2024-01-29 23:21:24,882 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -11 predicate places. [2024-01-29 23:21:24,882 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 187 flow [2024-01-29 23:21:24,882 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-29 23:21:24,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:24,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:24,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 23:21:24,883 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:24,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1951049356, now seen corresponding path program 1 times [2024-01-29 23:21:24,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:24,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340428758] [2024-01-29 23:21:24,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:24,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340428758] [2024-01-29 23:21:24,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340428758] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:24,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:24,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:21:24,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130079043] [2024-01-29 23:21:24,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:24,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:24,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:24,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:25,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 94 [2024-01-29 23:21:25,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:25,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:25,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 94 [2024-01-29 23:21:25,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:25,112 INFO L124 PetriNetUnfolderBase]: 97/426 cut-off events. [2024-01-29 23:21:25,112 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-01-29 23:21:25,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 426 events. 97/426 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1738 event pairs, 15 based on Foata normal form. 36/444 useless extension candidates. Maximal degree in co-relation 751. Up to 200 conditions per place. [2024-01-29 23:21:25,114 INFO L140 encePairwiseOnDemand]: 81/94 looper letters, 46 selfloop transitions, 4 changer transitions 3/78 dead transitions. [2024-01-29 23:21:25,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 291 flow [2024-01-29 23:21:25,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:21:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:21:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-01-29 23:21:25,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4829787234042553 [2024-01-29 23:21:25,115 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 187 flow. Second operand 5 states and 227 transitions. [2024-01-29 23:21:25,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 291 flow [2024-01-29 23:21:25,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 78 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:25,117 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 154 flow [2024-01-29 23:21:25,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2024-01-29 23:21:25,117 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -19 predicate places. [2024-01-29 23:21:25,117 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 154 flow [2024-01-29 23:21:25,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:25,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:25,118 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-29 23:21:25,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 23:21:25,118 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:25,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:25,119 INFO L85 PathProgramCache]: Analyzing trace with hash 322047283, now seen corresponding path program 1 times [2024-01-29 23:21:25,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:25,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658516357] [2024-01-29 23:21:25,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:25,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:21:25,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 23:21:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:21:25,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 23:21:25,147 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 23:21:25,147 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr18ASSERT_VIOLATIONERROR_FUNCTION (72 of 73 remaining) [2024-01-29 23:21:25,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 73 remaining) [2024-01-29 23:21:25,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 73 remaining) [2024-01-29 23:21:25,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (69 of 73 remaining) [2024-01-29 23:21:25,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 73 remaining) [2024-01-29 23:21:25,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 73 remaining) [2024-01-29 23:21:25,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 73 remaining) [2024-01-29 23:21:25,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 73 remaining) [2024-01-29 23:21:25,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 73 remaining) [2024-01-29 23:21:25,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 73 remaining) [2024-01-29 23:21:25,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 73 remaining) [2024-01-29 23:21:25,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 73 remaining) [2024-01-29 23:21:25,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 73 remaining) [2024-01-29 23:21:25,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 73 remaining) [2024-01-29 23:21:25,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 73 remaining) [2024-01-29 23:21:25,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 73 remaining) [2024-01-29 23:21:25,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 73 remaining) [2024-01-29 23:21:25,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 73 remaining) [2024-01-29 23:21:25,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 73 remaining) [2024-01-29 23:21:25,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 73 remaining) [2024-01-29 23:21:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 73 remaining) [2024-01-29 23:21:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 73 remaining) [2024-01-29 23:21:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONERROR_FUNCTION (50 of 73 remaining) [2024-01-29 23:21:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 73 remaining) [2024-01-29 23:21:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 73 remaining) [2024-01-29 23:21:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 73 remaining) [2024-01-29 23:21:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 73 remaining) [2024-01-29 23:21:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 73 remaining) [2024-01-29 23:21:25,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr24ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 73 remaining) [2024-01-29 23:21:25,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr25ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 73 remaining) [2024-01-29 23:21:25,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr26ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 73 remaining) [2024-01-29 23:21:25,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr27ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 73 remaining) [2024-01-29 23:21:25,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr28ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 73 remaining) [2024-01-29 23:21:25,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr29ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 73 remaining) [2024-01-29 23:21:25,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr30ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 73 remaining) [2024-01-29 23:21:25,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr31ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 73 remaining) [2024-01-29 23:21:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr32ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 73 remaining) [2024-01-29 23:21:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr33ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 73 remaining) [2024-01-29 23:21:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr34ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 73 remaining) [2024-01-29 23:21:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 73 remaining) [2024-01-29 23:21:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 73 remaining) [2024-01-29 23:21:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 73 remaining) [2024-01-29 23:21:25,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 73 remaining) [2024-01-29 23:21:25,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 73 remaining) [2024-01-29 23:21:25,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 73 remaining) [2024-01-29 23:21:25,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 73 remaining) [2024-01-29 23:21:25,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 73 remaining) [2024-01-29 23:21:25,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 73 remaining) [2024-01-29 23:21:25,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 73 remaining) [2024-01-29 23:21:25,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 73 remaining) [2024-01-29 23:21:25,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 73 remaining) [2024-01-29 23:21:25,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 73 remaining) [2024-01-29 23:21:25,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 73 remaining) [2024-01-29 23:21:25,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 73 remaining) [2024-01-29 23:21:25,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 73 remaining) [2024-01-29 23:21:25,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 73 remaining) [2024-01-29 23:21:25,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 73 remaining) [2024-01-29 23:21:25,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 73 remaining) [2024-01-29 23:21:25,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 73 remaining) [2024-01-29 23:21:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 73 remaining) [2024-01-29 23:21:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 73 remaining) [2024-01-29 23:21:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 73 remaining) [2024-01-29 23:21:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr24ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 73 remaining) [2024-01-29 23:21:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr25ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 73 remaining) [2024-01-29 23:21:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr26ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 73 remaining) [2024-01-29 23:21:25,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr27ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 73 remaining) [2024-01-29 23:21:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr28ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 73 remaining) [2024-01-29 23:21:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr29ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 73 remaining) [2024-01-29 23:21:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr30ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 73 remaining) [2024-01-29 23:21:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr31ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 73 remaining) [2024-01-29 23:21:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr32ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 73 remaining) [2024-01-29 23:21:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr33ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 73 remaining) [2024-01-29 23:21:25,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr34ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 73 remaining) [2024-01-29 23:21:25,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 23:21:25,159 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:25,163 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 23:21:25,163 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 23:21:25,183 INFO L503 ceAbstractionStarter]: Automizer considered 36 witness invariants [2024-01-29 23:21:25,183 INFO L504 ceAbstractionStarter]: WitnessConsidered=36 [2024-01-29 23:21:25,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:21:25 BasicIcfg [2024-01-29 23:21:25,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 23:21:25,184 INFO L158 Benchmark]: Toolchain (without parser) took 4184.68ms. Allocated memory was 159.4MB in the beginning and 253.8MB in the end (delta: 94.4MB). Free memory was 81.3MB in the beginning and 104.7MB in the end (delta: -23.4MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,184 INFO L158 Benchmark]: Witness Parser took 0.46ms. Allocated memory is still 159.4MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:21:25,184 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:21:25,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.98ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 81.1MB in the beginning and 163.3MB in the end (delta: -82.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.94ms. Allocated memory is still 207.6MB. Free memory was 163.3MB in the beginning and 161.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,185 INFO L158 Benchmark]: Boogie Preprocessor took 51.86ms. Allocated memory is still 207.6MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,185 INFO L158 Benchmark]: RCFGBuilder took 460.47ms. Allocated memory is still 207.6MB. Free memory was 159.1MB in the beginning and 129.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,185 INFO L158 Benchmark]: TraceAbstraction took 3041.79ms. Allocated memory was 207.6MB in the beginning and 253.8MB in the end (delta: 46.1MB). Free memory was 129.8MB in the beginning and 104.7MB in the end (delta: 25.1MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. [2024-01-29 23:21:25,186 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.46ms. Allocated memory is still 159.4MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.98ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 81.1MB in the beginning and 163.3MB in the end (delta: -82.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.94ms. Allocated memory is still 207.6MB. Free memory was 163.3MB in the beginning and 161.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.86ms. Allocated memory is still 207.6MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 460.47ms. Allocated memory is still 207.6MB. Free memory was 159.1MB in the beginning and 129.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3041.79ms. Allocated memory was 207.6MB in the beginning and 253.8MB in the end (delta: 46.1MB). Free memory was 129.8MB in the beginning and 104.7MB in the end (delta: 25.1MB). Peak memory consumption was 71.2MB. 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=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L687] COND FALSE 1 !(t == 42) VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L690] 1 t = glob1 VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=0] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[1]]]]]] [L691] CALL 1 __VERIFIER_assert(!(t == 0)) [L19] COND TRUE 1 !(cond) VAL [\old(cond)=0, cond=0, glob1=0, mutex1={3:0}] [L19] 1 reach_error() VAL [\old(cond)=0, cond=0, glob1=0, 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: 2.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1481 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 871 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1306 IncrementalHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 157 mSDtfsCounter, 1306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=3, InterpolantAutomatonStates: 35, 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.5s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 23:21:25,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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