./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-two-queue.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-two-queue.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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-two-queue.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-two-queue.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-dev-a340643-m [2024-01-27 14:52:46,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 14:52:46,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 14:52:46,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 14:52:46,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 14:52:46,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 14:52:46,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 14:52:46,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 14:52:46,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 14:52:46,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 14:52:46,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 14:52:46,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 14:52:46,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 14:52:46,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 14:52:46,166 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 14:52:46,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 14:52:46,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 14:52:46,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 14:52:46,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 14:52:46,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 14:52:46,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 14:52:46,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 14:52:46,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 14:52:46,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 14:52:46,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 14:52:46,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 14:52:46,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 14:52:46,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 14:52:46,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 14:52:46,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 14:52:46,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 14:52:46,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 14:52:46,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:52:46,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 14:52:46,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 14:52:46,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 14:52:46,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 14:52:46,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 14:52:46,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 14:52:46,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 14:52:46,172 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 14:52:46,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 14:52:46,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 14:52:46,173 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-27 14:52:46,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 14:52:46,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 14:52:46,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 14:52:46,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 14:52:46,343 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 14:52:46,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-01-27 14:52:47,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 14:52:47,557 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 14:52:47,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-01-27 14:52:47,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc9470b5/b39e334b8ceb4fff864f752802e47ce2/FLAGa07d0c3dc [2024-01-27 14:52:47,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc9470b5/b39e334b8ceb4fff864f752802e47ce2 [2024-01-27 14:52:47,585 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 14:52:47,585 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 14:52:47,586 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-two-queue.wvr.yml/witness.yml [2024-01-27 14:52:47,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 14:52:47,710 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 14:52:47,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 14:52:47,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 14:52:47,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 14:52:47,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:52:47" (1/2) ... [2024-01-27 14:52:47,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0572b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:52:47, skipping insertion in model container [2024-01-27 14:52:47,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:52:47" (1/2) ... [2024-01-27 14:52:47,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7d58e988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:52:47, skipping insertion in model container [2024-01-27 14:52:47,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:52:47" (2/2) ... [2024-01-27 14:52:47,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0572b2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:47, skipping insertion in model container [2024-01-27 14:52:47,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:52:47" (2/2) ... [2024-01-27 14:52:47,725 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 14:52:47,748 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 14:52:47,751 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] i == 0 [2024-01-27 14:52:47,752 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] j == 0 [2024-01-27 14:52:47,752 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q2 == 0 [2024-01-27 14:52:47,752 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q2_front == 0 [2024-01-27 14:52:47,752 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q1 == 0 [2024-01-27 14:52:47,753 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q1_back == 0 [2024-01-27 14:52:47,753 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q2_back == 0 [2024-01-27 14:52:47,753 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] -2147483647 <= q1_front [2024-01-27 14:52:47,753 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,753 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] q2 == 0 [2024-01-27 14:52:47,753 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] i == 0 [2024-01-27 14:52:47,754 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] j == 0 [2024-01-27 14:52:47,754 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] 0 <= q1_back [2024-01-27 14:52:47,754 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,754 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q1_front == 0 [2024-01-27 14:52:47,754 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q2_front == 0 [2024-01-27 14:52:47,754 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q2_back == 0 [2024-01-27 14:52:47,755 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q1_back == 0 [2024-01-27 14:52:47,755 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] i == 0 [2024-01-27 14:52:47,755 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] N == 0 [2024-01-27 14:52:47,755 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] j == 0 [2024-01-27 14:52:47,755 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] n1 == 0 [2024-01-27 14:52:47,755 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q2 == 0 [2024-01-27 14:52:47,756 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] n2 == 0 [2024-01-27 14:52:47,756 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q1 == 0 [2024-01-27 14:52:47,756 INFO L98 nessWitnessExtractor]: Loop invariant at [L65-L77] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,756 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] q2 == 0 [2024-01-27 14:52:47,756 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] q1 == 0 [2024-01-27 14:52:47,756 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] j == 0 [2024-01-27 14:52:47,757 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] i == 0 [2024-01-27 14:52:47,757 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,757 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] -2147483647 <= q1_back [2024-01-27 14:52:47,757 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] q2 == 0 [2024-01-27 14:52:47,757 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (((((((((8 <= size && (-15LL + (long long )i) + (long long )size >= 0LL) && i == 7) || ((7 <= size && (-13LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((6 <= size && (-11LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((5 <= size && (-9LL + (long long )i) + (long long )size >= 0LL) && i == 4)) || ((4 <= size && (-7LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((3 <= size && (-5LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((2 <= size && (-3LL + (long long )i) + (long long )size >= 0LL) && i == 1)) || (((1 <= size && (-1LL + (long long )i) + (long long )size >= 0LL) && 0 == i) && i == 0)) || (((((8 <= i && 9 <= size) && i <= 2147483646) && (-17LL + (long long )i) + (long long )size >= 0LL) && i != 0) && i != 1) [2024-01-27 14:52:47,757 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-27 14:52:47,757 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] j == 0 [2024-01-27 14:52:47,758 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] size != 0 [2024-01-27 14:52:47,758 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] i == 0 [2024-01-27 14:52:47,759 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] -2147483647 <= q2_back [2024-01-27 14:52:47,759 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,759 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] q2_front <= 2147483646 [2024-01-27 14:52:47,759 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,759 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,759 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,760 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,760 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] -2147483647 <= q2_front [2024-01-27 14:52:47,760 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q2_back == 0 [2024-01-27 14:52:47,760 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q2 == 0 [2024-01-27 14:52:47,760 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] j == 0 [2024-01-27 14:52:47,760 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q1 == 0 [2024-01-27 14:52:47,760 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q2_front == 0 [2024-01-27 14:52:47,761 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] i == 0 [2024-01-27 14:52:47,761 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,761 INFO L98 nessWitnessExtractor]: Loop invariant at [L47-L59] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,761 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,762 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] q2_back == 0 [2024-01-27 14:52:47,762 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] i == 0 [2024-01-27 14:52:47,762 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] j == 0 [2024-01-27 14:52:47,762 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] q2 == 0 [2024-01-27 14:52:47,762 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] q1 == 0 [2024-01-27 14:52:47,762 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,763 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,763 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] i == 0 [2024-01-27 14:52:47,763 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q2_back == 0 [2024-01-27 14:52:47,763 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q1 == 0 [2024-01-27 14:52:47,763 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q1_front == 0 [2024-01-27 14:52:47,763 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q2 == 0 [2024-01-27 14:52:47,763 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q2_front == 0 [2024-01-27 14:52:47,763 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] j == 0 [2024-01-27 14:52:47,764 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] n2 == 0 [2024-01-27 14:52:47,764 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q1_back == 0 [2024-01-27 14:52:47,764 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] 0 <= q2_back [2024-01-27 14:52:47,764 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,764 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q1 == 0 [2024-01-27 14:52:47,765 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q2_back == 0 [2024-01-27 14:52:47,765 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q1_back == 0 [2024-01-27 14:52:47,765 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q2_front == 0 [2024-01-27 14:52:47,765 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] i == 0 [2024-01-27 14:52:47,765 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] j == 0 [2024-01-27 14:52:47,765 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q1_front == 0 [2024-01-27 14:52:47,765 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q2 == 0 [2024-01-27 14:52:47,765 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,766 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] q2 == 0 [2024-01-27 14:52:47,766 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] (long long )i - (long long )size >= 0LL [2024-01-27 14:52:47,766 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] 0 <= i [2024-01-27 14:52:47,766 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] i == 0 [2024-01-27 14:52:47,766 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] j == 0 [2024-01-27 14:52:47,766 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] i == 0 [2024-01-27 14:52:47,766 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] j == 0 [2024-01-27 14:52:47,766 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] q2 == 0 [2024-01-27 14:52:47,767 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] q2 == 0 [2024-01-27 14:52:47,767 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] i == 0 [2024-01-27 14:52:47,767 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] j == 0 [2024-01-27 14:52:47,767 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] q2 == 0 [2024-01-27 14:52:47,767 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] i == 0 [2024-01-27 14:52:47,767 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] j == 0 [2024-01-27 14:52:47,767 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] q1_front <= 2147483646 [2024-01-27 14:52:47,768 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,768 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] -2147483647 <= q1_back [2024-01-27 14:52:47,768 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] j == 0 [2024-01-27 14:52:47,768 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] i == 0 [2024-01-27 14:52:47,768 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] q2 == 0 [2024-01-27 14:52:47,768 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] j == 0 [2024-01-27 14:52:47,768 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] i == 0 [2024-01-27 14:52:47,769 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] j == 0 [2024-01-27 14:52:47,769 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] i == 0 [2024-01-27 14:52:47,769 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] q2 == 0 [2024-01-27 14:52:47,769 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] ((((0LL - (long long )i) + (long long )size >= 0LL && size != 0) && ((((((((7 <= size && (-14LL + (long long )i) + (long long )size >= 0LL) && i == 7) || ((6 <= size && (-12LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((5 <= size && (-10LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((4 <= size && (-8LL + (long long )i) + (long long )size >= 0LL) && i == 4)) || ((3 <= size && (-6LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((2 <= size && (-4LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((1 <= size && (-2LL + (long long )i) + (long long )size >= 0LL) && i == 1))) || (0 == i && i == 0)) || (((((8 <= size && 8 <= i) && (-16LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && size != 0) && i != 1) [2024-01-27 14:52:47,770 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,770 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,771 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,771 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,771 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] -2147483647 <= q2_back [2024-01-27 14:52:47,771 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,771 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q1_front == 0 [2024-01-27 14:52:47,772 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q1 == 0 [2024-01-27 14:52:47,772 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q2 == 0 [2024-01-27 14:52:47,772 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] n2 == 0 [2024-01-27 14:52:47,772 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q2_back == 0 [2024-01-27 14:52:47,772 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] i == 0 [2024-01-27 14:52:47,773 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q1_back == 0 [2024-01-27 14:52:47,773 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q2_front == 0 [2024-01-27 14:52:47,773 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] n1 == 0 [2024-01-27 14:52:47,773 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] j == 0 [2024-01-27 14:52:47,773 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,773 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,773 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,774 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-27 14:52:47,791 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 14:52:47,924 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-two-queue.wvr.c[3013,3026] [2024-01-27 14:52:47,941 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:52:47,955 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 14:52:47,968 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 14:52:48,041 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-two-queue.wvr.c[3013,3026] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 14:52:48,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:52:48,072 INFO L206 MainTranslator]: Completed translation [2024-01-27 14:52:48,073 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48 WrapperNode [2024-01-27 14:52:48,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 14:52:48,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 14:52:48,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 14:52:48,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 14:52:48,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,139 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 369 [2024-01-27 14:52:48,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 14:52:48,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 14:52:48,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 14:52:48,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 14:52:48,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,186 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 2, 6, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 2, 1]. [2024-01-27 14:52:48,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 14:52:48,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 14:52:48,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 14:52:48,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 14:52:48,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (1/1) ... [2024-01-27 14:52:48,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:52:48,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:52:48,240 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-27 14:52:48,277 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-27 14:52:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 14:52:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 14:52:48,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 14:52:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 14:52:48,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 14:52:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 14:52:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 14:52:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 14:52:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 14:52:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 14:52:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 14:52:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 14:52:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 14:52:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 14:52:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 14:52:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 14:52:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 14:52:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 14:52:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 14:52:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 14:52:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 14:52:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 14:52:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 14:52:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 14:52:48,301 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 14:52:48,396 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 14:52:48,398 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 14:52:48,892 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 14:52:48,892 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 14:52:49,111 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 14:52:49,112 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 14:52:49,113 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:52:49 BoogieIcfgContainer [2024-01-27 14:52:49,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 14:52:49,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 14:52:49,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 14:52:49,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 14:52:49,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 02:52:47" (1/4) ... [2024-01-27 14:52:49,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ff34b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:52:49, skipping insertion in model container [2024-01-27 14:52:49,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:52:47" (2/4) ... [2024-01-27 14:52:49,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ff34b1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:52:49, skipping insertion in model container [2024-01-27 14:52:49,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:52:48" (3/4) ... [2024-01-27 14:52:49,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ff34b1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:52:49, skipping insertion in model container [2024-01-27 14:52:49,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:52:49" (4/4) ... [2024-01-27 14:52:49,122 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-01-27 14:52:49,136 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 14:52:49,136 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 160 error locations. [2024-01-27 14:52:49,137 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 14:52:49,253 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 14:52:49,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 319 transitions, 652 flow [2024-01-27 14:52:49,388 INFO L124 PetriNetUnfolderBase]: 4/317 cut-off events. [2024-01-27 14:52:49,388 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 14:52:49,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 317 events. 4/317 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 562 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 281. Up to 2 conditions per place. [2024-01-27 14:52:49,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 319 transitions, 652 flow [2024-01-27 14:52:49,398 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 316 transitions, 644 flow [2024-01-27 14:52:49,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 14:52:49,409 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;@ea754a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 14:52:49,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 200 error locations. [2024-01-27 14:52:49,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 14:52:49,411 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 14:52:49,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:52:49,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:49,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 14:52:49,412 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:49,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash 38836, now seen corresponding path program 1 times [2024-01-27 14:52:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:49,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978244854] [2024-01-27 14:52:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:49,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:49,581 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-27 14:52:49,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:49,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978244854] [2024-01-27 14:52:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978244854] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:49,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:49,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:52:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503144734] [2024-01-27 14:52:49,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:49,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:49,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:49,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:49,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 319 [2024-01-27 14:52:49,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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-27 14:52:49,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:49,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 319 [2024-01-27 14:52:49,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:49,928 INFO L124 PetriNetUnfolderBase]: 524/1340 cut-off events. [2024-01-27 14:52:49,928 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-01-27 14:52:49,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2210 conditions, 1340 events. 524/1340 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7997 event pairs, 360 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 1806. Up to 810 conditions per place. [2024-01-27 14:52:49,939 INFO L140 encePairwiseOnDemand]: 293/319 looper letters, 56 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2024-01-27 14:52:49,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 292 transitions, 712 flow [2024-01-27 14:52:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2024-01-27 14:52:49,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8254963427377221 [2024-01-27 14:52:49,957 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 644 flow. Second operand 3 states and 790 transitions. [2024-01-27 14:52:49,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 292 transitions, 712 flow [2024-01-27 14:52:49,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 292 transitions, 704 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 14:52:49,971 INFO L231 Difference]: Finished difference. Result has 293 places, 292 transitions, 592 flow [2024-01-27 14:52:49,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=293, PETRI_TRANSITIONS=292} [2024-01-27 14:52:49,977 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -26 predicate places. [2024-01-27 14:52:49,977 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 292 transitions, 592 flow [2024-01-27 14:52:49,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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-27 14:52:49,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:49,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 14:52:49,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 14:52:49,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:49,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1204979, now seen corresponding path program 1 times [2024-01-27 14:52:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485026222] [2024-01-27 14:52:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:50,046 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-27 14:52:50,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:50,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485026222] [2024-01-27 14:52:50,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485026222] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:50,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:50,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:52:50,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53959043] [2024-01-27 14:52:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:50,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:50,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:50,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:50,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:50,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 319 [2024-01-27 14:52:50,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 292 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-27 14:52:50,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:50,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 319 [2024-01-27 14:52:50,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:50,210 INFO L124 PetriNetUnfolderBase]: 524/1337 cut-off events. [2024-01-27 14:52:50,210 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 14:52:50,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2180 conditions, 1337 events. 524/1337 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8061 event pairs, 360 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 1989. Up to 821 conditions per place. [2024-01-27 14:52:50,215 INFO L140 encePairwiseOnDemand]: 314/319 looper letters, 52 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-01-27 14:52:50,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 289 transitions, 694 flow [2024-01-27 14:52:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2024-01-27 14:52:50,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2024-01-27 14:52:50,217 INFO L175 Difference]: Start difference. First operand has 293 places, 292 transitions, 592 flow. Second operand 3 states and 792 transitions. [2024-01-27 14:52:50,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 289 transitions, 694 flow [2024-01-27 14:52:50,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:52:50,221 INFO L231 Difference]: Finished difference. Result has 290 places, 289 transitions, 586 flow [2024-01-27 14:52:50,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=290, PETRI_TRANSITIONS=289} [2024-01-27 14:52:50,222 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -29 predicate places. [2024-01-27 14:52:50,223 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 289 transitions, 586 flow [2024-01-27 14:52:50,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-27 14:52:50,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:50,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 14:52:50,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 14:52:50,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:50,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash 37355424, now seen corresponding path program 1 times [2024-01-27 14:52:50,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:50,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226137544] [2024-01-27 14:52:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:50,252 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-27 14:52:50,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:50,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226137544] [2024-01-27 14:52:50,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226137544] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:50,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:50,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:52:50,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796042467] [2024-01-27 14:52:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:50,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:50,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:50,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:50,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 319 [2024-01-27 14:52:50,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 289 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-27 14:52:50,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:50,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 319 [2024-01-27 14:52:50,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:50,472 INFO L124 PetriNetUnfolderBase]: 524/1314 cut-off events. [2024-01-27 14:52:50,472 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 14:52:50,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 1314 events. 524/1314 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8006 event pairs, 360 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 2103. Up to 803 conditions per place. [2024-01-27 14:52:50,477 INFO L140 encePairwiseOnDemand]: 294/319 looper letters, 62 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2024-01-27 14:52:50,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 266 transitions, 668 flow [2024-01-27 14:52:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2024-01-27 14:52:50,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7648902821316614 [2024-01-27 14:52:50,479 INFO L175 Difference]: Start difference. First operand has 290 places, 289 transitions, 586 flow. Second operand 3 states and 732 transitions. [2024-01-27 14:52:50,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 266 transitions, 668 flow [2024-01-27 14:52:50,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 266 transitions, 664 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:52:50,483 INFO L231 Difference]: Finished difference. Result has 267 places, 266 transitions, 540 flow [2024-01-27 14:52:50,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=267, PETRI_TRANSITIONS=266} [2024-01-27 14:52:50,483 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -52 predicate places. [2024-01-27 14:52:50,484 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 266 transitions, 540 flow [2024-01-27 14:52:50,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-27 14:52:50,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:50,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 14:52:50,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 14:52:50,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:50,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1158019324, now seen corresponding path program 1 times [2024-01-27 14:52:50,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:50,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059491912] [2024-01-27 14:52:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:50,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:50,505 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-27 14:52:50,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:50,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059491912] [2024-01-27 14:52:50,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059491912] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:50,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:50,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:52:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788065346] [2024-01-27 14:52:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:50,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:50,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:50,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:50,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 319 [2024-01-27 14:52:50,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 266 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-27 14:52:50,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:50,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 319 [2024-01-27 14:52:50,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:50,655 INFO L124 PetriNetUnfolderBase]: 524/1312 cut-off events. [2024-01-27 14:52:50,655 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 14:52:50,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2154 conditions, 1312 events. 524/1312 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7918 event pairs, 360 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 1918. Up to 822 conditions per place. [2024-01-27 14:52:50,660 INFO L140 encePairwiseOnDemand]: 315/319 looper letters, 51 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-01-27 14:52:50,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 264 transitions, 642 flow [2024-01-27 14:52:50,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 796 transitions. [2024-01-27 14:52:50,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.831765935214211 [2024-01-27 14:52:50,662 INFO L175 Difference]: Start difference. First operand has 267 places, 266 transitions, 540 flow. Second operand 3 states and 796 transitions. [2024-01-27 14:52:50,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 264 transitions, 642 flow [2024-01-27 14:52:50,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 264 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:52:50,665 INFO L231 Difference]: Finished difference. Result has 265 places, 264 transitions, 536 flow [2024-01-27 14:52:50,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=265, PETRI_TRANSITIONS=264} [2024-01-27 14:52:50,666 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -54 predicate places. [2024-01-27 14:52:50,666 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 264 transitions, 536 flow [2024-01-27 14:52:50,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-27 14:52:50,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:50,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 14:52:50,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 14:52:50,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:50,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1538861994, now seen corresponding path program 1 times [2024-01-27 14:52:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:50,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848745288] [2024-01-27 14:52:50,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:50,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:50,685 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-27 14:52:50,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848745288] [2024-01-27 14:52:50,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848745288] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:50,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:50,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:52:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409818017] [2024-01-27 14:52:50,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:50,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:50,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:50,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:50,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 319 [2024-01-27 14:52:50,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 264 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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-27 14:52:50,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:50,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 319 [2024-01-27 14:52:50,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:50,946 INFO L124 PetriNetUnfolderBase]: 807/1879 cut-off events. [2024-01-27 14:52:50,947 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-27 14:52:50,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 1879 events. 807/1879 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12746 event pairs, 294 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 3185. Up to 677 conditions per place. [2024-01-27 14:52:50,954 INFO L140 encePairwiseOnDemand]: 293/319 looper letters, 96 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-01-27 14:52:50,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 264 transitions, 734 flow [2024-01-27 14:52:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2024-01-27 14:52:50,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7669801462904912 [2024-01-27 14:52:50,956 INFO L175 Difference]: Start difference. First operand has 265 places, 264 transitions, 536 flow. Second operand 3 states and 734 transitions. [2024-01-27 14:52:50,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 264 transitions, 734 flow [2024-01-27 14:52:50,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 264 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:52:50,959 INFO L231 Difference]: Finished difference. Result has 242 places, 241 transitions, 494 flow [2024-01-27 14:52:50,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=242, PETRI_TRANSITIONS=241} [2024-01-27 14:52:50,960 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -77 predicate places. [2024-01-27 14:52:50,960 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 241 transitions, 494 flow [2024-01-27 14:52:50,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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-27 14:52:50,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:50,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:52:50,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 14:52:50,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:50,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash 460082809, now seen corresponding path program 1 times [2024-01-27 14:52:50,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:50,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223391247] [2024-01-27 14:52:50,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:50,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:50,978 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-27 14:52:50,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:50,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223391247] [2024-01-27 14:52:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223391247] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:50,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:50,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:52:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601567371] [2024-01-27 14:52:50,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:50,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:50,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:50,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:50,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 319 [2024-01-27 14:52:50,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 241 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 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-27 14:52:50,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:50,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 319 [2024-01-27 14:52:50,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:51,184 INFO L124 PetriNetUnfolderBase]: 807/1873 cut-off events. [2024-01-27 14:52:51,184 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-01-27 14:52:51,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3272 conditions, 1873 events. 807/1873 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12768 event pairs, 624 based on Foata normal form. 0/1153 useless extension candidates. Maximal degree in co-relation 1629. Up to 1309 conditions per place. [2024-01-27 14:52:51,192 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 51 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2024-01-27 14:52:51,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 240 transitions, 598 flow [2024-01-27 14:52:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2024-01-27 14:52:51,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8359456635318704 [2024-01-27 14:52:51,194 INFO L175 Difference]: Start difference. First operand has 242 places, 241 transitions, 494 flow. Second operand 3 states and 800 transitions. [2024-01-27 14:52:51,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 240 transitions, 598 flow [2024-01-27 14:52:51,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 240 transitions, 596 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:52:51,197 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 494 flow [2024-01-27 14:52:51,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2024-01-27 14:52:51,198 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -77 predicate places. [2024-01-27 14:52:51,198 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 494 flow [2024-01-27 14:52:51,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 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-27 14:52:51,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:51,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:52:51,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 14:52:51,199 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:51,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:51,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1377666349, now seen corresponding path program 1 times [2024-01-27 14:52:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617492477] [2024-01-27 14:52:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:51,216 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-27 14:52:51,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:51,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617492477] [2024-01-27 14:52:51,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617492477] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:51,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:51,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:52:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809993899] [2024-01-27 14:52:51,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:51,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:51,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:51,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:51,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:51,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 319 [2024-01-27 14:52:51,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 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-27 14:52:51,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:51,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 319 [2024-01-27 14:52:51,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:51,532 INFO L124 PetriNetUnfolderBase]: 1200/2821 cut-off events. [2024-01-27 14:52:51,533 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-01-27 14:52:51,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5011 conditions, 2821 events. 1200/2821 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 22148 event pairs, 510 based on Foata normal form. 2/1798 useless extension candidates. Maximal degree in co-relation 4985. Up to 1111 conditions per place. [2024-01-27 14:52:51,544 INFO L140 encePairwiseOnDemand]: 297/319 looper letters, 91 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2024-01-27 14:52:51,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 247 transitions, 701 flow [2024-01-27 14:52:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-01-27 14:52:51,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7962382445141066 [2024-01-27 14:52:51,546 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 494 flow. Second operand 3 states and 762 transitions. [2024-01-27 14:52:51,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 247 transitions, 701 flow [2024-01-27 14:52:51,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 247 transitions, 697 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:52:51,553 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 460 flow [2024-01-27 14:52:51,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=223, PETRI_TRANSITIONS=221} [2024-01-27 14:52:51,555 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -96 predicate places. [2024-01-27 14:52:51,555 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 460 flow [2024-01-27 14:52:51,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 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-27 14:52:51,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:51,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:52:51,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 14:52:51,556 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:51,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash -242015110, now seen corresponding path program 1 times [2024-01-27 14:52:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:51,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384263901] [2024-01-27 14:52:51,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:51,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:51,592 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-27 14:52:51,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:51,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384263901] [2024-01-27 14:52:51,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384263901] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:51,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:51,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:52:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674762150] [2024-01-27 14:52:51,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:51,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:51,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:51,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:51,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 319 [2024-01-27 14:52:51,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 221 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 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-27 14:52:51,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:51,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 319 [2024-01-27 14:52:51,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:51,897 INFO L124 PetriNetUnfolderBase]: 1200/2819 cut-off events. [2024-01-27 14:52:51,898 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-01-27 14:52:51,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 2819 events. 1200/2819 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22107 event pairs, 1116 based on Foata normal form. 0/1855 useless extension candidates. Maximal degree in co-relation 2599. Up to 2061 conditions per place. [2024-01-27 14:52:51,911 INFO L140 encePairwiseOnDemand]: 312/319 looper letters, 56 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2024-01-27 14:52:51,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 216 transitions, 566 flow [2024-01-27 14:52:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2024-01-27 14:52:51,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.819226750261233 [2024-01-27 14:52:51,914 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 460 flow. Second operand 3 states and 784 transitions. [2024-01-27 14:52:51,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 216 transitions, 566 flow [2024-01-27 14:52:51,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 216 transitions, 564 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:52:51,917 INFO L231 Difference]: Finished difference. Result has 219 places, 216 transitions, 452 flow [2024-01-27 14:52:51,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=219, PETRI_TRANSITIONS=216} [2024-01-27 14:52:51,919 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -100 predicate places. [2024-01-27 14:52:51,919 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 216 transitions, 452 flow [2024-01-27 14:52:51,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 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-27 14:52:51,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:51,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:52:51,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 14:52:51,920 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:51,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:51,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1087467410, now seen corresponding path program 1 times [2024-01-27 14:52:51,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:51,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267459400] [2024-01-27 14:52:51,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:51,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:51,951 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-27 14:52:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:51,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267459400] [2024-01-27 14:52:51,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267459400] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:51,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:51,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:52:51,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302888941] [2024-01-27 14:52:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:51,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:51,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:51,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:51,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 319 [2024-01-27 14:52:51,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 216 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-27 14:52:51,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:51,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 319 [2024-01-27 14:52:51,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:52,327 INFO L124 PetriNetUnfolderBase]: 1200/2812 cut-off events. [2024-01-27 14:52:52,327 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-01-27 14:52:52,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5075 conditions, 2812 events. 1200/2812 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22074 event pairs, 1116 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 5000. Up to 2059 conditions per place. [2024-01-27 14:52:52,339 INFO L140 encePairwiseOnDemand]: 310/319 looper letters, 56 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2024-01-27 14:52:52,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 209 transitions, 554 flow [2024-01-27 14:52:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2024-01-27 14:52:52,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8150470219435737 [2024-01-27 14:52:52,342 INFO L175 Difference]: Start difference. First operand has 219 places, 216 transitions, 452 flow. Second operand 3 states and 780 transitions. [2024-01-27 14:52:52,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 209 transitions, 554 flow [2024-01-27 14:52:52,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 209 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:52:52,345 INFO L231 Difference]: Finished difference. Result has 212 places, 209 transitions, 438 flow [2024-01-27 14:52:52,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=212, PETRI_TRANSITIONS=209} [2024-01-27 14:52:52,346 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -107 predicate places. [2024-01-27 14:52:52,346 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 209 transitions, 438 flow [2024-01-27 14:52:52,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-27 14:52:52,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:52,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:52:52,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 14:52:52,347 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:52,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash -648247593, now seen corresponding path program 1 times [2024-01-27 14:52:52,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:52,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625379622] [2024-01-27 14:52:52,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:52,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:52,378 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-27 14:52:52,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:52,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625379622] [2024-01-27 14:52:52,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625379622] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:52,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:52:52,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847974060] [2024-01-27 14:52:52,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:52,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:52,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:52,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:52,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 319 [2024-01-27 14:52:52,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 209 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-27 14:52:52,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:52,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 319 [2024-01-27 14:52:52,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:52,739 INFO L124 PetriNetUnfolderBase]: 1200/2806 cut-off events. [2024-01-27 14:52:52,739 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-01-27 14:52:52,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5070 conditions, 2806 events. 1200/2806 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22021 event pairs, 1116 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 4986. Up to 2060 conditions per place. [2024-01-27 14:52:52,751 INFO L140 encePairwiseOnDemand]: 311/319 looper letters, 57 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2024-01-27 14:52:52,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 203 transitions, 544 flow [2024-01-27 14:52:52,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2024-01-27 14:52:52,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8150470219435737 [2024-01-27 14:52:52,753 INFO L175 Difference]: Start difference. First operand has 212 places, 209 transitions, 438 flow. Second operand 3 states and 780 transitions. [2024-01-27 14:52:52,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 203 transitions, 544 flow [2024-01-27 14:52:52,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 203 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:52:52,758 INFO L231 Difference]: Finished difference. Result has 206 places, 203 transitions, 426 flow [2024-01-27 14:52:52,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=206, PETRI_TRANSITIONS=203} [2024-01-27 14:52:52,759 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -113 predicate places. [2024-01-27 14:52:52,760 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 203 transitions, 426 flow [2024-01-27 14:52:52,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-27 14:52:52,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:52,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:52:52,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 14:52:52,761 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:52,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1379162192, now seen corresponding path program 1 times [2024-01-27 14:52:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201583337] [2024-01-27 14:52:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:52,788 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-27 14:52:52,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:52,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201583337] [2024-01-27 14:52:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201583337] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:52,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:52,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:52:52,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678851768] [2024-01-27 14:52:52,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:52,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:52,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:52,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:52,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:52,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 319 [2024-01-27 14:52:52,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 203 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-27 14:52:52,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:52,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 319 [2024-01-27 14:52:52,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:53,086 INFO L124 PetriNetUnfolderBase]: 1200/2802 cut-off events. [2024-01-27 14:52:53,086 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-01-27 14:52:53,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5062 conditions, 2802 events. 1200/2802 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22119 event pairs, 1116 based on Foata normal form. 0/1851 useless extension candidates. Maximal degree in co-relation 4992. Up to 2062 conditions per place. [2024-01-27 14:52:53,098 INFO L140 encePairwiseOnDemand]: 313/319 looper letters, 53 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2024-01-27 14:52:53,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 199 transitions, 528 flow [2024-01-27 14:52:53,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2024-01-27 14:52:53,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2024-01-27 14:52:53,101 INFO L175 Difference]: Start difference. First operand has 206 places, 203 transitions, 426 flow. Second operand 3 states and 792 transitions. [2024-01-27 14:52:53,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 199 transitions, 528 flow [2024-01-27 14:52:53,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 199 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:52:53,105 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 418 flow [2024-01-27 14:52:53,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=202, PETRI_TRANSITIONS=199} [2024-01-27 14:52:53,106 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -117 predicate places. [2024-01-27 14:52:53,106 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 418 flow [2024-01-27 14:52:53,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-27 14:52:53,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:53,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:52:53,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 14:52:53,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:53,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:53,107 INFO L85 PathProgramCache]: Analyzing trace with hash 63432653, now seen corresponding path program 1 times [2024-01-27 14:52:53,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:53,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616262505] [2024-01-27 14:52:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:53,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:53,161 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-27 14:52:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616262505] [2024-01-27 14:52:53,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616262505] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:53,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:53,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 14:52:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216708061] [2024-01-27 14:52:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:53,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:52:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:53,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:52:53,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:52:53,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 319 [2024-01-27 14:52:53,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 199 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-27 14:52:53,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:53,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 319 [2024-01-27 14:52:53,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:53,479 INFO L124 PetriNetUnfolderBase]: 1200/2794 cut-off events. [2024-01-27 14:52:53,479 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-01-27 14:52:53,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 2794 events. 1200/2794 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22056 event pairs, 1116 based on Foata normal form. 4/1855 useless extension candidates. Maximal degree in co-relation 5007. Up to 2066 conditions per place. [2024-01-27 14:52:53,490 INFO L140 encePairwiseOnDemand]: 303/319 looper letters, 53 selfloop transitions, 8 changer transitions 0/191 dead transitions. [2024-01-27 14:52:53,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 191 transitions, 524 flow [2024-01-27 14:52:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:52:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:52:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 772 transitions. [2024-01-27 14:52:53,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8066875653082549 [2024-01-27 14:52:53,493 INFO L175 Difference]: Start difference. First operand has 202 places, 199 transitions, 418 flow. Second operand 3 states and 772 transitions. [2024-01-27 14:52:53,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 191 transitions, 524 flow [2024-01-27 14:52:53,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 191 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:52:53,495 INFO L231 Difference]: Finished difference. Result has 194 places, 191 transitions, 414 flow [2024-01-27 14:52:53,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=194, PETRI_TRANSITIONS=191} [2024-01-27 14:52:53,497 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -125 predicate places. [2024-01-27 14:52:53,497 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 191 transitions, 414 flow [2024-01-27 14:52:53,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-27 14:52:53,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:53,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:52:53,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 14:52:53,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:53,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:53,501 INFO L85 PathProgramCache]: Analyzing trace with hash 291420011, now seen corresponding path program 1 times [2024-01-27 14:52:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092821002] [2024-01-27 14:52:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:53,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:53,593 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-27 14:52:53,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:53,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092821002] [2024-01-27 14:52:53,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092821002] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:53,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:53,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:52:53,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115405806] [2024-01-27 14:52:53,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:53,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 14:52:53,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:53,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 14:52:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 14:52:53,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 319 [2024-01-27 14:52:53,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 191 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 226.2) internal successors, (1131), 5 states have internal predecessors, (1131), 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-27 14:52:53,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:53,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 319 [2024-01-27 14:52:53,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:53,930 INFO L124 PetriNetUnfolderBase]: 1200/2790 cut-off events. [2024-01-27 14:52:53,930 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-01-27 14:52:53,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5070 conditions, 2790 events. 1200/2790 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21986 event pairs, 1116 based on Foata normal form. 4/1859 useless extension candidates. Maximal degree in co-relation 4894. Up to 2062 conditions per place. [2024-01-27 14:52:53,943 INFO L140 encePairwiseOnDemand]: 303/319 looper letters, 59 selfloop transitions, 10 changer transitions 0/187 dead transitions. [2024-01-27 14:52:53,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 187 transitions, 544 flow [2024-01-27 14:52:53,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:52:53,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:52:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1190 transitions. [2024-01-27 14:52:53,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7460815047021944 [2024-01-27 14:52:53,946 INFO L175 Difference]: Start difference. First operand has 194 places, 191 transitions, 414 flow. Second operand 5 states and 1190 transitions. [2024-01-27 14:52:53,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 187 transitions, 544 flow [2024-01-27 14:52:53,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 187 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:52:53,950 INFO L231 Difference]: Finished difference. Result has 191 places, 187 transitions, 420 flow [2024-01-27 14:52:53,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=420, PETRI_PLACES=191, PETRI_TRANSITIONS=187} [2024-01-27 14:52:53,988 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -128 predicate places. [2024-01-27 14:52:53,988 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 187 transitions, 420 flow [2024-01-27 14:52:53,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 226.2) internal successors, (1131), 5 states have internal predecessors, (1131), 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-27 14:52:53,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:53,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:52:53,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 14:52:53,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:53,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash 875609763, now seen corresponding path program 1 times [2024-01-27 14:52:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:53,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254490758] [2024-01-27 14:52:53,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:52:54,071 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-27 14:52:54,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:52:54,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254490758] [2024-01-27 14:52:54,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254490758] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:52:54,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:52:54,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:52:54,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655193860] [2024-01-27 14:52:54,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:52:54,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 14:52:54,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:52:54,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 14:52:54,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 14:52:54,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 319 [2024-01-27 14:52:54,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 187 transitions, 420 flow. Second operand has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 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-27 14:52:54,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:52:54,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 319 [2024-01-27 14:52:54,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:52:54,471 INFO L124 PetriNetUnfolderBase]: 1200/2785 cut-off events. [2024-01-27 14:52:54,471 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-01-27 14:52:54,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5088 conditions, 2785 events. 1200/2785 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21990 event pairs, 510 based on Foata normal form. 0/1875 useless extension candidates. Maximal degree in co-relation 4893. Up to 1111 conditions per place. [2024-01-27 14:52:54,483 INFO L140 encePairwiseOnDemand]: 305/319 looper letters, 97 selfloop transitions, 12 changer transitions 0/211 dead transitions. [2024-01-27 14:52:54,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 211 transitions, 693 flow [2024-01-27 14:52:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:52:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:52:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1034 transitions. [2024-01-27 14:52:54,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6482758620689655 [2024-01-27 14:52:54,486 INFO L175 Difference]: Start difference. First operand has 191 places, 187 transitions, 420 flow. Second operand 5 states and 1034 transitions. [2024-01-27 14:52:54,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 211 transitions, 693 flow [2024-01-27 14:52:54,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 211 transitions, 679 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 14:52:54,489 INFO L231 Difference]: Finished difference. Result has 190 places, 185 transitions, 426 flow [2024-01-27 14:52:54,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=426, PETRI_PLACES=190, PETRI_TRANSITIONS=185} [2024-01-27 14:52:54,490 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -129 predicate places. [2024-01-27 14:52:54,490 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 185 transitions, 426 flow [2024-01-27 14:52:54,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 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-27 14:52:54,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:52:54,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:52:54,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 14:52:54,491 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 14:52:54,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:52:54,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1737671043, now seen corresponding path program 1 times [2024-01-27 14:52:54,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:52:54,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449970085] [2024-01-27 14:52:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:52:54,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:52:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:52:54,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 14:52:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:52:54,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 14:52:54,541 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 14:52:54,541 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 200 remaining) [2024-01-27 14:52:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 200 remaining) [2024-01-27 14:52:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 200 remaining) [2024-01-27 14:52:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 200 remaining) [2024-01-27 14:52:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 200 remaining) [2024-01-27 14:52:54,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 200 remaining) [2024-01-27 14:52:54,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 200 remaining) [2024-01-27 14:52:54,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 200 remaining) [2024-01-27 14:52:54,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 200 remaining) [2024-01-27 14:52:54,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 200 remaining) [2024-01-27 14:52:54,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 200 remaining) [2024-01-27 14:52:54,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 200 remaining) [2024-01-27 14:52:54,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 200 remaining) [2024-01-27 14:52:54,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 200 remaining) [2024-01-27 14:52:54,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 200 remaining) [2024-01-27 14:52:54,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 200 remaining) [2024-01-27 14:52:54,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 200 remaining) [2024-01-27 14:52:54,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 200 remaining) [2024-01-27 14:52:54,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 200 remaining) [2024-01-27 14:52:54,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 200 remaining) [2024-01-27 14:52:54,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 200 remaining) [2024-01-27 14:52:54,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 200 remaining) [2024-01-27 14:52:54,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 200 remaining) [2024-01-27 14:52:54,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 200 remaining) [2024-01-27 14:52:54,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 200 remaining) [2024-01-27 14:52:54,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 200 remaining) [2024-01-27 14:52:54,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 200 remaining) [2024-01-27 14:52:54,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 200 remaining) [2024-01-27 14:52:54,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 200 remaining) [2024-01-27 14:52:54,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 200 remaining) [2024-01-27 14:52:54,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 200 remaining) [2024-01-27 14:52:54,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 200 remaining) [2024-01-27 14:52:54,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 200 remaining) [2024-01-27 14:52:54,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 200 remaining) [2024-01-27 14:52:54,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 200 remaining) [2024-01-27 14:52:54,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 200 remaining) [2024-01-27 14:52:54,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 200 remaining) [2024-01-27 14:52:54,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 200 remaining) [2024-01-27 14:52:54,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 200 remaining) [2024-01-27 14:52:54,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 200 remaining) [2024-01-27 14:52:54,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 200 remaining) [2024-01-27 14:52:54,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 200 remaining) [2024-01-27 14:52:54,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 200 remaining) [2024-01-27 14:52:54,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 200 remaining) [2024-01-27 14:52:54,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 200 remaining) [2024-01-27 14:52:54,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 200 remaining) [2024-01-27 14:52:54,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 200 remaining) [2024-01-27 14:52:54,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 200 remaining) [2024-01-27 14:52:54,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 200 remaining) [2024-01-27 14:52:54,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 200 remaining) [2024-01-27 14:52:54,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 200 remaining) [2024-01-27 14:52:54,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 200 remaining) [2024-01-27 14:52:54,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 200 remaining) [2024-01-27 14:52:54,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 200 remaining) [2024-01-27 14:52:54,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 200 remaining) [2024-01-27 14:52:54,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 200 remaining) [2024-01-27 14:52:54,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 200 remaining) [2024-01-27 14:52:54,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 200 remaining) [2024-01-27 14:52:54,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 200 remaining) [2024-01-27 14:52:54,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 200 remaining) [2024-01-27 14:52:54,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 200 remaining) [2024-01-27 14:52:54,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 200 remaining) [2024-01-27 14:52:54,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 200 remaining) [2024-01-27 14:52:54,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 200 remaining) [2024-01-27 14:52:54,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 200 remaining) [2024-01-27 14:52:54,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 200 remaining) [2024-01-27 14:52:54,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 200 remaining) [2024-01-27 14:52:54,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 200 remaining) [2024-01-27 14:52:54,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 200 remaining) [2024-01-27 14:52:54,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 200 remaining) [2024-01-27 14:52:54,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 200 remaining) [2024-01-27 14:52:54,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 200 remaining) [2024-01-27 14:52:54,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 200 remaining) [2024-01-27 14:52:54,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 200 remaining) [2024-01-27 14:52:54,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 200 remaining) [2024-01-27 14:52:54,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 200 remaining) [2024-01-27 14:52:54,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 200 remaining) [2024-01-27 14:52:54,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 200 remaining) [2024-01-27 14:52:54,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 200 remaining) [2024-01-27 14:52:54,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 200 remaining) [2024-01-27 14:52:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 200 remaining) [2024-01-27 14:52:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 200 remaining) [2024-01-27 14:52:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 200 remaining) [2024-01-27 14:52:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 200 remaining) [2024-01-27 14:52:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 200 remaining) [2024-01-27 14:52:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 200 remaining) [2024-01-27 14:52:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 200 remaining) [2024-01-27 14:52:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 200 remaining) [2024-01-27 14:52:54,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 200 remaining) [2024-01-27 14:52:54,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 200 remaining) [2024-01-27 14:52:54,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 200 remaining) [2024-01-27 14:52:54,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 200 remaining) [2024-01-27 14:52:54,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 200 remaining) [2024-01-27 14:52:54,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 200 remaining) [2024-01-27 14:52:54,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 200 remaining) [2024-01-27 14:52:54,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 200 remaining) [2024-01-27 14:52:54,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 200 remaining) [2024-01-27 14:52:54,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 200 remaining) [2024-01-27 14:52:54,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 200 remaining) [2024-01-27 14:52:54,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 200 remaining) [2024-01-27 14:52:54,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 200 remaining) [2024-01-27 14:52:54,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 200 remaining) [2024-01-27 14:52:54,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 200 remaining) [2024-01-27 14:52:54,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 200 remaining) [2024-01-27 14:52:54,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 200 remaining) [2024-01-27 14:52:54,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 200 remaining) [2024-01-27 14:52:54,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 200 remaining) [2024-01-27 14:52:54,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 200 remaining) [2024-01-27 14:52:54,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 200 remaining) [2024-01-27 14:52:54,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 200 remaining) [2024-01-27 14:52:54,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 200 remaining) [2024-01-27 14:52:54,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 200 remaining) [2024-01-27 14:52:54,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 200 remaining) [2024-01-27 14:52:54,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 200 remaining) [2024-01-27 14:52:54,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 200 remaining) [2024-01-27 14:52:54,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 200 remaining) [2024-01-27 14:52:54,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 200 remaining) [2024-01-27 14:52:54,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 200 remaining) [2024-01-27 14:52:54,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 200 remaining) [2024-01-27 14:52:54,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 200 remaining) [2024-01-27 14:52:54,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 200 remaining) [2024-01-27 14:52:54,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 200 remaining) [2024-01-27 14:52:54,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 200 remaining) [2024-01-27 14:52:54,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 200 remaining) [2024-01-27 14:52:54,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 200 remaining) [2024-01-27 14:52:54,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 200 remaining) [2024-01-27 14:52:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 200 remaining) [2024-01-27 14:52:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 200 remaining) [2024-01-27 14:52:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 200 remaining) [2024-01-27 14:52:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 200 remaining) [2024-01-27 14:52:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 200 remaining) [2024-01-27 14:52:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 200 remaining) [2024-01-27 14:52:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 200 remaining) [2024-01-27 14:52:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 200 remaining) [2024-01-27 14:52:54,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 200 remaining) [2024-01-27 14:52:54,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 200 remaining) [2024-01-27 14:52:54,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 200 remaining) [2024-01-27 14:52:54,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 200 remaining) [2024-01-27 14:52:54,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 200 remaining) [2024-01-27 14:52:54,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 200 remaining) [2024-01-27 14:52:54,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 200 remaining) [2024-01-27 14:52:54,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 200 remaining) [2024-01-27 14:52:54,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 200 remaining) [2024-01-27 14:52:54,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 200 remaining) [2024-01-27 14:52:54,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 200 remaining) [2024-01-27 14:52:54,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 200 remaining) [2024-01-27 14:52:54,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 200 remaining) [2024-01-27 14:52:54,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 200 remaining) [2024-01-27 14:52:54,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 200 remaining) [2024-01-27 14:52:54,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 200 remaining) [2024-01-27 14:52:54,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 200 remaining) [2024-01-27 14:52:54,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 200 remaining) [2024-01-27 14:52:54,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 200 remaining) [2024-01-27 14:52:54,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 200 remaining) [2024-01-27 14:52:54,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 200 remaining) [2024-01-27 14:52:54,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 200 remaining) [2024-01-27 14:52:54,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 200 remaining) [2024-01-27 14:52:54,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 200 remaining) [2024-01-27 14:52:54,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 200 remaining) [2024-01-27 14:52:54,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONERROR_FUNCTION (40 of 200 remaining) [2024-01-27 14:52:54,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 200 remaining) [2024-01-27 14:52:54,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 200 remaining) [2024-01-27 14:52:54,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 200 remaining) [2024-01-27 14:52:54,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 200 remaining) [2024-01-27 14:52:54,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 200 remaining) [2024-01-27 14:52:54,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 200 remaining) [2024-01-27 14:52:54,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 200 remaining) [2024-01-27 14:52:54,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 200 remaining) [2024-01-27 14:52:54,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 200 remaining) [2024-01-27 14:52:54,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 200 remaining) [2024-01-27 14:52:54,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 200 remaining) [2024-01-27 14:52:54,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 200 remaining) [2024-01-27 14:52:54,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 200 remaining) [2024-01-27 14:52:54,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 200 remaining) [2024-01-27 14:52:54,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 200 remaining) [2024-01-27 14:52:54,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 200 remaining) [2024-01-27 14:52:54,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 200 remaining) [2024-01-27 14:52:54,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 200 remaining) [2024-01-27 14:52:54,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 200 remaining) [2024-01-27 14:52:54,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 200 remaining) [2024-01-27 14:52:54,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 200 remaining) [2024-01-27 14:52:54,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 200 remaining) [2024-01-27 14:52:54,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 200 remaining) [2024-01-27 14:52:54,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 200 remaining) [2024-01-27 14:52:54,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 200 remaining) [2024-01-27 14:52:54,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 200 remaining) [2024-01-27 14:52:54,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 200 remaining) [2024-01-27 14:52:54,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 200 remaining) [2024-01-27 14:52:54,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 200 remaining) [2024-01-27 14:52:54,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 200 remaining) [2024-01-27 14:52:54,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 200 remaining) [2024-01-27 14:52:54,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 200 remaining) [2024-01-27 14:52:54,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 200 remaining) [2024-01-27 14:52:54,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 200 remaining) [2024-01-27 14:52:54,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 200 remaining) [2024-01-27 14:52:54,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 200 remaining) [2024-01-27 14:52:54,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 200 remaining) [2024-01-27 14:52:54,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 200 remaining) [2024-01-27 14:52:54,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 200 remaining) [2024-01-27 14:52:54,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 200 remaining) [2024-01-27 14:52:54,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-27 14:52:54,570 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:52:54,576 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 14:52:54,576 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 14:52:54,631 INFO L503 ceAbstractionStarter]: Automizer considered 159 witness invariants [2024-01-27 14:52:54,631 INFO L504 ceAbstractionStarter]: WitnessConsidered=159 [2024-01-27 14:52:54,632 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 02:52:54 BasicIcfg [2024-01-27 14:52:54,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 14:52:54,633 INFO L158 Benchmark]: Toolchain (without parser) took 6922.57ms. Allocated memory was 176.2MB in the beginning and 692.1MB in the end (delta: 515.9MB). Free memory was 112.7MB in the beginning and 285.2MB in the end (delta: -172.5MB). Peak memory consumption was 345.4MB. Max. memory is 16.1GB. [2024-01-27 14:52:54,633 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:52:54,633 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:52:54,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.88ms. Allocated memory is still 176.2MB. Free memory was 112.7MB in the beginning and 87.0MB in the end (delta: 25.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-27 14:52:54,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.14ms. Allocated memory is still 176.2MB. Free memory was 87.0MB in the beginning and 83.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:52:54,634 INFO L158 Benchmark]: Boogie Preprocessor took 75.68ms. Allocated memory is still 176.2MB. Free memory was 83.9MB in the beginning and 80.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 14:52:54,634 INFO L158 Benchmark]: RCFGBuilder took 893.56ms. Allocated memory is still 176.2MB. Free memory was 80.2MB in the beginning and 67.3MB in the end (delta: 12.9MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-01-27 14:52:54,634 INFO L158 Benchmark]: TraceAbstraction took 5516.67ms. Allocated memory was 176.2MB in the beginning and 692.1MB in the end (delta: 515.9MB). Free memory was 66.5MB in the beginning and 285.2MB in the end (delta: -218.8MB). Peak memory consumption was 296.7MB. Max. memory is 16.1GB. [2024-01-27 14:52:54,635 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.88ms. Allocated memory is still 176.2MB. Free memory was 112.7MB in the beginning and 87.0MB in the end (delta: 25.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.14ms. Allocated memory is still 176.2MB. Free memory was 87.0MB in the beginning and 83.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.68ms. Allocated memory is still 176.2MB. Free memory was 83.9MB in the beginning and 80.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 893.56ms. Allocated memory is still 176.2MB. Free memory was 80.2MB in the beginning and 67.3MB in the end (delta: 12.9MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5516.67ms. Allocated memory was 176.2MB in the beginning and 692.1MB in the end (delta: 515.9MB). Free memory was 66.5MB in the beginning and 285.2MB in the end (delta: -218.8MB). Peak memory consumption was 296.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 112]: 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; [L83] pthread_t t1, t2; VAL [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={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [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={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]] VAL [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={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [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={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]]] VAL [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={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [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={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [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={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [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={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] VAL [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={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] VAL [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={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] VAL [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={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] [L85] N = __VERIFIER_nondet_int() [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [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={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]]] VAL [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={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] VAL [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={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] VAL [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={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [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={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] VAL [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={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]] VAL [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={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [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={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [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={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] [L86] n1 = __VERIFIER_nondet_int() [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] [L87] n2 = __VERIFIER_nondet_int() [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] [L88] q1_front = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] [L89] q1_back = q1_front VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] [L90] q2_front = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] [L91] q2_back = q2_front VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] [L92] CALL create_fresh_int_array(n1) [L108] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L108] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L108] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] [L108] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L108] RET assume_abort_if_not(size >= 0) [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] [L109] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE !(!cond) [L109] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L111] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L111] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L111] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] [L111] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L112] int i = 0; VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[14LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[12LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[10LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[8LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[6LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[4LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[2LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[16LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] COND TRUE i < size VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[15LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[13LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[11LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[9LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[7LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[5LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[3LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IntegerLiteral[9],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2147483646]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[17LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] [L113] arr[i] = __VERIFIER_nondet_int() [L112] i++ VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - 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: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: 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: 52]: 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: 54]: 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: 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: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: 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: 67]: 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: 68]: 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: 70]: 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: 72]: 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: 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: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: 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: 86]: 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: 86]: 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: 86]: 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: 86]: 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: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: 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: 88]: 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: 88]: 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: 88]: 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: 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: 89]: 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: 89]: 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: 89]: 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: 90]: 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: 90]: 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: 90]: 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: 91]: 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: 91]: 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: 92]: 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: 92]: 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: 108]: 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: 109]: 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: 111]: 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: 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: 112]: 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: 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: 115]: 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: 115]: 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: 115]: 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: 115]: 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: 115]: 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: 93]: 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: 93]: 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: 112]: 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: 112]: 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: 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: 109]: 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: 111]: 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: 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: 112]: 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: 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: 115]: 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: 115]: 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: 115]: 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: 115]: 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: 115]: 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: 96]: 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: 96]: 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: 112]: 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: 102]: 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: 96]: 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: 97]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 378 locations, 200 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: 5.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 965 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 513 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 293 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1997 IncrementalHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 293 mSolverCounterUnsat, 196 mSDtfsCounter, 1997 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=644occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 653 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-27 14:52:54,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE