./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.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/28-race_reach_73-funloop_hard_racefree.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d25acf6 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/28-race_reach_73-funloop_hard_racefree.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-3d25acf-m [2024-01-30 14:22:18,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:22:18,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:22:18,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:22:18,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:22:18,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:22:18,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:22:18,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:22:18,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:22:18,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:22:18,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:22:18,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:22:18,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:22:18,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:22:18,943 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:22:18,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:22:18,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:22:18,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:22:18,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:22:18,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:22:18,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:22:18,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:22:18,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:22:18,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:22:18,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:22:18,947 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:22:18,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:22:18,947 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:22:18,948 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:22:18,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:22:18,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:22:18,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:22:18,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:22:18,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:22:18,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:22:18,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:22:18,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:22:18,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:22:18,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:22:18,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:22:18,951 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:22:18,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:22:18,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:22:18,952 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-30 14:22:19,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:22:19,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:22:19,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:22:19,196 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:22:19,196 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:22:19,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-01-30 14:22:20,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:22:20,496 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:22:20,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-01-30 14:22:20,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a974bde73/bf63d84025d14375aa3c53a9067d170d/FLAGe6964f1d0 [2024-01-30 14:22:20,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a974bde73/bf63d84025d14375aa3c53a9067d170d [2024-01-30 14:22:20,546 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:22:20,547 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:22:20,547 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/28-race_reach_73-funloop_hard_racefree.yml/witness.yml [2024-01-30 14:22:20,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:22:20,651 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:22:20,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:22:20,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:22:20,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:22:20,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:22:20" (1/2) ... [2024-01-30 14:22:20,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296401c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:22:20, skipping insertion in model container [2024-01-30 14:22:20,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:22:20" (1/2) ... [2024-01-30 14:22:20,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1578e218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:22:20, skipping insertion in model container [2024-01-30 14:22:20,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:20" (2/2) ... [2024-01-30 14:22:20,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296401c4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:20, skipping insertion in model container [2024-01-30 14:22:20,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:20" (2/2) ... [2024-01-30 14:22:20,660 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:22:20,753 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:22:20,755 INFO L98 nessWitnessExtractor]: Location invariant before [L955-L955] ((i == 10) && (i == 10)) && (i == 10000) [2024-01-30 14:22:20,755 INFO L98 nessWitnessExtractor]: Location invariant before [L947-L947] (i == 10) && ((unsigned long )arg == 0UL) [2024-01-30 14:22:20,755 INFO L98 nessWitnessExtractor]: Location invariant before [L957-L957] ((i == 10) && (i == 10)) && (i == 10000) [2024-01-30 14:22:20,756 INFO L98 nessWitnessExtractor]: Location invariant before [L946-L946] ((unsigned long )arg == 0UL) && (((((((((i == 9 || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-01-30 14:22:20,756 INFO L98 nessWitnessExtractor]: Loop invariant at [L946-L946] (unsigned long )arg == 0UL [2024-01-30 14:22:20,756 INFO L98 nessWitnessExtractor]: Location invariant before [L942-L942] ((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9] [2024-01-30 14:22:20,757 INFO L98 nessWitnessExtractor]: Location invariant before [L953-L953] (i == 10) && ((((((((((((((((((((((((((25 <= i && i <= 9999) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-01-30 14:22:20,757 INFO L98 nessWitnessExtractor]: Loop invariant at [L953-L953] (i == 10) && ((((((((((((((((((((((((((25 <= i && i <= 10000) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-01-30 14:22:20,757 INFO L98 nessWitnessExtractor]: Loop invariant at [L958-L958] (((i == 10) && (i == 10)) && (i == 10000)) && ((((((((((((((((((((((((((25 <= i && i <= 10000) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-01-30 14:22:20,757 INFO L98 nessWitnessExtractor]: Location invariant before [L958-L958] (((i == 10) && (i == 10)) && (i == 10000)) && ((((((((((((((((((((((((((25 <= i && i <= 9999) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-01-30 14:22:20,757 INFO L98 nessWitnessExtractor]: Loop invariant at [L950-L951] (((((((((i == 10 || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0) [2024-01-30 14:22:20,757 INFO L98 nessWitnessExtractor]: Location invariant after [L950-L951] ((((((((i == 9 || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0) [2024-01-30 14:22:20,757 INFO L98 nessWitnessExtractor]: Loop invariant at [L953-L953] (i == 10) && ((((((((((((((((((((((((((25 <= i && i <= 10000) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-01-30 14:22:20,758 INFO L98 nessWitnessExtractor]: Location invariant before [L953-L953] (i == 10) && ((((((((((((((((((((((((((25 <= i && i <= 9999) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-01-30 14:22:20,758 INFO L98 nessWitnessExtractor]: Location invariant before [L959-L959] (((i == 10) && (i == 10)) && (i == 10000)) && (i == 10000) [2024-01-30 14:22:20,758 INFO L98 nessWitnessExtractor]: Location invariant before [L954-L954] ((i == 10) && (i == 10000)) && (((((((((i == 9 || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-01-30 14:22:20,758 INFO L98 nessWitnessExtractor]: Loop invariant at [L954-L954] (i == 10) && (i == 10000) [2024-01-30 14:22:20,758 INFO L98 nessWitnessExtractor]: Location invariant before [L956-L956] (((((((((((((((((((((((((((((i == 10) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000) [2024-01-30 14:22:20,758 INFO L98 nessWitnessExtractor]: Loop invariant at [L956-L956] (((((((((((i == 10) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000) [2024-01-30 14:22:20,759 INFO L98 nessWitnessExtractor]: Loop invariant at [L941-L941] (((((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) [2024-01-30 14:22:20,759 INFO L98 nessWitnessExtractor]: Location invariant before [L941-L941] (((((((((((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) [2024-01-30 14:22:20,800 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:22:21,195 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/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2024-01-30 14:22:21,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:22:21,252 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:22:21,282 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/28-race_reach_73-funloop_hard_racefree.i[41323,41336] 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-30 14:22:21,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:22:21,685 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:22:21,685 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21 WrapperNode [2024-01-30 14:22:21,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:22:21,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:22:21,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:22:21,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:22:21,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,847 INFO L138 Inliner]: procedures = 272, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 314 [2024-01-30 14:22:21,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:22:21,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:22:21,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:22:21,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:22:21,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,922 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 5, 2, 16]. 64 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 8 writes are split as follows [0, 0, 1, 7]. [2024-01-30 14:22:21,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:22,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:22,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:22,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:22,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:22:22,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:22:22,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:22:22,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:22:22,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:22,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:22:22,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:22,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-30 14:22:22,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-30 14:22:22,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:22:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:22:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-30 14:22:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:22:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:22:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:22:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:22:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:22:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:22:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:22:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:22:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-30 14:22:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:22:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-30 14:22:22,083 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-30 14:22:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:22:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:22:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:22:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:22:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:22:22,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:22:22,085 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:22:22,201 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:22:22,203 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:22:22,706 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:22:22,706 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:22:22,783 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:22:22,783 INFO L320 CfgBuilder]: Removed 35 assume(true) statements. [2024-01-30 14:22:22,784 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:22:22 BoogieIcfgContainer [2024-01-30 14:22:22,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:22:22,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:22:22,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:22:22,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:22:22,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:22:20" (1/4) ... [2024-01-30 14:22:22,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1530d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:22:22, skipping insertion in model container [2024-01-30 14:22:22,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:20" (2/4) ... [2024-01-30 14:22:22,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1530d5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:22:22, skipping insertion in model container [2024-01-30 14:22:22,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (3/4) ... [2024-01-30 14:22:22,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1530d5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:22:22, skipping insertion in model container [2024-01-30 14:22:22,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:22:22" (4/4) ... [2024-01-30 14:22:22,790 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2024-01-30 14:22:22,804 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:22:22,804 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-01-30 14:22:22,805 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:22:22,903 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-30 14:22:22,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 195 transitions, 397 flow [2024-01-30 14:22:23,079 INFO L124 PetriNetUnfolderBase]: 65/311 cut-off events. [2024-01-30 14:22:23,079 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-30 14:22:23,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 311 events. 65/311 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1636 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 176. Up to 8 conditions per place. [2024-01-30 14:22:23,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 195 transitions, 397 flow [2024-01-30 14:22:23,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 195 transitions, 397 flow [2024-01-30 14:22:23,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:22:23,124 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;@75a5716f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:22:23,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-01-30 14:22:23,126 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:22:23,135 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:22:23,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:22:23,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:23,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:22:23,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:23,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash 25706, now seen corresponding path program 1 times [2024-01-30 14:22:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:23,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023614680] [2024-01-30 14:22:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:23,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:23,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:23,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023614680] [2024-01-30 14:22:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023614680] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:23,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:23,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:22:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939557519] [2024-01-30 14:22:23,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:23,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:23,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:23,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:23,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:23,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 195 [2024-01-30 14:22:23,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 195 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:23,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:23,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 195 [2024-01-30 14:22:23,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:23,523 INFO L124 PetriNetUnfolderBase]: 72/268 cut-off events. [2024-01-30 14:22:23,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:22:23,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 268 events. 72/268 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 985 event pairs, 63 based on Foata normal form. 52/262 useless extension candidates. Maximal degree in co-relation 399. Up to 161 conditions per place. [2024-01-30 14:22:23,528 INFO L140 encePairwiseOnDemand]: 179/195 looper letters, 31 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-01-30 14:22:23,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 200 flow [2024-01-30 14:22:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2024-01-30 14:22:23,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4905982905982906 [2024-01-30 14:22:23,547 INFO L175 Difference]: Start difference. First operand has 158 places, 195 transitions, 397 flow. Second operand 3 states and 287 transitions. [2024-01-30 14:22:23,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 200 flow [2024-01-30 14:22:23,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-30 14:22:23,555 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 144 flow [2024-01-30 14:22:23,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2024-01-30 14:22:23,560 INFO L281 CegarLoopForPetriNet]: 158 programPoint places, -91 predicate places. [2024-01-30 14:22:23,561 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 144 flow [2024-01-30 14:22:23,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:23,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:23,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:22:23,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:22:23,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:23,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:23,565 INFO L85 PathProgramCache]: Analyzing trace with hash 24732435, now seen corresponding path program 1 times [2024-01-30 14:22:23,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:23,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484398468] [2024-01-30 14:22:23,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:23,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:23,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484398468] [2024-01-30 14:22:23,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484398468] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:23,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:23,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:23,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435879698] [2024-01-30 14:22:23,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:23,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:23,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:23,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:23,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 195 [2024-01-30 14:22:23,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:23,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:23,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 195 [2024-01-30 14:22:23,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:23,823 INFO L124 PetriNetUnfolderBase]: 72/270 cut-off events. [2024-01-30 14:22:23,824 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-30 14:22:23,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 270 events. 72/270 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 985 event pairs, 63 based on Foata normal form. 1/213 useless extension candidates. Maximal degree in co-relation 432. Up to 161 conditions per place. [2024-01-30 14:22:23,825 INFO L140 encePairwiseOnDemand]: 191/195 looper letters, 31 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-01-30 14:22:23,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 216 flow [2024-01-30 14:22:23,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2024-01-30 14:22:23,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564102564102564 [2024-01-30 14:22:23,827 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 144 flow. Second operand 4 states and 356 transitions. [2024-01-30 14:22:23,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 216 flow [2024-01-30 14:22:23,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:22:23,829 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 160 flow [2024-01-30 14:22:23,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2024-01-30 14:22:23,830 INFO L281 CegarLoopForPetriNet]: 158 programPoint places, -88 predicate places. [2024-01-30 14:22:23,830 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 160 flow [2024-01-30 14:22:23,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:23,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:23,831 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-01-30 14:22:23,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:22:23,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:23,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2001904772, now seen corresponding path program 1 times [2024-01-30 14:22:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:23,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063018069] [2024-01-30 14:22:23,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:23,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:23,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063018069] [2024-01-30 14:22:23,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063018069] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:22:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624659161] [2024-01-30 14:22:23,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:23,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:23,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:24,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:22:24,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-30 14:22:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:24,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-30 14:22:24,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:22:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:24,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:22:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:24,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624659161] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:22:24,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:22:24,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-01-30 14:22:24,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632079288] [2024-01-30 14:22:24,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:22:24,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:22:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:24,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:22:24,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:22:24,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 195 [2024-01-30 14:22:24,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:24,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:24,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 195 [2024-01-30 14:22:24,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:24,333 INFO L124 PetriNetUnfolderBase]: 72/272 cut-off events. [2024-01-30 14:22:24,333 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-01-30 14:22:24,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 272 events. 72/272 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 986 event pairs, 63 based on Foata normal form. 1/215 useless extension candidates. Maximal degree in co-relation 436. Up to 161 conditions per place. [2024-01-30 14:22:24,335 INFO L140 encePairwiseOnDemand]: 191/195 looper letters, 31 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-01-30 14:22:24,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 236 flow [2024-01-30 14:22:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2024-01-30 14:22:24,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482051282051282 [2024-01-30 14:22:24,337 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 160 flow. Second operand 5 states and 437 transitions. [2024-01-30 14:22:24,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 236 flow [2024-01-30 14:22:24,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 230 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:24,340 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 176 flow [2024-01-30 14:22:24,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2024-01-30 14:22:24,341 INFO L281 CegarLoopForPetriNet]: 158 programPoint places, -85 predicate places. [2024-01-30 14:22:24,341 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 176 flow [2024-01-30 14:22:24,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:24,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:24,342 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1] [2024-01-30 14:22:24,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-30 14:22:24,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:24,554 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:24,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash 314891685, now seen corresponding path program 2 times [2024-01-30 14:22:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:24,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831698740] [2024-01-30 14:22:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:24,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:24,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831698740] [2024-01-30 14:22:24,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831698740] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:22:24,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787625445] [2024-01-30 14:22:24,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-30 14:22:24,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:24,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:24,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:22:24,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-30 14:22:24,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-30 14:22:24,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:22:24,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-30 14:22:24,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:22:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:24,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:22:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:24,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787625445] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:22:24,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:22:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-01-30 14:22:24,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485000380] [2024-01-30 14:22:24,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:22:24,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-30 14:22:24,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:24,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-30 14:22:24,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-30 14:22:24,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 195 [2024-01-30 14:22:24,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:24,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:24,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 195 [2024-01-30 14:22:24,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:24,810 INFO L124 PetriNetUnfolderBase]: 72/274 cut-off events. [2024-01-30 14:22:24,811 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-01-30 14:22:24,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 274 events. 72/274 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 990 event pairs, 63 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 440. Up to 161 conditions per place. [2024-01-30 14:22:24,812 INFO L140 encePairwiseOnDemand]: 191/195 looper letters, 31 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2024-01-30 14:22:24,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 68 transitions, 256 flow [2024-01-30 14:22:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-30 14:22:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-30 14:22:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 518 transitions. [2024-01-30 14:22:24,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427350427350427 [2024-01-30 14:22:24,814 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 176 flow. Second operand 6 states and 518 transitions. [2024-01-30 14:22:24,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 68 transitions, 256 flow [2024-01-30 14:22:24,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 246 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-30 14:22:24,816 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 192 flow [2024-01-30 14:22:24,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2024-01-30 14:22:24,817 INFO L281 CegarLoopForPetriNet]: 158 programPoint places, -82 predicate places. [2024-01-30 14:22:24,817 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 192 flow [2024-01-30 14:22:24,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:24,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:24,818 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1] [2024-01-30 14:22:24,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-30 14:22:25,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-01-30 14:22:25,032 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:25,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:25,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1963227534, now seen corresponding path program 3 times [2024-01-30 14:22:25,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:25,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303887439] [2024-01-30 14:22:25,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:25,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:25,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:25,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303887439] [2024-01-30 14:22:25,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303887439] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:22:25,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049588186] [2024-01-30 14:22:25,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-30 14:22:25,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:25,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:25,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:22:25,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-30 14:22:25,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-30 14:22:25,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:22:25,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2024-01-30 14:22:25,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:22:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-30 14:22:25,437 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-30 14:22:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049588186] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:25,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-30 14:22:25,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2024-01-30 14:22:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141740161] [2024-01-30 14:22:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:25,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:25,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:25,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-01-30 14:22:25,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 195 [2024-01-30 14:22:25,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:25,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:25,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 195 [2024-01-30 14:22:25,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:25,509 INFO L124 PetriNetUnfolderBase]: 72/273 cut-off events. [2024-01-30 14:22:25,509 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-01-30 14:22:25,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 273 events. 72/273 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 988 event pairs, 63 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 433. Up to 157 conditions per place. [2024-01-30 14:22:25,510 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 33 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-01-30 14:22:25,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 67 transitions, 258 flow [2024-01-30 14:22:25,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2024-01-30 14:22:25,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44487179487179485 [2024-01-30 14:22:25,512 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 192 flow. Second operand 4 states and 347 transitions. [2024-01-30 14:22:25,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 67 transitions, 258 flow [2024-01-30 14:22:25,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 244 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-01-30 14:22:25,515 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 178 flow [2024-01-30 14:22:25,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2024-01-30 14:22:25,517 INFO L281 CegarLoopForPetriNet]: 158 programPoint places, -84 predicate places. [2024-01-30 14:22:25,517 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 178 flow [2024-01-30 14:22:25,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:25,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:25,518 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1] [2024-01-30 14:22:25,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-30 14:22:25,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:25,732 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:25,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1171046185, now seen corresponding path program 1 times [2024-01-30 14:22:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:25,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550566114] [2024-01-30 14:22:25,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:25,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550566114] [2024-01-30 14:22:25,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550566114] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:22:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711817999] [2024-01-30 14:22:25,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:25,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:25,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:25,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:22:25,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-30 14:22:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:25,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-30 14:22:25,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:22:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:25,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:22:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:26,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711817999] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:22:26,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:22:26,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-01-30 14:22:26,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298542179] [2024-01-30 14:22:26,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:22:26,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-30 14:22:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:26,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-30 14:22:26,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-01-30 14:22:26,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 195 [2024-01-30 14:22:26,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 178 flow. Second operand has 13 states, 13 states have (on average 80.0) internal successors, (1040), 13 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:26,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:26,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 195 [2024-01-30 14:22:26,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:26,140 INFO L124 PetriNetUnfolderBase]: 72/285 cut-off events. [2024-01-30 14:22:26,140 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-01-30 14:22:26,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 285 events. 72/285 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 986 event pairs, 63 based on Foata normal form. 6/235 useless extension candidates. Maximal degree in co-relation 420. Up to 157 conditions per place. [2024-01-30 14:22:26,141 INFO L140 encePairwiseOnDemand]: 191/195 looper letters, 40 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2024-01-30 14:22:26,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 360 flow [2024-01-30 14:22:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-30 14:22:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-30 14:22:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 994 transitions. [2024-01-30 14:22:26,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4247863247863248 [2024-01-30 14:22:26,151 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 178 flow. Second operand 12 states and 994 transitions. [2024-01-30 14:22:26,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 360 flow [2024-01-30 14:22:26,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:26,153 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 283 flow [2024-01-30 14:22:26,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=283, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2024-01-30 14:22:26,154 INFO L281 CegarLoopForPetriNet]: 158 programPoint places, -69 predicate places. [2024-01-30 14:22:26,154 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 283 flow [2024-01-30 14:22:26,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 80.0) internal successors, (1040), 13 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:26,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:26,155 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 1, 1, 1, 1] [2024-01-30 14:22:26,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-30 14:22:26,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:26,364 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:26,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:26,365 INFO L85 PathProgramCache]: Analyzing trace with hash 144428511, now seen corresponding path program 2 times [2024-01-30 14:22:26,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:26,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093195632] [2024-01-30 14:22:26,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:26,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:22:26,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:22:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:22:26,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:22:26,423 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:22:26,424 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 42 remaining) [2024-01-30 14:22:26,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 42 remaining) [2024-01-30 14:22:26,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 42 remaining) [2024-01-30 14:22:26,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 42 remaining) [2024-01-30 14:22:26,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 42 remaining) [2024-01-30 14:22:26,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 42 remaining) [2024-01-30 14:22:26,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 42 remaining) [2024-01-30 14:22:26,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 42 remaining) [2024-01-30 14:22:26,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 42 remaining) [2024-01-30 14:22:26,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 42 remaining) [2024-01-30 14:22:26,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 42 remaining) [2024-01-30 14:22:26,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 42 remaining) [2024-01-30 14:22:26,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 42 remaining) [2024-01-30 14:22:26,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 42 remaining) [2024-01-30 14:22:26,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 42 remaining) [2024-01-30 14:22:26,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 42 remaining) [2024-01-30 14:22:26,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (25 of 42 remaining) [2024-01-30 14:22:26,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 42 remaining) [2024-01-30 14:22:26,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 42 remaining) [2024-01-30 14:22:26,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 42 remaining) [2024-01-30 14:22:26,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (21 of 42 remaining) [2024-01-30 14:22:26,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 42 remaining) [2024-01-30 14:22:26,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 42 remaining) [2024-01-30 14:22:26,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 42 remaining) [2024-01-30 14:22:26,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 42 remaining) [2024-01-30 14:22:26,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 42 remaining) [2024-01-30 14:22:26,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 42 remaining) [2024-01-30 14:22:26,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 42 remaining) [2024-01-30 14:22:26,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 42 remaining) [2024-01-30 14:22:26,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 42 remaining) [2024-01-30 14:22:26,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 42 remaining) [2024-01-30 14:22:26,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 42 remaining) [2024-01-30 14:22:26,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONERROR_FUNCTION (9 of 42 remaining) [2024-01-30 14:22:26,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 42 remaining) [2024-01-30 14:22:26,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 42 remaining) [2024-01-30 14:22:26,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 42 remaining) [2024-01-30 14:22:26,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 42 remaining) [2024-01-30 14:22:26,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 42 remaining) [2024-01-30 14:22:26,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 42 remaining) [2024-01-30 14:22:26,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 42 remaining) [2024-01-30 14:22:26,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 42 remaining) [2024-01-30 14:22:26,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 42 remaining) [2024-01-30 14:22:26,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:22:26,438 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2024-01-30 14:22:26,443 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:22:26,443 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:22:26,462 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-30 14:22:26,469 INFO L503 ceAbstractionStarter]: Automizer considered 29 witness invariants [2024-01-30 14:22:26,470 INFO L504 ceAbstractionStarter]: WitnessConsidered=29 [2024-01-30 14:22:26,471 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:22:26 BasicIcfg [2024-01-30 14:22:26,471 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:22:26,471 INFO L158 Benchmark]: Toolchain (without parser) took 5820.60ms. Allocated memory was 201.3MB in the beginning and 325.1MB in the end (delta: 123.7MB). Free memory was 164.5MB in the beginning and 217.1MB in the end (delta: -52.6MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2024-01-30 14:22:26,471 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:22:26,472 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:22:26,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1034.26ms. Allocated memory is still 201.3MB. Free memory was 164.5MB in the beginning and 95.1MB in the end (delta: 69.3MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-01-30 14:22:26,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 162.26ms. Allocated memory is still 201.3MB. Free memory was 95.1MB in the beginning and 85.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-01-30 14:22:26,479 INFO L158 Benchmark]: Boogie Preprocessor took 174.21ms. Allocated memory is still 201.3MB. Free memory was 85.7MB in the beginning and 160.1MB in the end (delta: -74.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-30 14:22:26,479 INFO L158 Benchmark]: RCFGBuilder took 759.54ms. Allocated memory is still 201.3MB. Free memory was 160.1MB in the beginning and 72.0MB in the end (delta: 88.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-01-30 14:22:26,480 INFO L158 Benchmark]: TraceAbstraction took 3685.56ms. Allocated memory was 201.3MB in the beginning and 325.1MB in the end (delta: 123.7MB). Free memory was 71.0MB in the beginning and 217.1MB in the end (delta: -146.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:22:26,481 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1034.26ms. Allocated memory is still 201.3MB. Free memory was 164.5MB in the beginning and 95.1MB in the end (delta: 69.3MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 162.26ms. Allocated memory is still 201.3MB. Free memory was 95.1MB in the beginning and 85.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 174.21ms. Allocated memory is still 201.3MB. Free memory was 85.7MB in the beginning and 160.1MB in the end (delta: -74.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 759.54ms. Allocated memory is still 201.3MB. Free memory was 160.1MB in the beginning and 72.0MB in the end (delta: 88.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3685.56ms. Allocated memory was 201.3MB in the beginning and 325.1MB in the end (delta: 123.7MB). Free memory was 71.0MB in the beginning and 217.1MB in the end (delta: -146.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 950]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L935-L938] struct cache_entry { int refs; pthread_mutex_t refs_mutex; } cache[10]; [L935-L938] struct cache_entry { int refs; pthread_mutex_t refs_mutex; } cache[10]; [L950] int i = 0; VAL [__global_lock={3:0}, cache={4:0}, i=0] [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=0] [L950] COND TRUE i < 10 [L950] i++ VAL [__global_lock={3:0}, cache={4:0}, i=1] [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=1] [L950] COND TRUE i < 10 [L950] i++ VAL [__global_lock={3:0}, cache={4:0}, i=2] [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=2] [L950] COND TRUE i < 10 [L950] i++ VAL [__global_lock={3:0}, cache={4:0}, i=3] [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=3] [L950] COND TRUE i < 10 [L950] i++ VAL [__global_lock={3:0}, cache={4:0}, i=4] [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=4] [L950] COND TRUE i < 10 [L950] i++ VAL [__global_lock={3:0}, cache={4:0}, i=5] [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=5] [L950] COND TRUE i < 10 [L950] i++ VAL [__global_lock={3:0}, cache={4:0}, i=6] [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=6] [L950] COND TRUE i < 10 [L950] i++ VAL [__global_lock={3:0}, cache={4:0}, i=7] [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=7] [L950] COND TRUE i < 10 [L950] i++ VAL [__global_lock={3:0}, cache={4:0}, i=8] [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=8] [L950] COND TRUE i < 10 [L950] i++ VAL [__global_lock={3:0}, cache={4:0}, i=9] [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=9] [L950] COND TRUE i < 10 [L950] i++ VAL [__global_lock={3:0}, cache={4:0}, i=10] [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=10] [L950] COND FALSE !(i < 10) [L950] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=281] - UnprovableResult [Line: 950]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 950]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 953]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 953]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 954]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 954]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 955]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 956]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 956]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 942]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 957]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 954]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 929]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 958]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 956]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 958]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 929]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 959]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 958]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 953]: 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: 946]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 946]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 947]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 942]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 946]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 929]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 203 locations, 42 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.5s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 783 IncrementalHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 12 mSDtfsCounter, 783 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=0, InterpolantAutomatonStates: 34, 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.8s InterpolantComputationTime, 102 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 321 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 12/96 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-30 14:22:26,508 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