./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c --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/popl20-more-buffer-mult2.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fced0e87 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/weaver/popl20-more-buffer-mult2.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-buffer-mult2.wvr.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-wip.fs.extract-columns-fced0e8-m [2024-01-31 16:10:49,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:10:49,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:10:49,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:10:49,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:10:50,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:10:50,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:10:50,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:10:50,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:10:50,016 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:10:50,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:10:50,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:10:50,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:10:50,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:10:50,018 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:10:50,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:10:50,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:10:50,019 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:10:50,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:10:50,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:10:50,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:10:50,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:10:50,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:10:50,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:10:50,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:10:50,021 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:10:50,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:10:50,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:10:50,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:10:50,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:10:50,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:10:50,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:10:50,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:10:50,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:10:50,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:10:50,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:10:50,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:10:50,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:10:50,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:10:50,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:10:50,025 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:10:50,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:10:50,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:10:50,026 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-31 16:10:50,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:10:50,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:10:50,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:10:50,257 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:10:50,258 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:10:50,258 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/popl20-more-buffer-mult2.wvr.yml/witness.yml [2024-01-31 16:10:50,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:10:50,406 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:10:50,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2024-01-31 16:10:51,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:10:51,754 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:10:51,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2024-01-31 16:10:51,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456b6e64a/cd9f10d9e8a447da8c67bc203fa0ff9c/FLAGf0f8daa3a [2024-01-31 16:10:51,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456b6e64a/cd9f10d9e8a447da8c67bc203fa0ff9c [2024-01-31 16:10:51,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:10:51,944 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:10:51,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:10:51,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:10:51,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:10:51,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:10:50" (1/2) ... [2024-01-31 16:10:51,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c154f9a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:10:51, skipping insertion in model container [2024-01-31 16:10:51,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:10:50" (1/2) ... [2024-01-31 16:10:51,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@192c3ab9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:10:51, skipping insertion in model container [2024-01-31 16:10:51,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:10:51" (2/2) ... [2024-01-31 16:10:51,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c154f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:51, skipping insertion in model container [2024-01-31 16:10:51,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:10:51" (2/2) ... [2024-01-31 16:10:51,956 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:10:52,071 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:10:52,073 INFO L98 nessWitnessExtractor]: Loop invariant at [L158-L158] ((((q2 == 0) && (i == 0)) && (j == 0)) && (total == 0)) && ((size != 0 && ((((((((8 <= size && 8 <= i) || (7 <= size && i == 7)) || (6 <= size && i == 6)) || (5 <= size && i == 5)) || (4 <= size && i == 4)) || (3 <= size && i == 3)) || (2 <= size && i == 2)) || (1 <= size && i == 1))) || (0 == i && i == 0)) [2024-01-31 16:10:52,073 INFO L98 nessWitnessExtractor]: Location invariant before [L105-L105] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,073 INFO L98 nessWitnessExtractor]: Location invariant before [L106-L106] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,073 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,074 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (((0 <= q2_back) && (0 <= i)) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,074 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,074 INFO L98 nessWitnessExtractor]: Location invariant before [L166-L166] (((0 <= i) && (0 <= j)) && (1 <= b)) && (b != 0) [2024-01-31 16:10:52,074 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,074 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,074 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,075 INFO L98 nessWitnessExtractor]: Loop invariant at [L70-L70] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,075 INFO L98 nessWitnessExtractor]: Loop invariant at [L107-L107] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,075 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,075 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,075 INFO L98 nessWitnessExtractor]: Location invariant before [L126-L126] ((((((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (n1 == 0)) && (n2 == 0)) && (total == 0) [2024-01-31 16:10:52,075 INFO L98 nessWitnessExtractor]: Location invariant before [L131-L131] (((((q1 == 0) && (q2 == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,076 INFO L98 nessWitnessExtractor]: Loop invariant at [L89-L89] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,076 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (((-2147483647 <= q1_front) && (0 <= i)) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,076 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (((-2147483647 <= q1_back) && (0 <= j)) && (1 <= i)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,076 INFO L98 nessWitnessExtractor]: Location invariant after [L87-L87] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,077 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,077 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,077 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,077 INFO L98 nessWitnessExtractor]: Location invariant before [L112-L112] (((-2147483647 <= q2_front) && (0 <= i)) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,078 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,078 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,078 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,078 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((((-2147483647 <= q1_back) && (0 <= i)) && (0 <= j)) && (q1_front <= 2147483646)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,078 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,078 INFO L98 nessWitnessExtractor]: Location invariant before [L130-L130] ((((((q1 == 0) && (q2 == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,079 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,079 INFO L98 nessWitnessExtractor]: Location invariant before [L133-L133] (((q2 == 0) && (i == 0)) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,079 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,079 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,079 INFO L98 nessWitnessExtractor]: Location invariant before [L124-L124] ((((((((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (n1 == 0)) && (n2 == 0)) && (N == 0)) && (C == 0)) && (total == 0) [2024-01-31 16:10:52,079 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,080 INFO L98 nessWitnessExtractor]: Location invariant before [L128-L128] ((((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,080 INFO L98 nessWitnessExtractor]: Location invariant before [L155-L155] (((q2 == 0) && (i == 0)) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,082 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,082 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,082 INFO L98 nessWitnessExtractor]: Location invariant before [L157-L157] (((q2 == 0) && (i == 0)) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,082 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,082 INFO L98 nessWitnessExtractor]: Location invariant after [L105-L105] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,082 INFO L98 nessWitnessExtractor]: Location invariant before [L154-L154] (((q2 == 0) && (i == 0)) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,083 INFO L98 nessWitnessExtractor]: Loop invariant at [L51-L51] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,083 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (((-2147483647 <= q2_back) && (0 <= i)) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,083 INFO L98 nessWitnessExtractor]: Location invariant before [L127-L127] (((((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (n2 == 0)) && (total == 0) [2024-01-31 16:10:52,083 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (((0 <= q1_back) && (0 <= i)) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,083 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] ((((-2147483647 <= q2_back) && (0 <= i)) && (0 <= j)) && (q2_front <= 2147483646)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,084 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,084 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (((-2147483647 <= q2_back) && (0 <= i)) && (1 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,084 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,084 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,085 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,085 INFO L98 nessWitnessExtractor]: Location invariant before [L132-L132] ((((q1 == 0) && (q2 == 0)) && (i == 0)) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,085 INFO L98 nessWitnessExtractor]: Location invariant before [L129-L129] (((((((q1 == 0) && (q2 == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,086 INFO L98 nessWitnessExtractor]: Location invariant after [L68-L68] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,086 INFO L98 nessWitnessExtractor]: Location invariant before [L161-L161] ((((0 <= i) && (q2 == 0)) && (i == 0)) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,086 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,087 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,087 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,087 INFO L98 nessWitnessExtractor]: Location invariant before [L125-L125] (((((((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (n1 == 0)) && (n2 == 0)) && (N == 0)) && (total == 0) [2024-01-31 16:10:52,087 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,087 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,087 INFO L98 nessWitnessExtractor]: Location invariant before [L159-L159] (((((q2 == 0) && (i == 0)) && (j == 0)) && (total == 0)) && (size != 0)) && ((((((((((8 <= i && 9 <= size) && i <= 2147483646) || (8 <= size && i == 7)) || (7 <= size && i == 6)) || (6 <= size && i == 5)) || (5 <= size && i == 4)) || (4 <= size && i == 3)) || (3 <= size && i == 2)) || (2 <= size && i == 1)) || ((1 <= size && 0 == i) && i == 0)) [2024-01-31 16:10:52,087 INFO L98 nessWitnessExtractor]: Location invariant before [L135-L135] (((-2147483647 <= C) && (i == 0)) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,088 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,088 INFO L98 nessWitnessExtractor]: Location invariant before [L167-L167] (0 <= i) && (0 <= j) [2024-01-31 16:10:52,088 INFO L98 nessWitnessExtractor]: Location invariant before [L104-L104] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,088 INFO L98 nessWitnessExtractor]: Location invariant before [L138-L138] ((i == 0) && (j == 0)) && (total == 0) [2024-01-31 16:10:52,088 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,088 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,089 INFO L98 nessWitnessExtractor]: Location invariant after [L49-L49] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,089 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,089 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (((-2147483647 <= q1_back) && (0 <= i)) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,089 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,089 INFO L98 nessWitnessExtractor]: Location invariant before [L165-L165] (((0 <= i) && (0 <= j)) && (b <= -1)) && (b != 0) [2024-01-31 16:10:52,090 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] ((0 <= i) && (0 <= j)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:10:52,090 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-31 16:10:52,119 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:10:52,291 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c[4151,4164] [2024-01-31 16:10:52,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:10:52,312 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local [2024-01-31 16:10:52,343 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 16:10:52,343 WARN L424 MainDispatcher]: Unable to annotate cond = i < N with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:10:52,355 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 16:10:52,355 WARN L424 MainDispatcher]: Unable to annotate cond = j < N with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:10:52,361 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 16:10:52,361 WARN L424 MainDispatcher]: Unable to annotate cond = i < N || q1_front < q1_back with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:10:52,367 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 16:10:52,367 WARN L424 MainDispatcher]: Unable to annotate cond = j < N || q2_front < q2_back with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:10:52,383 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c[4151,4164] Start Parsing Local Start Parsing Local [2024-01-31 16:10:52,385 WARN L424 MainDispatcher]: Unable to annotate * arr = (int*)malloc(sizeof(int) * (size_t)size) with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:10:52,390 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:10:52,401 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:10:52,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52 WrapperNode [2024-01-31 16:10:52,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:10:52,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:10:52,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:10:52,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:10:52,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,447 INFO L138 Inliner]: procedures = 27, calls = 76, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 394 [2024-01-31 16:10:52,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:10:52,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:10:52,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:10:52,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:10:52,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,477 INFO L175 MemorySlicer]: Split 16 memory accesses to 6 slices as follows [2, 6, 2, 2, 2, 2]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 6 writes are split as follows [0, 2, 1, 1, 1, 1]. [2024-01-31 16:10:52,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:10:52,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:10:52,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:10:52,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:10:52,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (1/1) ... [2024-01-31 16:10:52,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:10:52,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:10:52,662 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-31 16:10:52,667 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-31 16:10:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:10:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:10:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:10:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:10:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:10:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:10:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 16:10:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-31 16:10:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:10:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:10:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:10:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:10:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 16:10:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-31 16:10:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:10:52,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:10:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:10:52,706 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:10:52,706 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-31 16:10:52,707 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-31 16:10:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-31 16:10:52,707 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-31 16:10:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:10:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:10:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:10:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:10:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 16:10:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-31 16:10:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 16:10:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 16:10:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-31 16:10:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:10:52,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:10:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:10:52,711 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 16:10:52,850 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:10:52,852 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:10:53,369 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:10:53,370 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:10:53,670 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:10:53,670 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-01-31 16:10:53,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:10:53 BoogieIcfgContainer [2024-01-31 16:10:53,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:10:53,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:10:53,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:10:53,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:10:53,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:10:50" (1/4) ... [2024-01-31 16:10:53,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7216da and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:10:53, skipping insertion in model container [2024-01-31 16:10:53,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:10:51" (2/4) ... [2024-01-31 16:10:53,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7216da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:10:53, skipping insertion in model container [2024-01-31 16:10:53,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:10:52" (3/4) ... [2024-01-31 16:10:53,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7216da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:10:53, skipping insertion in model container [2024-01-31 16:10:53,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:10:53" (4/4) ... [2024-01-31 16:10:53,677 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2024-01-31 16:10:53,691 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:10:53,692 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2024-01-31 16:10:53,692 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:10:53,783 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-31 16:10:53,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 175 transitions, 378 flow [2024-01-31 16:10:53,847 INFO L124 PetriNetUnfolderBase]: 10/171 cut-off events. [2024-01-31 16:10:53,848 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-31 16:10:53,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 171 events. 10/171 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 565 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2024-01-31 16:10:53,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 175 transitions, 378 flow [2024-01-31 16:10:53,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 170 transitions, 364 flow [2024-01-31 16:10:53,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:10:53,866 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;@195c25e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:10:53,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 139 error locations. [2024-01-31 16:10:53,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:10:53,868 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:10:53,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:10:53,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:10:53,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:10:53,869 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 136 more)] === [2024-01-31 16:10:53,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:10:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash 36367, now seen corresponding path program 1 times [2024-01-31 16:10:53,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:10:53,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603288818] [2024-01-31 16:10:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:10:53,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:10:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:10:54,190 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-31 16:10:54,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:10:54,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603288818] [2024-01-31 16:10:54,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603288818] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:10:54,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:10:54,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:10:54,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798737302] [2024-01-31 16:10:54,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:10:54,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:10:54,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:10:54,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:10:54,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:10:54,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 175 [2024-01-31 16:10:54,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 170 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-31 16:10:54,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:10:54,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 175 [2024-01-31 16:10:54,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:10:57,453 INFO L124 PetriNetUnfolderBase]: 19650/30113 cut-off events. [2024-01-31 16:10:57,454 INFO L125 PetriNetUnfolderBase]: For 400/400 co-relation queries the response was YES. [2024-01-31 16:10:57,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57409 conditions, 30113 events. 19650/30113 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 1875. Compared 254511 event pairs, 17952 based on Foata normal form. 3392/20128 useless extension candidates. Maximal degree in co-relation 51224. Up to 26090 conditions per place. [2024-01-31 16:10:57,683 INFO L140 encePairwiseOnDemand]: 148/175 looper letters, 82 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2024-01-31 16:10:57,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 135 transitions, 462 flow [2024-01-31 16:10:57,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:10:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:10:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2024-01-31 16:10:57,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5447619047619048 [2024-01-31 16:10:57,698 INFO L175 Difference]: Start difference. First operand has 173 places, 170 transitions, 364 flow. Second operand 3 states and 286 transitions. [2024-01-31 16:10:57,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 135 transitions, 462 flow [2024-01-31 16:10:57,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 135 transitions, 446 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-31 16:10:57,735 INFO L231 Difference]: Finished difference. Result has 138 places, 135 transitions, 282 flow [2024-01-31 16:10:57,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=138, PETRI_TRANSITIONS=135} [2024-01-31 16:10:57,739 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, -35 predicate places. [2024-01-31 16:10:57,739 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 135 transitions, 282 flow [2024-01-31 16:10:57,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-31 16:10:57,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:10:57,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-31 16:10:57,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:10:57,740 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 136 more)] === [2024-01-31 16:10:57,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:10:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1128604, now seen corresponding path program 1 times [2024-01-31 16:10:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:10:57,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460195585] [2024-01-31 16:10:57,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:10:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:10:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:10:57,868 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-31 16:10:57,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:10:57,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460195585] [2024-01-31 16:10:57,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460195585] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:10:57,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:10:57,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:10:57,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564657098] [2024-01-31 16:10:57,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:10:57,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:10:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:10:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:10:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:10:57,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 175 [2024-01-31 16:10:57,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 135 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-31 16:10:57,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:10:57,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 175 [2024-01-31 16:10:57,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:00,676 INFO L124 PetriNetUnfolderBase]: 19650/30112 cut-off events. [2024-01-31 16:11:00,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:11:00,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56605 conditions, 30112 events. 19650/30112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 254161 event pairs, 17952 based on Foata normal form. 0/16737 useless extension candidates. Maximal degree in co-relation 56596. Up to 26087 conditions per place. [2024-01-31 16:11:00,842 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 80 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-01-31 16:11:00,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 444 flow [2024-01-31 16:11:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2024-01-31 16:11:00,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2024-01-31 16:11:00,844 INFO L175 Difference]: Start difference. First operand has 138 places, 135 transitions, 282 flow. Second operand 3 states and 266 transitions. [2024-01-31 16:11:00,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 134 transitions, 444 flow [2024-01-31 16:11:00,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:00,849 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 280 flow [2024-01-31 16:11:00,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2024-01-31 16:11:00,850 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, -36 predicate places. [2024-01-31 16:11:00,850 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 280 flow [2024-01-31 16:11:00,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-31 16:11:00,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:00,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 16:11:00,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:11:00,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 136 more)] === [2024-01-31 16:11:00,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash 34987912, now seen corresponding path program 1 times [2024-01-31 16:11:00,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:00,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000669159] [2024-01-31 16:11:00,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:00,973 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-31 16:11:00,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:00,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000669159] [2024-01-31 16:11:00,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000669159] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:00,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:00,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:00,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129300371] [2024-01-31 16:11:00,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:00,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:00,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:00,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:00,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:01,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 175 [2024-01-31 16:11:01,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 134 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:11:01,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:01,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 175 [2024-01-31 16:11:01,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:03,359 INFO L124 PetriNetUnfolderBase]: 19650/30111 cut-off events. [2024-01-31 16:11:03,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:11:03,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56603 conditions, 30111 events. 19650/30111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 254723 event pairs, 17952 based on Foata normal form. 0/16737 useless extension candidates. Maximal degree in co-relation 56592. Up to 26085 conditions per place. [2024-01-31 16:11:03,521 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 79 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2024-01-31 16:11:03,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 133 transitions, 440 flow [2024-01-31 16:11:03,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2024-01-31 16:11:03,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104761904761905 [2024-01-31 16:11:03,523 INFO L175 Difference]: Start difference. First operand has 137 places, 134 transitions, 280 flow. Second operand 3 states and 268 transitions. [2024-01-31 16:11:03,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 133 transitions, 440 flow [2024-01-31 16:11:03,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:03,529 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 278 flow [2024-01-31 16:11:03,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2024-01-31 16:11:03,530 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, -37 predicate places. [2024-01-31 16:11:03,530 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 278 flow [2024-01-31 16:11:03,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:11:03,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:03,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-31 16:11:03,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:11:03,531 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 136 more)] === [2024-01-31 16:11:03,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1084626514, now seen corresponding path program 1 times [2024-01-31 16:11:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:03,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320896980] [2024-01-31 16:11:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:03,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:03,661 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-31 16:11:03,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:03,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320896980] [2024-01-31 16:11:03,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320896980] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:03,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:03,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:03,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499378896] [2024-01-31 16:11:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:03,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:03,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:03,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 175 [2024-01-31 16:11:03,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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-31 16:11:03,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:03,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 175 [2024-01-31 16:11:03,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:05,863 INFO L124 PetriNetUnfolderBase]: 19650/30110 cut-off events. [2024-01-31 16:11:05,863 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:11:05,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56601 conditions, 30110 events. 19650/30110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 254996 event pairs, 17952 based on Foata normal form. 0/16737 useless extension candidates. Maximal degree in co-relation 56588. Up to 26083 conditions per place. [2024-01-31 16:11:06,012 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 78 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-01-31 16:11:06,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 132 transitions, 436 flow [2024-01-31 16:11:06,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-01-31 16:11:06,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-01-31 16:11:06,014 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 278 flow. Second operand 3 states and 270 transitions. [2024-01-31 16:11:06,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 132 transitions, 436 flow [2024-01-31 16:11:06,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 132 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:06,016 INFO L231 Difference]: Finished difference. Result has 135 places, 132 transitions, 276 flow [2024-01-31 16:11:06,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=135, PETRI_TRANSITIONS=132} [2024-01-31 16:11:06,017 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, -38 predicate places. [2024-01-31 16:11:06,017 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 132 transitions, 276 flow [2024-01-31 16:11:06,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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-31 16:11:06,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:06,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 16:11:06,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:11:06,018 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 136 more)] === [2024-01-31 16:11:06,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash -736315267, now seen corresponding path program 1 times [2024-01-31 16:11:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:06,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783731818] [2024-01-31 16:11:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:06,085 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-31 16:11:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:06,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783731818] [2024-01-31 16:11:06,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783731818] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:06,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:06,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:06,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112866983] [2024-01-31 16:11:06,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:06,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:06,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:06,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:06,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:06,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 175 [2024-01-31 16:11:06,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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-31 16:11:06,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:06,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 175 [2024-01-31 16:11:06,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:08,563 INFO L124 PetriNetUnfolderBase]: 19650/30109 cut-off events. [2024-01-31 16:11:08,563 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:11:08,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56599 conditions, 30109 events. 19650/30109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 254464 event pairs, 17952 based on Foata normal form. 0/16737 useless extension candidates. Maximal degree in co-relation 56584. Up to 26081 conditions per place. [2024-01-31 16:11:08,715 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 77 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-01-31 16:11:08,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 131 transitions, 432 flow [2024-01-31 16:11:08,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2024-01-31 16:11:08,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518095238095238 [2024-01-31 16:11:08,717 INFO L175 Difference]: Start difference. First operand has 135 places, 132 transitions, 276 flow. Second operand 3 states and 272 transitions. [2024-01-31 16:11:08,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 131 transitions, 432 flow [2024-01-31 16:11:08,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 131 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:08,719 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 274 flow [2024-01-31 16:11:08,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2024-01-31 16:11:08,720 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, -39 predicate places. [2024-01-31 16:11:08,720 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 274 flow [2024-01-31 16:11:08,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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-31 16:11:08,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:08,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:08,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:11:08,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 136 more)] === [2024-01-31 16:11:08,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1350935559, now seen corresponding path program 1 times [2024-01-31 16:11:08,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:08,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462366572] [2024-01-31 16:11:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:08,782 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-31 16:11:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462366572] [2024-01-31 16:11:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462366572] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:08,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:08,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:08,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662307277] [2024-01-31 16:11:08,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:08,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:08,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:08,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:08,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 175 [2024-01-31 16:11:08,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-31 16:11:08,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:08,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 175 [2024-01-31 16:11:08,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:11,524 INFO L124 PetriNetUnfolderBase]: 19650/30108 cut-off events. [2024-01-31 16:11:11,525 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:11:11,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56597 conditions, 30108 events. 19650/30108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 254440 event pairs, 17952 based on Foata normal form. 0/16737 useless extension candidates. Maximal degree in co-relation 56580. Up to 26079 conditions per place. [2024-01-31 16:11:11,677 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 76 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2024-01-31 16:11:11,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 130 transitions, 428 flow [2024-01-31 16:11:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2024-01-31 16:11:11,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219047619047619 [2024-01-31 16:11:11,679 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 274 flow. Second operand 3 states and 274 transitions. [2024-01-31 16:11:11,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 130 transitions, 428 flow [2024-01-31 16:11:11,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 130 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:11,681 INFO L231 Difference]: Finished difference. Result has 133 places, 130 transitions, 272 flow [2024-01-31 16:11:11,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=133, PETRI_TRANSITIONS=130} [2024-01-31 16:11:11,682 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, -40 predicate places. [2024-01-31 16:11:11,682 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 130 transitions, 272 flow [2024-01-31 16:11:11,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-31 16:11:11,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:11,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:11,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:11:11,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 136 more)] === [2024-01-31 16:11:11,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:11,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1070671813, now seen corresponding path program 1 times [2024-01-31 16:11:11,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:11,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465129009] [2024-01-31 16:11:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:11,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:11,737 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-31 16:11:11,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:11,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465129009] [2024-01-31 16:11:11,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465129009] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:11,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:11,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543458572] [2024-01-31 16:11:11,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:11,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:11,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:11,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:11,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 175 [2024-01-31 16:11:11,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 130 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-31 16:11:11,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:11,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 175 [2024-01-31 16:11:11,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:14,114 INFO L124 PetriNetUnfolderBase]: 19650/30107 cut-off events. [2024-01-31 16:11:14,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:11:14,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56595 conditions, 30107 events. 19650/30107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 254825 event pairs, 17952 based on Foata normal form. 0/16737 useless extension candidates. Maximal degree in co-relation 56576. Up to 26077 conditions per place. [2024-01-31 16:11:14,298 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 75 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2024-01-31 16:11:14,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 129 transitions, 424 flow [2024-01-31 16:11:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2024-01-31 16:11:14,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2024-01-31 16:11:14,300 INFO L175 Difference]: Start difference. First operand has 133 places, 130 transitions, 272 flow. Second operand 3 states and 276 transitions. [2024-01-31 16:11:14,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 129 transitions, 424 flow [2024-01-31 16:11:14,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 129 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:14,302 INFO L231 Difference]: Finished difference. Result has 132 places, 129 transitions, 270 flow [2024-01-31 16:11:14,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=132, PETRI_TRANSITIONS=129} [2024-01-31 16:11:14,303 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, -41 predicate places. [2024-01-31 16:11:14,303 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 129 transitions, 270 flow [2024-01-31 16:11:14,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-31 16:11:14,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:14,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:14,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:11:14,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 136 more)] === [2024-01-31 16:11:14,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1168911012, now seen corresponding path program 1 times [2024-01-31 16:11:14,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:14,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104335428] [2024-01-31 16:11:14,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:14,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:14,377 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-31 16:11:14,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:14,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104335428] [2024-01-31 16:11:14,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104335428] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:14,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:14,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903726760] [2024-01-31 16:11:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:14,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:14,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:14,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 175 [2024-01-31 16:11:14,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 129 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-31 16:11:14,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:14,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 175 [2024-01-31 16:11:14,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:16,541 INFO L124 PetriNetUnfolderBase]: 19650/30106 cut-off events. [2024-01-31 16:11:16,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:11:16,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56593 conditions, 30106 events. 19650/30106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 254669 event pairs, 17952 based on Foata normal form. 0/16737 useless extension candidates. Maximal degree in co-relation 56572. Up to 26075 conditions per place. [2024-01-31 16:11:16,726 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 74 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2024-01-31 16:11:16,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 128 transitions, 420 flow [2024-01-31 16:11:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-01-31 16:11:16,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295238095238095 [2024-01-31 16:11:16,731 INFO L175 Difference]: Start difference. First operand has 132 places, 129 transitions, 270 flow. Second operand 3 states and 278 transitions. [2024-01-31 16:11:16,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 128 transitions, 420 flow [2024-01-31 16:11:16,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:16,734 INFO L231 Difference]: Finished difference. Result has 131 places, 128 transitions, 268 flow [2024-01-31 16:11:16,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=131, PETRI_TRANSITIONS=128} [2024-01-31 16:11:16,736 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, -42 predicate places. [2024-01-31 16:11:16,737 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 128 transitions, 268 flow [2024-01-31 16:11:16,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-31 16:11:16,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:16,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:16,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:11:16,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 136 more)] === [2024-01-31 16:11:16,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:16,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1876501747, now seen corresponding path program 1 times [2024-01-31 16:11:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:16,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512609982] [2024-01-31 16:11:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:16,805 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-31 16:11:16,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:16,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512609982] [2024-01-31 16:11:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512609982] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:16,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:16,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:16,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539635997] [2024-01-31 16:11:16,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:16,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:16,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:16,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:16,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:16,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 175 [2024-01-31 16:11:16,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-31 16:11:16,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:16,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 175 [2024-01-31 16:11:16,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:19,151 INFO L124 PetriNetUnfolderBase]: 19650/30102 cut-off events. [2024-01-31 16:11:19,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:11:19,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56585 conditions, 30102 events. 19650/30102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 254758 event pairs, 17952 based on Foata normal form. 0/16737 useless extension candidates. Maximal degree in co-relation 56562. Up to 26064 conditions per place. [2024-01-31 16:11:19,457 INFO L140 encePairwiseOnDemand]: 169/175 looper letters, 70 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-01-31 16:11:19,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 124 transitions, 404 flow [2024-01-31 16:11:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2024-01-31 16:11:19,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-01-31 16:11:19,460 INFO L175 Difference]: Start difference. First operand has 131 places, 128 transitions, 268 flow. Second operand 3 states and 280 transitions. [2024-01-31 16:11:19,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 124 transitions, 404 flow [2024-01-31 16:11:19,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 124 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:19,462 INFO L231 Difference]: Finished difference. Result has 127 places, 124 transitions, 260 flow [2024-01-31 16:11:19,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=127, PETRI_TRANSITIONS=124} [2024-01-31 16:11:19,463 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, -46 predicate places. [2024-01-31 16:11:19,463 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 124 transitions, 260 flow [2024-01-31 16:11:19,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-31 16:11:19,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:19,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:19,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 16:11:19,464 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 136 more)] === [2024-01-31 16:11:19,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash 431999956, now seen corresponding path program 1 times [2024-01-31 16:11:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:19,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920786774] [2024-01-31 16:11:19,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:19,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:11:19,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 16:11:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:11:19,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 16:11:19,534 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 16:11:19,535 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 139 remaining) [2024-01-31 16:11:19,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 139 remaining) [2024-01-31 16:11:19,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 139 remaining) [2024-01-31 16:11:19,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 139 remaining) [2024-01-31 16:11:19,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 139 remaining) [2024-01-31 16:11:19,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 139 remaining) [2024-01-31 16:11:19,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 139 remaining) [2024-01-31 16:11:19,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 139 remaining) [2024-01-31 16:11:19,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 139 remaining) [2024-01-31 16:11:19,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 139 remaining) [2024-01-31 16:11:19,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 139 remaining) [2024-01-31 16:11:19,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 139 remaining) [2024-01-31 16:11:19,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 139 remaining) [2024-01-31 16:11:19,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 139 remaining) [2024-01-31 16:11:19,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 139 remaining) [2024-01-31 16:11:19,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 139 remaining) [2024-01-31 16:11:19,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 139 remaining) [2024-01-31 16:11:19,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 139 remaining) [2024-01-31 16:11:19,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 139 remaining) [2024-01-31 16:11:19,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 139 remaining) [2024-01-31 16:11:19,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 139 remaining) [2024-01-31 16:11:19,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 139 remaining) [2024-01-31 16:11:19,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 139 remaining) [2024-01-31 16:11:19,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 139 remaining) [2024-01-31 16:11:19,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 139 remaining) [2024-01-31 16:11:19,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 139 remaining) [2024-01-31 16:11:19,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 139 remaining) [2024-01-31 16:11:19,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 139 remaining) [2024-01-31 16:11:19,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 139 remaining) [2024-01-31 16:11:19,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 139 remaining) [2024-01-31 16:11:19,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 139 remaining) [2024-01-31 16:11:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 139 remaining) [2024-01-31 16:11:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 139 remaining) [2024-01-31 16:11:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 139 remaining) [2024-01-31 16:11:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 139 remaining) [2024-01-31 16:11:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 139 remaining) [2024-01-31 16:11:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 139 remaining) [2024-01-31 16:11:19,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 139 remaining) [2024-01-31 16:11:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 139 remaining) [2024-01-31 16:11:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 139 remaining) [2024-01-31 16:11:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 139 remaining) [2024-01-31 16:11:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 139 remaining) [2024-01-31 16:11:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 139 remaining) [2024-01-31 16:11:19,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 139 remaining) [2024-01-31 16:11:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 139 remaining) [2024-01-31 16:11:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 139 remaining) [2024-01-31 16:11:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 139 remaining) [2024-01-31 16:11:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 139 remaining) [2024-01-31 16:11:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 139 remaining) [2024-01-31 16:11:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 139 remaining) [2024-01-31 16:11:19,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 139 remaining) [2024-01-31 16:11:19,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 139 remaining) [2024-01-31 16:11:19,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 139 remaining) [2024-01-31 16:11:19,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 139 remaining) [2024-01-31 16:11:19,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 139 remaining) [2024-01-31 16:11:19,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 139 remaining) [2024-01-31 16:11:19,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 139 remaining) [2024-01-31 16:11:19,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 139 remaining) [2024-01-31 16:11:19,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 139 remaining) [2024-01-31 16:11:19,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 139 remaining) [2024-01-31 16:11:19,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 139 remaining) [2024-01-31 16:11:19,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 139 remaining) [2024-01-31 16:11:19,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 139 remaining) [2024-01-31 16:11:19,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (75 of 139 remaining) [2024-01-31 16:11:19,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (74 of 139 remaining) [2024-01-31 16:11:19,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 139 remaining) [2024-01-31 16:11:19,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 139 remaining) [2024-01-31 16:11:19,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (71 of 139 remaining) [2024-01-31 16:11:19,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 139 remaining) [2024-01-31 16:11:19,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 139 remaining) [2024-01-31 16:11:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 139 remaining) [2024-01-31 16:11:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err14ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 139 remaining) [2024-01-31 16:11:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 139 remaining) [2024-01-31 16:11:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 139 remaining) [2024-01-31 16:11:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 139 remaining) [2024-01-31 16:11:19,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err6ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 139 remaining) [2024-01-31 16:11:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err7ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 139 remaining) [2024-01-31 16:11:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err8ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 139 remaining) [2024-01-31 16:11:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err9ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 139 remaining) [2024-01-31 16:11:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err10ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 139 remaining) [2024-01-31 16:11:19,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err11ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 139 remaining) [2024-01-31 16:11:19,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err12ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 139 remaining) [2024-01-31 16:11:19,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err13ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 139 remaining) [2024-01-31 16:11:19,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 139 remaining) [2024-01-31 16:11:19,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 139 remaining) [2024-01-31 16:11:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 139 remaining) [2024-01-31 16:11:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 139 remaining) [2024-01-31 16:11:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 139 remaining) [2024-01-31 16:11:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 139 remaining) [2024-01-31 16:11:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 139 remaining) [2024-01-31 16:11:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 139 remaining) [2024-01-31 16:11:19,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 139 remaining) [2024-01-31 16:11:19,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 139 remaining) [2024-01-31 16:11:19,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 139 remaining) [2024-01-31 16:11:19,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 139 remaining) [2024-01-31 16:11:19,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 139 remaining) [2024-01-31 16:11:19,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 139 remaining) [2024-01-31 16:11:19,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 139 remaining) [2024-01-31 16:11:19,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 139 remaining) [2024-01-31 16:11:19,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 139 remaining) [2024-01-31 16:11:19,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 139 remaining) [2024-01-31 16:11:19,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 139 remaining) [2024-01-31 16:11:19,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 139 remaining) [2024-01-31 16:11:19,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 139 remaining) [2024-01-31 16:11:19,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 139 remaining) [2024-01-31 16:11:19,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 139 remaining) [2024-01-31 16:11:19,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 139 remaining) [2024-01-31 16:11:19,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 139 remaining) [2024-01-31 16:11:19,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 139 remaining) [2024-01-31 16:11:19,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 139 remaining) [2024-01-31 16:11:19,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 139 remaining) [2024-01-31 16:11:19,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 139 remaining) [2024-01-31 16:11:19,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 139 remaining) [2024-01-31 16:11:19,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 139 remaining) [2024-01-31 16:11:19,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 139 remaining) [2024-01-31 16:11:19,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 139 remaining) [2024-01-31 16:11:19,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 139 remaining) [2024-01-31 16:11:19,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 139 remaining) [2024-01-31 16:11:19,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 139 remaining) [2024-01-31 16:11:19,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 139 remaining) [2024-01-31 16:11:19,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 139 remaining) [2024-01-31 16:11:19,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 139 remaining) [2024-01-31 16:11:19,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 139 remaining) [2024-01-31 16:11:19,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 139 remaining) [2024-01-31 16:11:19,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 139 remaining) [2024-01-31 16:11:19,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 139 remaining) [2024-01-31 16:11:19,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 139 remaining) [2024-01-31 16:11:19,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err14ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 139 remaining) [2024-01-31 16:11:19,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 139 remaining) [2024-01-31 16:11:19,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 139 remaining) [2024-01-31 16:11:19,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 139 remaining) [2024-01-31 16:11:19,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err6ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 139 remaining) [2024-01-31 16:11:19,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err7ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 139 remaining) [2024-01-31 16:11:19,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err8ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 139 remaining) [2024-01-31 16:11:19,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err9ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 139 remaining) [2024-01-31 16:11:19,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err10ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 139 remaining) [2024-01-31 16:11:19,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err11ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 139 remaining) [2024-01-31 16:11:19,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err12ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 139 remaining) [2024-01-31 16:11:19,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err13ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 139 remaining) [2024-01-31 16:11:19,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 16:11:19,567 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:19,573 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 16:11:19,573 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 16:11:19,610 INFO L503 ceAbstractionStarter]: Automizer considered 78 witness invariants [2024-01-31 16:11:19,610 INFO L504 ceAbstractionStarter]: WitnessConsidered=78 [2024-01-31 16:11:19,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:11:19 BasicIcfg [2024-01-31 16:11:19,611 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 16:11:19,611 INFO L158 Benchmark]: Toolchain (without parser) took 27667.75ms. Allocated memory was 142.6MB in the beginning and 14.1GB in the end (delta: 14.0GB). Free memory was 84.1MB in the beginning and 12.1GB in the end (delta: -12.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-01-31 16:11:19,611 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:11:19,612 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:11:19,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.40ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 51.0MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-01-31 16:11:19,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.99ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 47.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 16:11:19,612 INFO L158 Benchmark]: Boogie Preprocessor took 127.70ms. Allocated memory is still 142.6MB. Free memory was 47.0MB in the beginning and 110.0MB in the end (delta: -63.0MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-01-31 16:11:19,613 INFO L158 Benchmark]: RCFGBuilder took 1094.50ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 109.9MB in the beginning and 170.0MB in the end (delta: -60.1MB). Peak memory consumption was 143.1MB. Max. memory is 16.1GB. [2024-01-31 16:11:19,614 INFO L158 Benchmark]: TraceAbstraction took 25938.81ms. Allocated memory was 232.8MB in the beginning and 14.1GB in the end (delta: 13.9GB). Free memory was 169.0MB in the beginning and 12.1GB in the end (delta: -11.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-01-31 16:11:19,615 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.40ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 51.0MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.99ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 47.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.70ms. Allocated memory is still 142.6MB. Free memory was 47.0MB in the beginning and 110.0MB in the end (delta: -63.0MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1094.50ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 109.9MB in the beginning and 170.0MB in the end (delta: -60.1MB). Peak memory consumption was 143.1MB. Max. memory is 16.1GB. * TraceAbstraction took 25938.81ms. Allocated memory was 232.8MB in the beginning and 14.1GB in the end (delta: 13.9GB). Free memory was 169.0MB in the beginning and 12.1GB in the end (delta: -11.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 158]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] int *q1, *q2; [L42] int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, C, total; [L122] pthread_t t1, t2, t3, t4; VAL [C=0, N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={7:0}, t3={8:0}, t4={6:0}, total=0] [L124] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[C],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]]]] [L124] C = __VERIFIER_nondet_int() [L125] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]]]] [L125] N = __VERIFIER_nondet_int() [L126] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]]]] [L126] n1 = __VERIFIER_nondet_int() [L127] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]]]] [L127] n2 = __VERIFIER_nondet_int() [L128] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]]]] [L128] q1_front = __VERIFIER_nondet_int() [L129] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]]]] [L129] q1_back = q1_front VAL [C=0, N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={7:0}, t3={8:0}, t4={6:0}, total=0] [L130] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]]]] [L130] q2_front = __VERIFIER_nondet_int() [L131] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]]]] [L131] q2_back = q2_front VAL [C=0, N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={7:0}, t3={8:0}, t4={6:0}, total=0] [L132] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]]]] [L132] CALL create_fresh_int_array(n1) [L154] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]]]] [L154] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L154] RET assume_abort_if_not(size >= 0) [L155] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]]]] [L155] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE !(!cond) [L155] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L157] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L158] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [C=0, N=0, \old(size)=0, arr={-1:0}, i=-2, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0, total=0] - UnprovableResult [Line: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 165]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 166]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 167]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 124]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 127]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 128]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 129]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 130]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 131]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 155]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 159]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 155]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 158]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 159]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 138]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 148]: 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: 141]: 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: 140]: 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: 138]: 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: 139]: 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: 104]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 110]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 165]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 166]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 167]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 270 locations, 139 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: 25.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 428 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1428 IncrementalHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 89 mSDtfsCounter, 1428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=0, InterpolantAutomatonStates: 27, 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.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 1350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-31 16:11:19,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE