./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_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_70-funloop_racefree.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 59af5db6 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_70-funloop_racefree.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/28-race_reach_70-funloop_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-59af5db-m [2024-02-02 09:18:27,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:18:27,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:18:27,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:18:27,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:18:27,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:18:27,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:18:27,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:18:27,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:18:27,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:18:27,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:18:27,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:18:27,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:18:27,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:18:27,499 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:18:27,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:18:27,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:18:27,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:18:27,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:18:27,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:18:27,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:18:27,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:18:27,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:18:27,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:18:27,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:18:27,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:18:27,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:18:27,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:18:27,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:18:27,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:18:27,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:18:27,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:18:27,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:18:27,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:18:27,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:18:27,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:18:27,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:18:27,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:18:27,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:18:27,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:18:27,521 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:18:27,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:18:27,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:18:27,522 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-02-02 09:18:27,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:18:27,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:18:27,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:18:27,737 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:18:27,737 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:18:27,738 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_70-funloop_racefree.yml/witness.yml [2024-02-02 09:18:27,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:18:27,824 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:18:27,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-02-02 09:18:29,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:18:29,248 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:18:29,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-02-02 09:18:29,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9a4b448/7bd8eede3ad947f7aafbd85b3a302252/FLAG0d637382d [2024-02-02 09:18:29,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9a4b448/7bd8eede3ad947f7aafbd85b3a302252 [2024-02-02 09:18:29,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:18:29,292 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:18:29,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:18:29,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:18:29,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:18:29,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:18:27" (1/2) ... [2024-02-02 09:18:29,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56380103 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:18:29, skipping insertion in model container [2024-02-02 09:18:29,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:18:27" (1/2) ... [2024-02-02 09:18:29,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6a5fcee4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:18:29, skipping insertion in model container [2024-02-02 09:18:29,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:18:29" (2/2) ... [2024-02-02 09:18:29,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56380103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:29, skipping insertion in model container [2024-02-02 09:18:29,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:18:29" (2/2) ... [2024-02-02 09:18:29,301 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:18:29,376 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:18:29,377 INFO L101 nessWitnessExtractor]: Location invariant before [L948-L948] (i == 10) && ((unsigned long )arg == 0UL) [2024-02-02 09:18:29,377 INFO L101 nessWitnessExtractor]: Location invariant before [L954-L954] (i == 10) && (((((((((((((((((((((((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || (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) [2024-02-02 09:18:29,378 INFO L101 nessWitnessExtractor]: Loop invariant at [L954-L954] (i == 10) && (((((((((((((((((((((((((i == 4 || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || (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) [2024-02-02 09:18:29,378 INFO L101 nessWitnessExtractor]: Location invariant after [L955-L956] ((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-02-02 09:18:29,378 INFO L101 nessWitnessExtractor]: Loop invariant at [L955-L956] (i == 10) && (i == 10000) [2024-02-02 09:18:29,378 INFO L101 nessWitnessExtractor]: Loop invariant at [L946-L947] (unsigned long )arg == 0UL [2024-02-02 09:18:29,378 INFO L101 nessWitnessExtractor]: Location invariant after [L946-L947] ((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-02-02 09:18:29,378 INFO L101 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-02-02 09:18:29,378 INFO L101 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-02-02 09:18:29,379 INFO L101 nessWitnessExtractor]: Location invariant before [L957-L957] (((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-02-02 09:18:29,379 INFO L101 nessWitnessExtractor]: Loop invariant at [L957-L957] (((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-02-02 09:18:29,379 INFO L101 nessWitnessExtractor]: Loop invariant at [L954-L954] (i == 10) && (((((((((((((((((((((((((i == 4 || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || (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) [2024-02-02 09:18:29,379 INFO L101 nessWitnessExtractor]: Location invariant before [L954-L954] (i == 10) && (((((((((((((((((((((((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || (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) [2024-02-02 09:18:29,379 INFO L101 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-02-02 09:18:29,379 INFO L101 nessWitnessExtractor]: Location invariant before [L958-L958] (((i == 10) && (i == 10)) && (i == 10000)) && (i == 10000) [2024-02-02 09:18:29,379 INFO L101 nessWitnessExtractor]: Location invariant after [L951-L952] ((((((((i == 9 || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0) [2024-02-02 09:18:29,380 INFO L101 nessWitnessExtractor]: Loop invariant at [L951-L952] (((((((((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-02-02 09:18:29,422 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:18:29,776 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_70-funloop_racefree.i[41323,41336] [2024-02-02 09:18:29,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:18:29,814 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:18:29,857 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_70-funloop_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 [2024-02-02 09:18:30,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:18:30,280 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:18:30,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30 WrapperNode [2024-02-02 09:18:30,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:18:30,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:18:30,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:18:30,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:18:30,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,387 INFO L138 Inliner]: procedures = 272, calls = 35, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 242 [2024-02-02 09:18:30,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:18:30,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:18:30,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:18:30,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:18:30,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,464 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 5, 11, 2]. 55 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 6 writes are split as follows [0, 0, 5, 1]. [2024-02-02 09:18:30,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:18:30,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:18:30,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:18:30,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:18:30,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (1/1) ... [2024-02-02 09:18:30,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:18:30,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:18:30,573 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-02-02 09:18:30,582 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-02-02 09:18:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:18:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:18:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-02 09:18:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:18:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:18:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:18:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:18:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:18:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:18:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:18:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:18:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-02 09:18:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:18:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-02-02 09:18:30,610 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-02-02 09:18:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:18:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:18:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:18:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:18:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:18:30,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:18:30,612 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:18:30,760 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:18:30,761 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:18:31,217 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:18:31,218 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:18:31,306 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:18:31,306 INFO L320 CfgBuilder]: Removed 25 assume(true) statements. [2024-02-02 09:18:31,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:18:31 BoogieIcfgContainer [2024-02-02 09:18:31,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:18:31,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:18:31,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:18:31,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:18:31,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:18:27" (1/4) ... [2024-02-02 09:18:31,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704e869 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:18:31, skipping insertion in model container [2024-02-02 09:18:31,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:18:29" (2/4) ... [2024-02-02 09:18:31,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704e869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:18:31, skipping insertion in model container [2024-02-02 09:18:31,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:18:30" (3/4) ... [2024-02-02 09:18:31,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704e869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:18:31, skipping insertion in model container [2024-02-02 09:18:31,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:18:31" (4/4) ... [2024-02-02 09:18:31,314 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2024-02-02 09:18:31,328 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:18:31,328 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-02-02 09:18:31,329 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:18:31,394 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-02-02 09:18:31,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 145 transitions, 297 flow [2024-02-02 09:18:31,469 INFO L124 PetriNetUnfolderBase]: 41/211 cut-off events. [2024-02-02 09:18:31,469 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-02 09:18:31,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 211 events. 41/211 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 937 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 126. Up to 8 conditions per place. [2024-02-02 09:18:31,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 145 transitions, 297 flow [2024-02-02 09:18:31,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 145 transitions, 297 flow [2024-02-02 09:18:31,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:18:31,492 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;@139e7f5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:18:31,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-02-02 09:18:31,494 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:18:31,494 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:18:31,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:18:31,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:18:31,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:18:31,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:18:31,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:18:31,499 INFO L85 PathProgramCache]: Analyzing trace with hash 19832, now seen corresponding path program 1 times [2024-02-02 09:18:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:18:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991513031] [2024-02-02 09:18:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:18:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:18:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:18:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:31,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:18:31,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991513031] [2024-02-02 09:18:31,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991513031] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:18:31,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:18:31,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:18:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844952956] [2024-02-02 09:18:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:18:31,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:18:31,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:18:31,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:18:31,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:18:31,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 145 [2024-02-02 09:18:31,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 145 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-02-02 09:18:31,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:18:31,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 145 [2024-02-02 09:18:31,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:18:31,737 INFO L124 PetriNetUnfolderBase]: 72/265 cut-off events. [2024-02-02 09:18:31,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:18:31,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 265 events. 72/265 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1021 event pairs, 60 based on Foata normal form. 51/256 useless extension candidates. Maximal degree in co-relation 392. Up to 160 conditions per place. [2024-02-02 09:18:31,740 INFO L140 encePairwiseOnDemand]: 129/145 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-02-02 09:18:31,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 198 flow [2024-02-02 09:18:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:18:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:18:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2024-02-02 09:18:31,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-02-02 09:18:31,751 INFO L175 Difference]: Start difference. First operand has 120 places, 145 transitions, 297 flow. Second operand 3 states and 232 transitions. [2024-02-02 09:18:31,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 198 flow [2024-02-02 09:18:31,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-02 09:18:31,756 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 144 flow [2024-02-02 09:18:31,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, 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-02-02 09:18:31,760 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -53 predicate places. [2024-02-02 09:18:31,760 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 144 flow [2024-02-02 09:18:31,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-02-02 09:18:31,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:18:31,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-02 09:18:31,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:18:31,775 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:18:31,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:18:31,775 INFO L85 PathProgramCache]: Analyzing trace with hash 19078746, now seen corresponding path program 1 times [2024-02-02 09:18:31,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:18:31,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825373167] [2024-02-02 09:18:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:18:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:18:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:18:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:31,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:18:31,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825373167] [2024-02-02 09:18:31,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825373167] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:18:31,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:18:31,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:18:31,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423041320] [2024-02-02 09:18:31,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:18:31,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:18:31,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:18:31,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:18:31,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:18:31,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 145 [2024-02-02 09:18:31,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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-02-02 09:18:31,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:18:31,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 145 [2024-02-02 09:18:31,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:18:32,002 INFO L124 PetriNetUnfolderBase]: 72/267 cut-off events. [2024-02-02 09:18:32,006 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-02 09:18:32,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 267 events. 72/267 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1021 event pairs, 60 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 428. Up to 160 conditions per place. [2024-02-02 09:18:32,008 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 30 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-02-02 09:18:32,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 214 flow [2024-02-02 09:18:32,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:18:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:18:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2024-02-02 09:18:32,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879310344827586 [2024-02-02 09:18:32,015 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 144 flow. Second operand 4 states and 283 transitions. [2024-02-02 09:18:32,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 214 flow [2024-02-02 09:18:32,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:18:32,017 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 160 flow [2024-02-02 09:18:32,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, 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-02-02 09:18:32,018 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -50 predicate places. [2024-02-02 09:18:32,018 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 160 flow [2024-02-02 09:18:32,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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-02-02 09:18:32,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:18:32,018 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-02-02 09:18:32,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:18:32,019 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:18:32,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:18:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1154825916, now seen corresponding path program 1 times [2024-02-02 09:18:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:18:32,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217080947] [2024-02-02 09:18:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:18:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:18:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:18:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:32,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:18:32,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217080947] [2024-02-02 09:18:32,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217080947] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-02 09:18:32,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850935133] [2024-02-02 09:18:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:18:32,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-02 09:18:32,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:18:32,136 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-02-02 09:18:32,138 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-02-02 09:18:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:18:32,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-02 09:18:32,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-02 09:18:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:32,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-02 09:18:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:32,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850935133] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-02 09:18:32,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-02 09:18:32,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-02-02 09:18:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567014536] [2024-02-02 09:18:32,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-02 09:18:32,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:18:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:18:32,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:18:32,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:18:32,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 145 [2024-02-02 09:18:32,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 62.8) internal successors, (314), 5 states have internal predecessors, (314), 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-02-02 09:18:32,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:18:32,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 145 [2024-02-02 09:18:32,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:18:32,380 INFO L124 PetriNetUnfolderBase]: 72/269 cut-off events. [2024-02-02 09:18:32,380 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-02-02 09:18:32,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 269 events. 72/269 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1022 event pairs, 60 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 432. Up to 160 conditions per place. [2024-02-02 09:18:32,384 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 30 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-02-02 09:18:32,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 234 flow [2024-02-02 09:18:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:18:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:18:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2024-02-02 09:18:32,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772413793103448 [2024-02-02 09:18:32,387 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 160 flow. Second operand 5 states and 346 transitions. [2024-02-02 09:18:32,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 234 flow [2024-02-02 09:18:32,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-02 09:18:32,390 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 176 flow [2024-02-02 09:18:32,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, 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-02-02 09:18:32,392 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -47 predicate places. [2024-02-02 09:18:32,392 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 176 flow [2024-02-02 09:18:32,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.8) internal successors, (314), 5 states have internal predecessors, (314), 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-02-02 09:18:32,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:18:32,392 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1] [2024-02-02 09:18:32,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-02 09:18:32,604 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-02-02 09:18:32,605 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:18:32,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:18:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1686163102, now seen corresponding path program 2 times [2024-02-02 09:18:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:18:32,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607149943] [2024-02-02 09:18:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:18:32,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:18:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:18:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:18:32,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607149943] [2024-02-02 09:18:32,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607149943] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-02 09:18:32,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080385002] [2024-02-02 09:18:32,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-02 09:18:32,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-02 09:18:32,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:18:32,670 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-02-02 09:18:32,695 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-02-02 09:18:32,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-02 09:18:32,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-02 09:18:32,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-02 09:18:32,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-02 09:18:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:32,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-02 09:18:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:32,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080385002] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-02 09:18:32,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-02 09:18:32,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-02-02 09:18:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160243381] [2024-02-02 09:18:32,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-02 09:18:32,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 09:18:32,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:18:32,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 09:18:32,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-02-02 09:18:32,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 145 [2024-02-02 09:18:32,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 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-02-02 09:18:32,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:18:32,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 145 [2024-02-02 09:18:32,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:18:32,850 INFO L124 PetriNetUnfolderBase]: 72/271 cut-off events. [2024-02-02 09:18:32,850 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-02-02 09:18:32,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 271 events. 72/271 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1017 event pairs, 60 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 436. Up to 160 conditions per place. [2024-02-02 09:18:32,852 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 30 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2024-02-02 09:18:32,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 68 transitions, 254 flow [2024-02-02 09:18:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 09:18:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 09:18:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2024-02-02 09:18:32,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47011494252873565 [2024-02-02 09:18:32,853 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 176 flow. Second operand 6 states and 409 transitions. [2024-02-02 09:18:32,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 68 transitions, 254 flow [2024-02-02 09:18:32,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 244 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-02 09:18:32,855 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 192 flow [2024-02-02 09:18:32,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, 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-02-02 09:18:32,856 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -44 predicate places. [2024-02-02 09:18:32,856 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 192 flow [2024-02-02 09:18:32,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 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-02-02 09:18:32,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:18:32,857 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1] [2024-02-02 09:18:32,882 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-02-02 09:18:33,069 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-02-02 09:18:33,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:18:33,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:18:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1200090624, now seen corresponding path program 3 times [2024-02-02 09:18:33,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:18:33,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034583819] [2024-02-02 09:18:33,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:18:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:18:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:18:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:33,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:18:33,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034583819] [2024-02-02 09:18:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034583819] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-02 09:18:33,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757934471] [2024-02-02 09:18:33,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-02 09:18:33,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-02 09:18:33,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:18:33,187 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-02-02 09:18:33,210 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-02-02 09:18:33,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-02 09:18:33,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-02 09:18:33,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-02 09:18:33,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-02 09:18:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-02 09:18:33,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-02 09:18:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757934471] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:18:33,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-02 09:18:33,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2024-02-02 09:18:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189540989] [2024-02-02 09:18:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:18:33,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:18:33,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:18:33,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:18:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-02-02 09:18:33,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 145 [2024-02-02 09:18:33,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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-02-02 09:18:33,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:18:33,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 145 [2024-02-02 09:18:33,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:18:33,438 INFO L124 PetriNetUnfolderBase]: 72/270 cut-off events. [2024-02-02 09:18:33,438 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-02-02 09:18:33,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 270 events. 72/270 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1017 event pairs, 60 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 429. Up to 156 conditions per place. [2024-02-02 09:18:33,440 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 32 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-02-02 09:18:33,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 67 transitions, 256 flow [2024-02-02 09:18:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:18:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:18:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2024-02-02 09:18:33,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724137931034483 [2024-02-02 09:18:33,441 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 192 flow. Second operand 4 states and 274 transitions. [2024-02-02 09:18:33,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 67 transitions, 256 flow [2024-02-02 09:18:33,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 242 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-02-02 09:18:33,443 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 178 flow [2024-02-02 09:18:33,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, 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-02-02 09:18:33,444 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -46 predicate places. [2024-02-02 09:18:33,444 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 178 flow [2024-02-02 09:18:33,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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-02-02 09:18:33,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:18:33,445 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1] [2024-02-02 09:18:33,459 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-02-02 09:18:33,657 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-02-02 09:18:33,657 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:18:33,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:18:33,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2059092765, now seen corresponding path program 1 times [2024-02-02 09:18:33,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:18:33,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069068243] [2024-02-02 09:18:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:18:33,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:18:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:18:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:33,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:18:33,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069068243] [2024-02-02 09:18:33,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069068243] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-02 09:18:33,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307398885] [2024-02-02 09:18:33,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:18:33,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-02 09:18:33,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:18:33,722 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-02-02 09:18:33,759 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-02-02 09:18:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:18:33,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-02 09:18:33,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-02 09:18:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:33,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-02 09:18:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:18:33,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307398885] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-02 09:18:33,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-02 09:18:33,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-02-02 09:18:33,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764798610] [2024-02-02 09:18:33,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-02 09:18:33,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-02 09:18:33,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:18:33,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-02 09:18:33,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-02-02 09:18:33,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 145 [2024-02-02 09:18:33,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 178 flow. Second operand has 13 states, 13 states have (on average 62.0) internal successors, (806), 13 states have internal predecessors, (806), 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-02-02 09:18:33,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:18:33,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 145 [2024-02-02 09:18:33,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:18:33,959 INFO L124 PetriNetUnfolderBase]: 72/282 cut-off events. [2024-02-02 09:18:33,959 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-02-02 09:18:33,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 282 events. 72/282 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1018 event pairs, 60 based on Foata normal form. 6/230 useless extension candidates. Maximal degree in co-relation 416. Up to 156 conditions per place. [2024-02-02 09:18:33,961 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 39 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2024-02-02 09:18:33,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 358 flow [2024-02-02 09:18:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-02 09:18:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-02 09:18:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 777 transitions. [2024-02-02 09:18:33,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44655172413793104 [2024-02-02 09:18:33,963 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 178 flow. Second operand 12 states and 777 transitions. [2024-02-02 09:18:33,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 358 flow [2024-02-02 09:18:33,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:18:33,965 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 283 flow [2024-02-02 09:18:33,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, 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-02-02 09:18:33,966 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -31 predicate places. [2024-02-02 09:18:33,966 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 283 flow [2024-02-02 09:18:33,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.0) internal successors, (806), 13 states have internal predecessors, (806), 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-02-02 09:18:33,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:18:33,967 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 1, 1, 1, 1] [2024-02-02 09:18:33,990 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-02-02 09:18:34,179 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-02-02 09:18:34,180 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:18:34,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:18:34,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1738540113, now seen corresponding path program 2 times [2024-02-02 09:18:34,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:18:34,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567565472] [2024-02-02 09:18:34,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:18:34,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:18:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:18:34,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:18:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:18:34,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:18:34,239 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:18:34,240 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 36 remaining) [2024-02-02 09:18:34,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 36 remaining) [2024-02-02 09:18:34,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 36 remaining) [2024-02-02 09:18:34,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 36 remaining) [2024-02-02 09:18:34,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 36 remaining) [2024-02-02 09:18:34,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 36 remaining) [2024-02-02 09:18:34,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 36 remaining) [2024-02-02 09:18:34,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 36 remaining) [2024-02-02 09:18:34,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 36 remaining) [2024-02-02 09:18:34,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 36 remaining) [2024-02-02 09:18:34,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 36 remaining) [2024-02-02 09:18:34,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 36 remaining) [2024-02-02 09:18:34,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 36 remaining) [2024-02-02 09:18:34,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 36 remaining) [2024-02-02 09:18:34,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 36 remaining) [2024-02-02 09:18:34,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 36 remaining) [2024-02-02 09:18:34,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (19 of 36 remaining) [2024-02-02 09:18:34,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 36 remaining) [2024-02-02 09:18:34,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 36 remaining) [2024-02-02 09:18:34,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 36 remaining) [2024-02-02 09:18:34,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 36 remaining) [2024-02-02 09:18:34,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 36 remaining) [2024-02-02 09:18:34,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 36 remaining) [2024-02-02 09:18:34,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 36 remaining) [2024-02-02 09:18:34,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 36 remaining) [2024-02-02 09:18:34,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 36 remaining) [2024-02-02 09:18:34,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 36 remaining) [2024-02-02 09:18:34,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 36 remaining) [2024-02-02 09:18:34,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 36 remaining) [2024-02-02 09:18:34,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 36 remaining) [2024-02-02 09:18:34,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 36 remaining) [2024-02-02 09:18:34,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 36 remaining) [2024-02-02 09:18:34,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 36 remaining) [2024-02-02 09:18:34,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 36 remaining) [2024-02-02 09:18:34,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 36 remaining) [2024-02-02 09:18:34,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 36 remaining) [2024-02-02 09:18:34,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:18:34,247 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2024-02-02 09:18:34,252 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:18:34,252 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:18:34,266 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-02 09:18:34,273 INFO L503 ceAbstractionStarter]: Automizer considered 24 witness invariants [2024-02-02 09:18:34,273 INFO L504 ceAbstractionStarter]: WitnessConsidered=24 [2024-02-02 09:18:34,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:18:34 BasicIcfg [2024-02-02 09:18:34,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:18:34,274 INFO L158 Benchmark]: Toolchain (without parser) took 4981.95ms. Allocated memory was 144.7MB in the beginning and 310.4MB in the end (delta: 165.7MB). Free memory was 100.0MB in the beginning and 254.4MB in the end (delta: -154.5MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-02-02 09:18:34,274 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 144.7MB. Free memory was 112.0MB in the beginning and 111.9MB in the end (delta: 87.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:18:34,275 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:18:34,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 987.74ms. Allocated memory was 144.7MB in the beginning and 222.3MB in the end (delta: 77.6MB). Free memory was 100.0MB in the beginning and 164.9MB in the end (delta: -64.9MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2024-02-02 09:18:34,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.88ms. Allocated memory is still 222.3MB. Free memory was 164.9MB in the beginning and 156.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-02-02 09:18:34,275 INFO L158 Benchmark]: Boogie Preprocessor took 136.65ms. Allocated memory is still 222.3MB. Free memory was 156.5MB in the beginning and 147.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-02-02 09:18:34,276 INFO L158 Benchmark]: RCFGBuilder took 779.92ms. Allocated memory is still 222.3MB. Free memory was 147.1MB in the beginning and 138.9MB in the end (delta: 8.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-02-02 09:18:34,276 INFO L158 Benchmark]: TraceAbstraction took 2965.66ms. Allocated memory was 222.3MB in the beginning and 310.4MB in the end (delta: 88.1MB). Free memory was 138.9MB in the beginning and 254.4MB in the end (delta: -115.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:18:34,277 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 144.7MB. Free memory was 112.0MB in the beginning and 111.9MB in the end (delta: 87.0kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 987.74ms. Allocated memory was 144.7MB in the beginning and 222.3MB in the end (delta: 77.6MB). Free memory was 100.0MB in the beginning and 164.9MB in the end (delta: -64.9MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.88ms. Allocated memory is still 222.3MB. Free memory was 164.9MB in the beginning and 156.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.65ms. Allocated memory is still 222.3MB. Free memory was 156.5MB in the beginning and 147.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 779.92ms. Allocated memory is still 222.3MB. Free memory was 147.1MB in the beginning and 138.9MB in the end (delta: 8.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2965.66ms. Allocated memory was 222.3MB in the beginning and 310.4MB in the end (delta: 88.1MB). Free memory was 138.9MB in the beginning and 254.4MB in the end (delta: -115.6MB). 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: 951]: 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]; [L951] int i = 0; VAL [__global_lock={3:0}, cache={4:0}, i=0] [L951] 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] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=1] [L951] 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] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=2] [L951] 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] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=3] [L951] 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] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=4] [L951] 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] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=5] [L951] 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] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=6] [L951] 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] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=7] [L951] 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] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=8] [L951] 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] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=9] [L951] 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] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=10] [L951] 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] [L951] COND FALSE !(i < 10) [L951] 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: 951]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 951]: 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: 955]: 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: 941]: 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: 941]: 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: 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: 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: 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: 954]: 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: 948]: 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, 165 locations, 36 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 681 IncrementalHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 13 mSDtfsCounter, 681 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=297occurred 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.7s 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-02-02 09:18:34,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE