./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 3d25acf6 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_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-3d25acf-m [2024-01-30 14:22:19,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:22:19,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:22:19,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:22:19,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:22:19,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:22:19,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:22:19,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:22:19,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:22:19,188 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:22:19,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:22:19,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:22:19,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:22:19,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:22:19,190 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:22:19,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:22:19,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:22:19,191 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:22:19,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:22:19,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:22:19,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:22:19,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:22:19,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:22:19,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:22:19,193 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:22:19,193 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:22:19,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:22:19,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:22:19,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:22:19,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:22:19,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:22:19,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:22:19,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:22:19,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:22:19,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:22:19,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:22:19,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:22:19,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:22:19,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:22:19,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:22:19,196 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:22:19,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:22:19,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:22:19,197 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-30 14:22:19,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:22:19,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:22:19,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:22:19,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:22:19,486 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:22:19,487 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-01-30 14:22:20,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:22:20,760 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:22:20,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-01-30 14:22:20,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40f041cc/417eaedd0a9c408ea4a22f6b428b984f/FLAGffc9a4ba3 [2024-01-30 14:22:20,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40f041cc/417eaedd0a9c408ea4a22f6b428b984f [2024-01-30 14:22:20,808 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:22:20,809 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:22:20,809 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-01-30 14:22:20,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:22:20,915 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:22:20,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:22:20,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:22:20,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:22:20,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:22:20" (1/2) ... [2024-01-30 14:22:20,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a349b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:22:20, skipping insertion in model container [2024-01-30 14:22:20,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:22:20" (1/2) ... [2024-01-30 14:22:20,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@33cff79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:22:20, skipping insertion in model container [2024-01-30 14:22:20,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:20" (2/2) ... [2024-01-30 14:22:20,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a349b4a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:20, skipping insertion in model container [2024-01-30 14:22:20,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:20" (2/2) ... [2024-01-30 14:22:20,924 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:22:20,978 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:22:20,980 INFO L98 nessWitnessExtractor]: Location invariant before [L942-L942] ((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9] [2024-01-30 14:22:20,980 INFO L98 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-01-30 14:22:20,980 INFO L98 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-01-30 14:22:20,980 INFO L98 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-01-30 14:22:20,980 INFO L98 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-01-30 14:22:20,981 INFO L98 nessWitnessExtractor]: Location invariant before [L958-L958] (((i == 10) && (i == 10)) && (i == 10000)) && (i == 10000) [2024-01-30 14:22:20,981 INFO L98 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-01-30 14:22:20,981 INFO L98 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-01-30 14:22:20,981 INFO L98 nessWitnessExtractor]: Loop invariant at [L941-L941] (((((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) [2024-01-30 14:22:20,982 INFO L98 nessWitnessExtractor]: Location invariant before [L941-L941] (((((((((((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) [2024-01-30 14:22:20,982 INFO L98 nessWitnessExtractor]: Loop invariant at [L946-L947] (unsigned long )arg == 0UL [2024-01-30 14:22:20,982 INFO L98 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-01-30 14:22:20,982 INFO L98 nessWitnessExtractor]: Location invariant before [L948-L948] (i == 10) && ((unsigned long )arg == 0UL) [2024-01-30 14:22:20,982 INFO L98 nessWitnessExtractor]: Loop invariant at [L955-L956] (i == 10) && (i == 10000) [2024-01-30 14:22:20,982 INFO L98 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-01-30 14:22:20,982 INFO L98 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-01-30 14:22:20,983 INFO L98 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-01-30 14:22:21,021 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:22:21,366 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-01-30 14:22:21,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:22:21,411 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:22:21,448 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-01-30 14:22:21,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:22:21,803 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:22:21,804 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21 WrapperNode [2024-01-30 14:22:21,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:22:21,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:22:21,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:22:21,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:22:21,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,902 INFO L138 Inliner]: procedures = 272, calls = 35, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 242 [2024-01-30 14:22:21,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:22:21,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:22:21,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:22:21,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:22:21,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,951 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-01-30 14:22:21,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:21,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:22,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:22,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:22,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:22,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:22:22,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:22:22,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:22:22,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:22:22,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (1/1) ... [2024-01-30 14:22:22,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:22:22,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:22,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-30 14:22:22,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-30 14:22:22,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:22:22,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:22:22,123 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-30 14:22:22,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:22:22,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:22:22,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:22:22,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:22:22,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:22:22,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:22:22,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:22:22,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:22:22,124 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-30 14:22:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:22:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-30 14:22:22,125 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-30 14:22:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:22:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:22:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:22:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:22:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:22:22,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:22:22,127 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:22:22,240 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:22:22,241 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:22:22,653 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:22:22,653 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:22:22,779 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:22:22,779 INFO L320 CfgBuilder]: Removed 25 assume(true) statements. [2024-01-30 14:22:22,781 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:22:22 BoogieIcfgContainer [2024-01-30 14:22:22,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:22:22,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:22:22,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:22:22,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:22:22,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:22:20" (1/4) ... [2024-01-30 14:22:22,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7e4b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:22:22, skipping insertion in model container [2024-01-30 14:22:22,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:20" (2/4) ... [2024-01-30 14:22:22,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7e4b29 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:22:22, skipping insertion in model container [2024-01-30 14:22:22,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:21" (3/4) ... [2024-01-30 14:22:22,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7e4b29 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:22:22, skipping insertion in model container [2024-01-30 14:22:22,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:22:22" (4/4) ... [2024-01-30 14:22:22,789 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2024-01-30 14:22:22,803 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:22:22,804 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-01-30 14:22:22,804 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:22:22,873 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-30 14:22:22,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 145 transitions, 297 flow [2024-01-30 14:22:22,973 INFO L124 PetriNetUnfolderBase]: 41/211 cut-off events. [2024-01-30 14:22:22,973 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-30 14:22:22,978 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-01-30 14:22:22,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 145 transitions, 297 flow [2024-01-30 14:22:22,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 145 transitions, 297 flow [2024-01-30 14:22:22,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:22:23,004 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;@c366692, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:22:23,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-01-30 14:22:23,009 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:22:23,009 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:22:23,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:22:23,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:23,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:22:23,010 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-01-30 14:22:23,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash 19832, now seen corresponding path program 1 times [2024-01-30 14:22:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:23,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358661270] [2024-01-30 14:22:23,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:23,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:23,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358661270] [2024-01-30 14:22:23,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358661270] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:23,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:23,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:22:23,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471201706] [2024-01-30 14:22:23,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:23,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:23,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:23,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:23,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 145 [2024-01-30 14:22:23,250 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-01-30 14:22:23,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:23,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 145 [2024-01-30 14:22:23,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:23,365 INFO L124 PetriNetUnfolderBase]: 72/265 cut-off events. [2024-01-30 14:22:23,367 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:22:23,367 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-01-30 14:22:23,370 INFO L140 encePairwiseOnDemand]: 129/145 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-01-30 14:22:23,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 198 flow [2024-01-30 14:22:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2024-01-30 14:22:23,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-01-30 14:22:23,385 INFO L175 Difference]: Start difference. First operand has 120 places, 145 transitions, 297 flow. Second operand 3 states and 232 transitions. [2024-01-30 14:22:23,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 198 flow [2024-01-30 14:22:23,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-30 14:22:23,391 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 144 flow [2024-01-30 14:22:23,392 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-01-30 14:22:23,395 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -53 predicate places. [2024-01-30 14:22:23,395 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 144 flow [2024-01-30 14:22:23,396 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-01-30 14:22:23,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:23,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:22:23,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:22:23,396 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-01-30 14:22:23,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash 19078746, now seen corresponding path program 1 times [2024-01-30 14:22:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:23,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376110824] [2024-01-30 14:22:23,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:23,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:23,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376110824] [2024-01-30 14:22:23,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376110824] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:23,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:23,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:23,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56276864] [2024-01-30 14:22:23,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:23,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:23,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:23,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:23,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:23,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 145 [2024-01-30 14:22:23,536 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-01-30 14:22:23,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:23,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 145 [2024-01-30 14:22:23,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:23,609 INFO L124 PetriNetUnfolderBase]: 72/267 cut-off events. [2024-01-30 14:22:23,613 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-30 14:22:23,616 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-01-30 14:22:23,617 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 30 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-01-30 14:22:23,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 214 flow [2024-01-30 14:22:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2024-01-30 14:22:23,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879310344827586 [2024-01-30 14:22:23,619 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 144 flow. Second operand 4 states and 283 transitions. [2024-01-30 14:22:23,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 214 flow [2024-01-30 14:22:23,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:22:23,621 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 160 flow [2024-01-30 14:22:23,622 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-01-30 14:22:23,622 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -50 predicate places. [2024-01-30 14:22:23,622 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 160 flow [2024-01-30 14:22:23,623 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-01-30 14:22:23,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:23,623 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-01-30 14:22:23,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:22:23,623 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-01-30 14:22:23,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:23,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1154825916, now seen corresponding path program 1 times [2024-01-30 14:22:23,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:23,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401865521] [2024-01-30 14:22:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:23,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401865521] [2024-01-30 14:22:23,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401865521] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:22:23,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452397772] [2024-01-30 14:22:23,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:23,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:23,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:23,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:22:23,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-30 14:22:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:23,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-30 14:22:23,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:22:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:23,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:22:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:23,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452397772] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:22:23,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:22:23,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-01-30 14:22:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926579929] [2024-01-30 14:22:23,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:22:23,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:22:23,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:23,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:22:23,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:22:23,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 145 [2024-01-30 14:22:23,891 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-01-30 14:22:23,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:23,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 145 [2024-01-30 14:22:23,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:23,982 INFO L124 PetriNetUnfolderBase]: 72/269 cut-off events. [2024-01-30 14:22:23,982 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-01-30 14:22:23,982 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-01-30 14:22:23,983 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 30 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-01-30 14:22:23,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 234 flow [2024-01-30 14:22:23,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2024-01-30 14:22:23,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772413793103448 [2024-01-30 14:22:23,985 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 160 flow. Second operand 5 states and 346 transitions. [2024-01-30 14:22:23,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 234 flow [2024-01-30 14:22:23,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:23,987 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 176 flow [2024-01-30 14:22:23,987 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-01-30 14:22:23,988 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -47 predicate places. [2024-01-30 14:22:23,988 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 176 flow [2024-01-30 14:22:23,988 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-01-30 14:22:23,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:23,989 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1] [2024-01-30 14:22:24,022 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-01-30 14:22:24,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:24,199 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-01-30 14:22:24,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1686163102, now seen corresponding path program 2 times [2024-01-30 14:22:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:24,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732871853] [2024-01-30 14:22:24,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:24,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:24,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:24,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732871853] [2024-01-30 14:22:24,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732871853] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:22:24,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599442208] [2024-01-30 14:22:24,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-30 14:22:24,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:24,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:24,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:22:24,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-30 14:22:24,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-30 14:22:24,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:22:24,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-30 14:22:24,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:22:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:24,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:22:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:24,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599442208] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:22:24,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:22:24,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-01-30 14:22:24,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347057051] [2024-01-30 14:22:24,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:22:24,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-30 14:22:24,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:24,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-30 14:22:24,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-30 14:22:24,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 145 [2024-01-30 14:22:24,447 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-01-30 14:22:24,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:24,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 145 [2024-01-30 14:22:24,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:24,536 INFO L124 PetriNetUnfolderBase]: 72/271 cut-off events. [2024-01-30 14:22:24,536 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-01-30 14:22:24,537 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-01-30 14:22:24,538 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 30 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2024-01-30 14:22:24,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 68 transitions, 254 flow [2024-01-30 14:22:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-30 14:22:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-30 14:22:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2024-01-30 14:22:24,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47011494252873565 [2024-01-30 14:22:24,543 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 176 flow. Second operand 6 states and 409 transitions. [2024-01-30 14:22:24,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 68 transitions, 254 flow [2024-01-30 14:22:24,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 244 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-30 14:22:24,547 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 192 flow [2024-01-30 14:22:24,547 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-01-30 14:22:24,549 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -44 predicate places. [2024-01-30 14:22:24,549 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 192 flow [2024-01-30 14:22:24,549 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-01-30 14:22:24,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:24,549 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1] [2024-01-30 14:22:24,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-30 14:22:24,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-01-30 14:22:24,761 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-01-30 14:22:24,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1200090624, now seen corresponding path program 3 times [2024-01-30 14:22:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374742764] [2024-01-30 14:22:24,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:24,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:24,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:24,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374742764] [2024-01-30 14:22:24,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374742764] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:22:24,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698936611] [2024-01-30 14:22:24,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-30 14:22:24,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:24,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:24,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:22:24,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-30 14:22:24,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-30 14:22:24,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:22:24,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2024-01-30 14:22:24,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:22:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-30 14:22:25,091 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-30 14:22:25,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698936611] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:25,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-30 14:22:25,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2024-01-30 14:22:25,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437419613] [2024-01-30 14:22:25,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:25,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:25,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:25,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-01-30 14:22:25,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 145 [2024-01-30 14:22:25,099 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-01-30 14:22:25,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:25,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 145 [2024-01-30 14:22:25,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:25,154 INFO L124 PetriNetUnfolderBase]: 72/270 cut-off events. [2024-01-30 14:22:25,155 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-01-30 14:22:25,155 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-01-30 14:22:25,156 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 32 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-01-30 14:22:25,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 67 transitions, 256 flow [2024-01-30 14:22:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2024-01-30 14:22:25,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724137931034483 [2024-01-30 14:22:25,179 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 192 flow. Second operand 4 states and 274 transitions. [2024-01-30 14:22:25,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 67 transitions, 256 flow [2024-01-30 14:22:25,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 242 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-01-30 14:22:25,181 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 178 flow [2024-01-30 14:22:25,181 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-01-30 14:22:25,182 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -46 predicate places. [2024-01-30 14:22:25,182 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 178 flow [2024-01-30 14:22:25,182 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-01-30 14:22:25,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:25,183 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1] [2024-01-30 14:22:25,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-30 14:22:25,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:25,394 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-01-30 14:22:25,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:25,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2059092765, now seen corresponding path program 1 times [2024-01-30 14:22:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:25,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477752008] [2024-01-30 14:22:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:25,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:25,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477752008] [2024-01-30 14:22:25,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477752008] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:22:25,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845527089] [2024-01-30 14:22:25,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:25,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:25,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:25,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:22:25,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-30 14:22:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:25,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-30 14:22:25,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:22:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:25,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:22:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:25,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845527089] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:22:25,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:22:25,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-01-30 14:22:25,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779713674] [2024-01-30 14:22:25,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:22:25,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-30 14:22:25,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:25,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-30 14:22:25,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-01-30 14:22:25,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 145 [2024-01-30 14:22:25,612 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-01-30 14:22:25,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:25,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 145 [2024-01-30 14:22:25,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:25,690 INFO L124 PetriNetUnfolderBase]: 72/282 cut-off events. [2024-01-30 14:22:25,690 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-01-30 14:22:25,691 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-01-30 14:22:25,692 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 39 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2024-01-30 14:22:25,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 358 flow [2024-01-30 14:22:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-30 14:22:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-30 14:22:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 777 transitions. [2024-01-30 14:22:25,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44655172413793104 [2024-01-30 14:22:25,694 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 178 flow. Second operand 12 states and 777 transitions. [2024-01-30 14:22:25,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 358 flow [2024-01-30 14:22:25,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:25,696 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 283 flow [2024-01-30 14:22:25,712 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-01-30 14:22:25,713 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -31 predicate places. [2024-01-30 14:22:25,713 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 283 flow [2024-01-30 14:22:25,714 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-01-30 14:22:25,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:25,714 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 1, 1, 1, 1] [2024-01-30 14:22:25,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-30 14:22:25,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:25,945 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-01-30 14:22:25,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:25,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1738540113, now seen corresponding path program 2 times [2024-01-30 14:22:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:25,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530950455] [2024-01-30 14:22:25,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:25,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:22:25,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:22:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:22:25,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:22:25,992 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:22:25,992 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 36 remaining) [2024-01-30 14:22:25,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 36 remaining) [2024-01-30 14:22:25,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 36 remaining) [2024-01-30 14:22:25,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 36 remaining) [2024-01-30 14:22:25,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 36 remaining) [2024-01-30 14:22:25,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 36 remaining) [2024-01-30 14:22:25,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 36 remaining) [2024-01-30 14:22:25,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 36 remaining) [2024-01-30 14:22:25,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 36 remaining) [2024-01-30 14:22:25,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 36 remaining) [2024-01-30 14:22:25,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 36 remaining) [2024-01-30 14:22:25,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 36 remaining) [2024-01-30 14:22:25,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 36 remaining) [2024-01-30 14:22:25,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 36 remaining) [2024-01-30 14:22:25,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 36 remaining) [2024-01-30 14:22:25,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 36 remaining) [2024-01-30 14:22:25,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (19 of 36 remaining) [2024-01-30 14:22:25,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 36 remaining) [2024-01-30 14:22:25,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 36 remaining) [2024-01-30 14:22:25,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 36 remaining) [2024-01-30 14:22:25,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 36 remaining) [2024-01-30 14:22:25,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 36 remaining) [2024-01-30 14:22:25,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 36 remaining) [2024-01-30 14:22:25,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 36 remaining) [2024-01-30 14:22:25,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 36 remaining) [2024-01-30 14:22:25,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 36 remaining) [2024-01-30 14:22:25,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 36 remaining) [2024-01-30 14:22:25,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 36 remaining) [2024-01-30 14:22:25,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 36 remaining) [2024-01-30 14:22:25,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 36 remaining) [2024-01-30 14:22:25,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 36 remaining) [2024-01-30 14:22:25,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 36 remaining) [2024-01-30 14:22:25,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 36 remaining) [2024-01-30 14:22:25,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 36 remaining) [2024-01-30 14:22:25,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 36 remaining) [2024-01-30 14:22:26,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 36 remaining) [2024-01-30 14:22:26,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:22:26,000 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2024-01-30 14:22:26,005 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:22:26,005 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:22:26,018 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-30 14:22:26,024 INFO L503 ceAbstractionStarter]: Automizer considered 24 witness invariants [2024-01-30 14:22:26,024 INFO L504 ceAbstractionStarter]: WitnessConsidered=24 [2024-01-30 14:22:26,025 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:22:26 BasicIcfg [2024-01-30 14:22:26,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:22:26,025 INFO L158 Benchmark]: Toolchain (without parser) took 5110.34ms. Allocated memory was 151.0MB in the beginning and 276.8MB in the end (delta: 125.8MB). Free memory was 108.9MB in the beginning and 163.3MB in the end (delta: -54.4MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-01-30 14:22:26,026 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:22:26,026 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:22:26,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 888.37ms. Allocated memory is still 151.0MB. Free memory was 108.9MB in the beginning and 57.9MB in the end (delta: 51.0MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-01-30 14:22:26,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.12ms. Allocated memory is still 151.0MB. Free memory was 57.9MB in the beginning and 114.0MB in the end (delta: -56.1MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-01-30 14:22:26,026 INFO L158 Benchmark]: Boogie Preprocessor took 120.07ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 114.0MB in the beginning and 157.4MB in the end (delta: -43.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-30 14:22:26,027 INFO L158 Benchmark]: RCFGBuilder took 756.91ms. Allocated memory is still 197.1MB. Free memory was 157.4MB in the beginning and 147.8MB in the end (delta: 9.6MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. [2024-01-30 14:22:26,027 INFO L158 Benchmark]: TraceAbstraction took 3241.74ms. Allocated memory was 197.1MB in the beginning and 276.8MB in the end (delta: 79.7MB). Free memory was 146.8MB in the beginning and 163.3MB in the end (delta: -16.5MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2024-01-30 14:22:26,028 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 888.37ms. Allocated memory is still 151.0MB. Free memory was 108.9MB in the beginning and 57.9MB in the end (delta: 51.0MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.12ms. Allocated memory is still 151.0MB. Free memory was 57.9MB in the beginning and 114.0MB in the end (delta: -56.1MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.07ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 114.0MB in the beginning and 157.4MB in the end (delta: -43.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 756.91ms. Allocated memory is still 197.1MB. Free memory was 157.4MB in the beginning and 147.8MB in the end (delta: 9.6MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3241.74ms. Allocated memory was 197.1MB in the beginning and 276.8MB in the end (delta: 79.7MB). Free memory was 146.8MB in the beginning and 163.3MB in the end (delta: -16.5MB). Peak memory consumption was 63.2MB. 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: 3.1s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.4s 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.2s 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.2s 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-01-30 14:22:26,055 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