./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-collitem-trans.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/chl-collitem-trans.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/chl-collitem-trans.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-collitem-trans.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:50:23,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 14:50:23,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 14:50:23,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 14:50:23,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 14:50:23,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 14:50:23,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 14:50:23,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 14:50:23,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 14:50:23,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 14:50:23,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 14:50:23,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 14:50:23,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 14:50:24,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 14:50:24,001 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 14:50:24,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 14:50:24,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 14:50:24,001 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 14:50:24,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 14:50:24,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 14:50:24,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 14:50:24,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 14:50:24,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 14:50:24,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 14:50:24,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 14:50:24,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 14:50:24,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 14:50:24,004 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 14:50:24,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 14:50:24,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 14:50:24,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 14:50:24,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 14:50:24,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:50:24,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 14:50:24,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 14:50:24,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 14:50:24,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 14:50:24,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 14:50:24,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 14:50:24,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 14:50:24,007 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 14:50:24,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 14:50:24,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 14:50:24,007 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:50:24,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 14:50:24,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 14:50:24,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 14:50:24,237 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 14:50:24,237 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 14:50:24,239 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/chl-collitem-trans.wvr.yml/witness.yml [2024-01-27 14:50:24,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 14:50:24,405 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 14:50:24,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-collitem-trans.wvr.c [2024-01-27 14:50:25,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 14:50:25,659 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 14:50:25,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-trans.wvr.c [2024-01-27 14:50:25,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91e52d5c/8cb1f3014566467a8878dd814979e7bf/FLAG4ec86a9b4 [2024-01-27 14:50:25,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91e52d5c/8cb1f3014566467a8878dd814979e7bf [2024-01-27 14:50:25,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 14:50:25,706 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 14:50:25,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 14:50:25,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 14:50:25,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 14:50:25,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:24" (1/2) ... [2024-01-27 14:50:25,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbfa9e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:25, skipping insertion in model container [2024-01-27 14:50:25,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:24" (1/2) ... [2024-01-27 14:50:25,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@72e2cdca and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:25, skipping insertion in model container [2024-01-27 14:50:25,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:50:25" (2/2) ... [2024-01-27 14:50:25,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbfa9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:25, skipping insertion in model container [2024-01-27 14:50:25,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:50:25" (2/2) ... [2024-01-27 14:50:25,719 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 14:50:25,763 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 14:50:25,765 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,765 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardId_10 == 0 [2024-01-27 14:50:25,765 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardSet_8 == 0 [2024-01-27 14:50:25,765 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardType_3 == 0 [2024-01-27 14:50:25,766 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardId_6 == 0 [2024-01-27 14:50:25,766 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardType_11 == 0 [2024-01-27 14:50:25,766 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] result_13 == 0 [2024-01-27 14:50:25,766 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardRarity_9 == 0 [2024-01-27 14:50:25,766 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] result_12 == 0 [2024-01-27 14:50:25,766 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardSet_4 == 0 [2024-01-27 14:50:25,766 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardRarity_5 == 0 [2024-01-27 14:50:25,767 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] result_14 == 0 [2024-01-27 14:50:25,767 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardType_7 == 0 [2024-01-27 14:50:25,767 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,767 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,767 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,767 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,767 INFO L98 nessWitnessExtractor]: Location invariant before [L106-L106] 1 <= b [2024-01-27 14:50:25,767 INFO L98 nessWitnessExtractor]: Location invariant before [L106-L106] b != 0 [2024-01-27 14:50:25,768 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] result_13 == 0 [2024-01-27 14:50:25,768 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] result_14 == 0 [2024-01-27 14:50:25,768 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] cardId_10 == 0 [2024-01-27 14:50:25,769 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] cardType_11 == 0 [2024-01-27 14:50:25,769 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] result_12 == 0 [2024-01-27 14:50:25,769 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,769 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardSet_0 == 0 [2024-01-27 14:50:25,769 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardId_6 == 0 [2024-01-27 14:50:25,769 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardSet_8 == 0 [2024-01-27 14:50:25,769 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardId_2 == 0 [2024-01-27 14:50:25,769 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] result_12 == 0 [2024-01-27 14:50:25,770 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardRarity_5 == 0 [2024-01-27 14:50:25,770 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] result_14 == 0 [2024-01-27 14:50:25,770 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardId_10 == 0 [2024-01-27 14:50:25,770 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardSet_4 == 0 [2024-01-27 14:50:25,770 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardType_3 == 0 [2024-01-27 14:50:25,770 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardRarity_9 == 0 [2024-01-27 14:50:25,771 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardRarity_1 == 0 [2024-01-27 14:50:25,771 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardType_7 == 0 [2024-01-27 14:50:25,772 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] result_13 == 0 [2024-01-27 14:50:25,772 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardType_11 == 0 [2024-01-27 14:50:25,772 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,772 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] result_14 == 0 [2024-01-27 14:50:25,773 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] cardType_11 == 0 [2024-01-27 14:50:25,773 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] result_13 == 0 [2024-01-27 14:50:25,773 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] result_12 == 0 [2024-01-27 14:50:25,773 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,773 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,773 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardRarity_5 == 0 [2024-01-27 14:50:25,774 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardSet_8 == 0 [2024-01-27 14:50:25,774 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] result_12 == 0 [2024-01-27 14:50:25,774 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardId_10 == 0 [2024-01-27 14:50:25,774 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardSet_4 == 0 [2024-01-27 14:50:25,774 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] result_14 == 0 [2024-01-27 14:50:25,775 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardId_6 == 0 [2024-01-27 14:50:25,775 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardRarity_9 == 0 [2024-01-27 14:50:25,775 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardType_7 == 0 [2024-01-27 14:50:25,776 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] result_13 == 0 [2024-01-27 14:50:25,776 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardType_11 == 0 [2024-01-27 14:50:25,776 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] result_12 == 0 [2024-01-27 14:50:25,776 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardSet_8 == 0 [2024-01-27 14:50:25,777 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardRarity_9 == 0 [2024-01-27 14:50:25,777 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardId_10 == 0 [2024-01-27 14:50:25,777 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] result_14 == 0 [2024-01-27 14:50:25,777 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] result_13 == 0 [2024-01-27 14:50:25,777 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardType_11 == 0 [2024-01-27 14:50:25,777 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardId_6 == 0 [2024-01-27 14:50:25,777 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] result_12 == 0 [2024-01-27 14:50:25,777 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] result_14 == 0 [2024-01-27 14:50:25,778 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardRarity_9 == 0 [2024-01-27 14:50:25,778 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardSet_8 == 0 [2024-01-27 14:50:25,778 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardId_10 == 0 [2024-01-27 14:50:25,778 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardType_7 == 0 [2024-01-27 14:50:25,778 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] result_13 == 0 [2024-01-27 14:50:25,778 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardType_11 == 0 [2024-01-27 14:50:25,779 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardType_3 == 0 [2024-01-27 14:50:25,779 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardType_11 == 0 [2024-01-27 14:50:25,781 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] result_13 == 0 [2024-01-27 14:50:25,782 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardType_7 == 0 [2024-01-27 14:50:25,782 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardId_10 == 0 [2024-01-27 14:50:25,782 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardId_6 == 0 [2024-01-27 14:50:25,782 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardSet_8 == 0 [2024-01-27 14:50:25,782 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] result_12 == 0 [2024-01-27 14:50:25,782 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] result_14 == 0 [2024-01-27 14:50:25,782 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardRarity_5 == 0 [2024-01-27 14:50:25,782 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardSet_4 == 0 [2024-01-27 14:50:25,783 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardId_2 == 0 [2024-01-27 14:50:25,783 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardRarity_9 == 0 [2024-01-27 14:50:25,783 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,783 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,783 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardRarity_9 == 0 [2024-01-27 14:50:25,783 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardType_11 == 0 [2024-01-27 14:50:25,783 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] result_13 == 0 [2024-01-27 14:50:25,783 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardId_10 == 0 [2024-01-27 14:50:25,784 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] result_12 == 0 [2024-01-27 14:50:25,784 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] result_14 == 0 [2024-01-27 14:50:25,784 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardSet_8 == 0 [2024-01-27 14:50:25,784 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardType_7 == 0 [2024-01-27 14:50:25,784 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_14 == 0 [2024-01-27 14:50:25,784 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_12 == 0 [2024-01-27 14:50:25,784 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] cardType_11 == 0 [2024-01-27 14:50:25,784 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_13 == 0 [2024-01-27 14:50:25,785 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-27 14:50:25,785 INFO L98 nessWitnessExtractor]: Location invariant before [L107-L107] b <= -1 [2024-01-27 14:50:25,785 INFO L98 nessWitnessExtractor]: Location invariant before [L107-L107] b != 0 [2024-01-27 14:50:25,785 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] cardRarity_9 == 0 [2024-01-27 14:50:25,785 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] cardId_10 == 0 [2024-01-27 14:50:25,786 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] cardType_11 == 0 [2024-01-27 14:50:25,786 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] result_14 == 0 [2024-01-27 14:50:25,786 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] result_13 == 0 [2024-01-27 14:50:25,787 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] result_12 == 0 [2024-01-27 14:50:25,787 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardSet_8 == 0 [2024-01-27 14:50:25,787 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardId_10 == 0 [2024-01-27 14:50:25,788 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardRarity_5 == 0 [2024-01-27 14:50:25,788 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] result_14 == 0 [2024-01-27 14:50:25,788 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardType_7 == 0 [2024-01-27 14:50:25,789 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardType_11 == 0 [2024-01-27 14:50:25,789 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] result_12 == 0 [2024-01-27 14:50:25,789 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardRarity_9 == 0 [2024-01-27 14:50:25,789 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] result_13 == 0 [2024-01-27 14:50:25,789 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardId_6 == 0 [2024-01-27 14:50:25,790 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] result_12 == 0 [2024-01-27 14:50:25,790 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] result_14 == 0 [2024-01-27 14:50:25,790 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] result_13 == 0 [2024-01-27 14:50:25,790 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardId_10 == 0 [2024-01-27 14:50:25,790 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardRarity_9 == 0 [2024-01-27 14:50:25,790 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardType_11 == 0 [2024-01-27 14:50:25,790 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] result_12 == 0 [2024-01-27 14:50:25,790 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardId_2 == 0 [2024-01-27 14:50:25,791 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardSet_4 == 0 [2024-01-27 14:50:25,791 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardRarity_1 == 0 [2024-01-27 14:50:25,791 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardType_7 == 0 [2024-01-27 14:50:25,791 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardType_3 == 0 [2024-01-27 14:50:25,791 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardRarity_5 == 0 [2024-01-27 14:50:25,791 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] result_14 == 0 [2024-01-27 14:50:25,791 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardSet_8 == 0 [2024-01-27 14:50:25,791 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] result_13 == 0 [2024-01-27 14:50:25,792 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardId_6 == 0 [2024-01-27 14:50:25,814 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 14:50:25,962 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/chl-collitem-trans.wvr.c[3520,3533] [2024-01-27 14:50:25,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:50:25,988 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 14:50:25,999 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 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:50:26,081 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/chl-collitem-trans.wvr.c[3520,3533] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 14:50:26,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:50:26,112 INFO L206 MainTranslator]: Completed translation [2024-01-27 14:50:26,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26 WrapperNode [2024-01-27 14:50:26,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 14:50:26,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 14:50:26,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 14:50:26,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 14:50:26,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,179 INFO L138 Inliner]: procedures = 23, calls = 45, calls flagged for inlining = 17, calls inlined = 39, statements flattened = 540 [2024-01-27 14:50:26,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 14:50:26,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 14:50:26,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 14:50:26,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 14:50:26,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,228 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 14:50:26,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 14:50:26,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 14:50:26,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 14:50:26,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 14:50:26,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (1/1) ... [2024-01-27 14:50:26,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:50:26,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:50:26,331 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:50:26,356 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:50:26,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 14:50:26,385 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 14:50:26,386 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 14:50:26,386 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 14:50:26,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 14:50:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 14:50:26,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 14:50:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 14:50:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 14:50:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 14:50:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 14:50:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 14:50:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 14:50:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 14:50:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 14:50:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 14:50:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 14:50:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 14:50:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 14:50:26,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 14:50:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 14:50:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 14:50:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 14:50:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 14:50:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 14:50:26,396 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:50:26,485 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 14:50:26,487 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 14:50:27,109 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 14:50:27,110 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 14:50:27,970 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 14:50:27,971 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 14:50:27,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:50:27 BoogieIcfgContainer [2024-01-27 14:50:27,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 14:50:27,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 14:50:27,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 14:50:27,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 14:50:27,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:24" (1/4) ... [2024-01-27 14:50:27,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f2664f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:50:27, skipping insertion in model container [2024-01-27 14:50:27,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 02:50:25" (2/4) ... [2024-01-27 14:50:27,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f2664f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:50:27, skipping insertion in model container [2024-01-27 14:50:27,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:26" (3/4) ... [2024-01-27 14:50:27,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f2664f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:50:27, skipping insertion in model container [2024-01-27 14:50:27,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:50:27" (4/4) ... [2024-01-27 14:50:27,981 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2024-01-27 14:50:27,996 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 14:50:27,996 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 178 error locations. [2024-01-27 14:50:27,996 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 14:50:28,263 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 14:50:28,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 324 transitions, 669 flow [2024-01-27 14:50:28,414 INFO L124 PetriNetUnfolderBase]: 0/321 cut-off events. [2024-01-27 14:50:28,415 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 14:50:28,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 321 events. 0/321 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 572 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-27 14:50:28,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 324 transitions, 669 flow [2024-01-27 14:50:28,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 320 transitions, 658 flow [2024-01-27 14:50:28,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 14:50:28,445 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;@4d81d65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 14:50:28,445 INFO L358 AbstractCegarLoop]: Starting to check reachability of 241 error locations. [2024-01-27 14:50:28,447 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 14:50:28,447 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 14:50:28,447 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:50:28,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:28,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 14:50:28,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:28,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 66390, now seen corresponding path program 1 times [2024-01-27 14:50:28,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:28,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457046392] [2024-01-27 14:50:28,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:28,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:28,698 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:50:28,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:28,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457046392] [2024-01-27 14:50:28,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457046392] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:28,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:28,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:28,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028962444] [2024-01-27 14:50:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:28,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:28,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:28,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:28,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:28,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 324 [2024-01-27 14:50:28,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 320 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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:50:28,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:28,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 324 [2024-01-27 14:50:28,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:29,036 INFO L124 PetriNetUnfolderBase]: 564/1190 cut-off events. [2024-01-27 14:50:29,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:50:29,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 1190 events. 564/1190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6657 event pairs, 564 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 1899. Up to 877 conditions per place. [2024-01-27 14:50:29,046 INFO L140 encePairwiseOnDemand]: 265/324 looper letters, 42 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-01-27 14:50:29,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 250 transitions, 597 flow [2024-01-27 14:50:29,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 740 transitions. [2024-01-27 14:50:29,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7613168724279835 [2024-01-27 14:50:29,060 INFO L175 Difference]: Start difference. First operand has 330 places, 320 transitions, 658 flow. Second operand 3 states and 740 transitions. [2024-01-27 14:50:29,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 250 transitions, 597 flow [2024-01-27 14:50:29,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 250 transitions, 594 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 14:50:29,068 INFO L231 Difference]: Finished difference. Result has 259 places, 250 transitions, 510 flow [2024-01-27 14:50:29,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=259, PETRI_TRANSITIONS=250} [2024-01-27 14:50:29,072 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -71 predicate places. [2024-01-27 14:50:29,073 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 250 transitions, 510 flow [2024-01-27 14:50:29,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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:50:29,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:29,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 14:50:29,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 14:50:29,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:29,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2059997, now seen corresponding path program 1 times [2024-01-27 14:50:29,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:29,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870439305] [2024-01-27 14:50:29,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:29,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:29,104 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:50:29,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:29,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870439305] [2024-01-27 14:50:29,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870439305] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:29,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:29,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:29,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699128244] [2024-01-27 14:50:29,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:29,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:29,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:29,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:29,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:29,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 324 [2024-01-27 14:50:29,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 250 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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:50:29,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:29,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 324 [2024-01-27 14:50:29,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:29,311 INFO L124 PetriNetUnfolderBase]: 564/1177 cut-off events. [2024-01-27 14:50:29,312 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 14:50:29,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 1177 events. 564/1177 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6655 event pairs, 564 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 1910. Up to 900 conditions per place. [2024-01-27 14:50:29,318 INFO L140 encePairwiseOnDemand]: 310/324 looper letters, 43 selfloop transitions, 1 changer transitions 0/237 dead transitions. [2024-01-27 14:50:29,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 237 transitions, 572 flow [2024-01-27 14:50:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2024-01-27 14:50:29,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7129629629629629 [2024-01-27 14:50:29,321 INFO L175 Difference]: Start difference. First operand has 259 places, 250 transitions, 510 flow. Second operand 3 states and 693 transitions. [2024-01-27 14:50:29,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 237 transitions, 572 flow [2024-01-27 14:50:29,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 237 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:29,325 INFO L231 Difference]: Finished difference. Result has 246 places, 237 transitions, 482 flow [2024-01-27 14:50:29,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=246, PETRI_TRANSITIONS=237} [2024-01-27 14:50:29,326 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -84 predicate places. [2024-01-27 14:50:29,326 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 237 transitions, 482 flow [2024-01-27 14:50:29,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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:50:29,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:29,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 14:50:29,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 14:50:29,327 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:29,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash 63861894, now seen corresponding path program 1 times [2024-01-27 14:50:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:29,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406331584] [2024-01-27 14:50:29,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:29,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:29,383 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:50:29,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:29,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406331584] [2024-01-27 14:50:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406331584] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:29,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629292188] [2024-01-27 14:50:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:29,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:29,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:29,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:29,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:29,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 324 [2024-01-27 14:50:29,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 237 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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:50:29,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:29,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 324 [2024-01-27 14:50:29,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:29,590 INFO L124 PetriNetUnfolderBase]: 564/1169 cut-off events. [2024-01-27 14:50:29,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:50:29,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2131 conditions, 1169 events. 564/1169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6642 event pairs, 564 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 2125. Up to 881 conditions per place. [2024-01-27 14:50:29,597 INFO L140 encePairwiseOnDemand]: 314/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2024-01-27 14:50:29,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 229 transitions, 546 flow [2024-01-27 14:50:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2024-01-27 14:50:29,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7314814814814815 [2024-01-27 14:50:29,599 INFO L175 Difference]: Start difference. First operand has 246 places, 237 transitions, 482 flow. Second operand 3 states and 711 transitions. [2024-01-27 14:50:29,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 229 transitions, 546 flow [2024-01-27 14:50:29,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 229 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:50:29,602 INFO L231 Difference]: Finished difference. Result has 239 places, 229 transitions, 469 flow [2024-01-27 14:50:29,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=239, PETRI_TRANSITIONS=229} [2024-01-27 14:50:29,603 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -91 predicate places. [2024-01-27 14:50:29,603 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 229 transitions, 469 flow [2024-01-27 14:50:29,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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:50:29,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:29,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 14:50:29,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 14:50:29,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:29,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1979720808, now seen corresponding path program 1 times [2024-01-27 14:50:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063390432] [2024-01-27 14:50:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:29,629 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:50:29,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:29,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063390432] [2024-01-27 14:50:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063390432] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:29,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:29,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024350011] [2024-01-27 14:50:29,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:29,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:29,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:29,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:29,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-27 14:50:29,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 229 transitions, 469 flow. Second operand has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 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:50:29,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:29,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-27 14:50:29,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:29,794 INFO L124 PetriNetUnfolderBase]: 564/1167 cut-off events. [2024-01-27 14:50:29,795 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 14:50:29,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 1167 events. 564/1167 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6682 event pairs, 564 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 2118. Up to 887 conditions per place. [2024-01-27 14:50:29,800 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2024-01-27 14:50:29,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 227 transitions, 533 flow [2024-01-27 14:50:29,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2024-01-27 14:50:29,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7561728395061729 [2024-01-27 14:50:29,802 INFO L175 Difference]: Start difference. First operand has 239 places, 229 transitions, 469 flow. Second operand 3 states and 735 transitions. [2024-01-27 14:50:29,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 227 transitions, 533 flow [2024-01-27 14:50:29,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 227 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:29,805 INFO L231 Difference]: Finished difference. Result has 237 places, 227 transitions, 465 flow [2024-01-27 14:50:29,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=465, PETRI_PLACES=237, PETRI_TRANSITIONS=227} [2024-01-27 14:50:29,806 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -93 predicate places. [2024-01-27 14:50:29,806 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 227 transitions, 465 flow [2024-01-27 14:50:29,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 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:50:29,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:29,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 14:50:29,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 14:50:29,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:29,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1241804932, now seen corresponding path program 1 times [2024-01-27 14:50:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:29,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392305284] [2024-01-27 14:50:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:29,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:29,830 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:50:29,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:29,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392305284] [2024-01-27 14:50:29,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392305284] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:29,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:29,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:29,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852457691] [2024-01-27 14:50:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:29,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:29,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:29,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:29,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:29,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 324 [2024-01-27 14:50:29,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 227 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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:50:29,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:29,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 324 [2024-01-27 14:50:29,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:29,976 INFO L124 PetriNetUnfolderBase]: 564/1157 cut-off events. [2024-01-27 14:50:29,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:50:29,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 1157 events. 564/1157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6673 event pairs, 564 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 2114. Up to 879 conditions per place. [2024-01-27 14:50:29,982 INFO L140 encePairwiseOnDemand]: 312/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2024-01-27 14:50:29,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 217 transitions, 525 flow [2024-01-27 14:50:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2024-01-27 14:50:29,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.727366255144033 [2024-01-27 14:50:29,985 INFO L175 Difference]: Start difference. First operand has 237 places, 227 transitions, 465 flow. Second operand 3 states and 707 transitions. [2024-01-27 14:50:29,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 217 transitions, 525 flow [2024-01-27 14:50:29,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 217 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:29,988 INFO L231 Difference]: Finished difference. Result has 227 places, 217 transitions, 445 flow [2024-01-27 14:50:29,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=227, PETRI_TRANSITIONS=217} [2024-01-27 14:50:29,989 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -103 predicate places. [2024-01-27 14:50:29,989 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 217 transitions, 445 flow [2024-01-27 14:50:29,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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:50:29,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:29,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:29,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 14:50:29,990 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:29,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash -158750849, now seen corresponding path program 1 times [2024-01-27 14:50:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:29,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497223589] [2024-01-27 14:50:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:29,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:30,012 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:50:30,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:30,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497223589] [2024-01-27 14:50:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497223589] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:30,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132194878] [2024-01-27 14:50:30,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:30,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:30,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:30,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:30,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:30,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2024-01-27 14:50:30,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 217 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 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:50:30,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:30,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2024-01-27 14:50:30,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:30,173 INFO L124 PetriNetUnfolderBase]: 564/1153 cut-off events. [2024-01-27 14:50:30,173 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 14:50:30,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 1153 events. 564/1153 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6656 event pairs, 564 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 2105. Up to 885 conditions per place. [2024-01-27 14:50:30,179 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2024-01-27 14:50:30,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 213 transitions, 507 flow [2024-01-27 14:50:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2024-01-27 14:50:30,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-27 14:50:30,181 INFO L175 Difference]: Start difference. First operand has 227 places, 217 transitions, 445 flow. Second operand 3 states and 729 transitions. [2024-01-27 14:50:30,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 213 transitions, 507 flow [2024-01-27 14:50:30,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 213 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:30,184 INFO L231 Difference]: Finished difference. Result has 223 places, 213 transitions, 437 flow [2024-01-27 14:50:30,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=223, PETRI_TRANSITIONS=213} [2024-01-27 14:50:30,185 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -107 predicate places. [2024-01-27 14:50:30,185 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 213 transitions, 437 flow [2024-01-27 14:50:30,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 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:50:30,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:30,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:30,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 14:50:30,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:30,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash -626306855, now seen corresponding path program 1 times [2024-01-27 14:50:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306665572] [2024-01-27 14:50:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:30,207 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:50:30,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:30,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306665572] [2024-01-27 14:50:30,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306665572] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:30,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:30,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:30,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990628212] [2024-01-27 14:50:30,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:30,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:30,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:30,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:30,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:30,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 324 [2024-01-27 14:50:30,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 213 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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:50:30,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:30,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 324 [2024-01-27 14:50:30,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:30,360 INFO L124 PetriNetUnfolderBase]: 564/1130 cut-off events. [2024-01-27 14:50:30,360 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 14:50:30,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2091 conditions, 1130 events. 564/1130 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 6221 event pairs, 439 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 2084. Up to 697 conditions per place. [2024-01-27 14:50:30,366 INFO L140 encePairwiseOnDemand]: 316/324 looper letters, 47 selfloop transitions, 3 changer transitions 0/221 dead transitions. [2024-01-27 14:50:30,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 221 transitions, 557 flow [2024-01-27 14:50:30,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2024-01-27 14:50:30,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.757201646090535 [2024-01-27 14:50:30,368 INFO L175 Difference]: Start difference. First operand has 223 places, 213 transitions, 437 flow. Second operand 3 states and 736 transitions. [2024-01-27 14:50:30,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 221 transitions, 557 flow [2024-01-27 14:50:30,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 221 transitions, 553 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:30,371 INFO L231 Difference]: Finished difference. Result has 218 places, 208 transitions, 429 flow [2024-01-27 14:50:30,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=218, PETRI_TRANSITIONS=208} [2024-01-27 14:50:30,372 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -112 predicate places. [2024-01-27 14:50:30,372 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 208 transitions, 429 flow [2024-01-27 14:50:30,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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:50:30,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:30,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:30,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 14:50:30,374 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:30,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:30,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2059325997, now seen corresponding path program 1 times [2024-01-27 14:50:30,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:30,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26096500] [2024-01-27 14:50:30,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:30,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:30,395 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:50:30,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:30,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26096500] [2024-01-27 14:50:30,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26096500] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:30,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:30,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540110976] [2024-01-27 14:50:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:30,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:30,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:30,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:30,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:30,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 324 [2024-01-27 14:50:30,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 208 transitions, 429 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:50:30,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:30,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 324 [2024-01-27 14:50:30,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:30,547 INFO L124 PetriNetUnfolderBase]: 564/1137 cut-off events. [2024-01-27 14:50:30,547 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-01-27 14:50:30,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 1137 events. 564/1137 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6633 event pairs, 564 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 2157. Up to 878 conditions per place. [2024-01-27 14:50:30,553 INFO L140 encePairwiseOnDemand]: 311/324 looper letters, 39 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2024-01-27 14:50:30,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 197 transitions, 489 flow [2024-01-27 14:50:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2024-01-27 14:50:30,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7232510288065843 [2024-01-27 14:50:30,555 INFO L175 Difference]: Start difference. First operand has 218 places, 208 transitions, 429 flow. Second operand 3 states and 703 transitions. [2024-01-27 14:50:30,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 197 transitions, 489 flow [2024-01-27 14:50:30,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 197 transitions, 483 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:30,558 INFO L231 Difference]: Finished difference. Result has 207 places, 197 transitions, 405 flow [2024-01-27 14:50:30,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=207, PETRI_TRANSITIONS=197} [2024-01-27 14:50:30,559 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -123 predicate places. [2024-01-27 14:50:30,559 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 197 transitions, 405 flow [2024-01-27 14:50:30,560 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:50:30,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:30,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:30,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 14:50:30,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:30,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:30,561 INFO L85 PathProgramCache]: Analyzing trace with hash -585401384, now seen corresponding path program 1 times [2024-01-27 14:50:30,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:30,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775898751] [2024-01-27 14:50:30,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:30,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:30,580 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:50:30,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:30,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775898751] [2024-01-27 14:50:30,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775898751] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:30,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:30,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226442025] [2024-01-27 14:50:30,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:30,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:30,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:30,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:30,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:30,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 324 [2024-01-27 14:50:30,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 197 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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:50:30,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:30,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 324 [2024-01-27 14:50:30,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:30,728 INFO L124 PetriNetUnfolderBase]: 564/1124 cut-off events. [2024-01-27 14:50:30,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:50:30,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 1124 events. 564/1124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6637 event pairs, 564 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 2085. Up to 900 conditions per place. [2024-01-27 14:50:30,734 INFO L140 encePairwiseOnDemand]: 310/324 looper letters, 43 selfloop transitions, 1 changer transitions 0/184 dead transitions. [2024-01-27 14:50:30,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 184 transitions, 467 flow [2024-01-27 14:50:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2024-01-27 14:50:30,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7129629629629629 [2024-01-27 14:50:30,736 INFO L175 Difference]: Start difference. First operand has 207 places, 197 transitions, 405 flow. Second operand 3 states and 693 transitions. [2024-01-27 14:50:30,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 184 transitions, 467 flow [2024-01-27 14:50:30,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 184 transitions, 463 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:30,738 INFO L231 Difference]: Finished difference. Result has 194 places, 184 transitions, 377 flow [2024-01-27 14:50:30,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=377, PETRI_PLACES=194, PETRI_TRANSITIONS=184} [2024-01-27 14:50:30,739 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -136 predicate places. [2024-01-27 14:50:30,739 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 184 transitions, 377 flow [2024-01-27 14:50:30,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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:50:30,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:30,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:30,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 14:50:30,740 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:30,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:30,741 INFO L85 PathProgramCache]: Analyzing trace with hash -967571659, now seen corresponding path program 1 times [2024-01-27 14:50:30,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:30,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662621987] [2024-01-27 14:50:30,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:30,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:30,760 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:50:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662621987] [2024-01-27 14:50:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662621987] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:30,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:30,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:30,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921407064] [2024-01-27 14:50:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:30,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:30,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:30,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:30,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:30,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 324 [2024-01-27 14:50:30,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 184 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 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:50:30,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:30,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 324 [2024-01-27 14:50:30,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:30,879 INFO L124 PetriNetUnfolderBase]: 564/1118 cut-off events. [2024-01-27 14:50:30,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:50:30,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 1118 events. 564/1118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6588 event pairs, 564 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 2071. Up to 883 conditions per place. [2024-01-27 14:50:30,884 INFO L140 encePairwiseOnDemand]: 316/324 looper letters, 35 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2024-01-27 14:50:30,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 178 transitions, 439 flow [2024-01-27 14:50:30,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-27 14:50:30,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417695473251029 [2024-01-27 14:50:30,886 INFO L175 Difference]: Start difference. First operand has 194 places, 184 transitions, 377 flow. Second operand 3 states and 721 transitions. [2024-01-27 14:50:30,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 178 transitions, 439 flow [2024-01-27 14:50:30,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 178 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:50:30,889 INFO L231 Difference]: Finished difference. Result has 189 places, 178 transitions, 368 flow [2024-01-27 14:50:30,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=189, PETRI_TRANSITIONS=178} [2024-01-27 14:50:30,889 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -141 predicate places. [2024-01-27 14:50:30,890 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 178 transitions, 368 flow [2024-01-27 14:50:30,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 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:50:30,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:30,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:30,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 14:50:30,891 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:30,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 70051848, now seen corresponding path program 1 times [2024-01-27 14:50:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:30,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549095804] [2024-01-27 14:50:30,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:30,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:30,909 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:50:30,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:30,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549095804] [2024-01-27 14:50:30,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549095804] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:30,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:30,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:30,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142504154] [2024-01-27 14:50:30,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:30,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:30,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:30,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:30,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:30,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 324 [2024-01-27 14:50:30,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 178 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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:50:30,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:30,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 324 [2024-01-27 14:50:30,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:31,028 INFO L124 PetriNetUnfolderBase]: 564/1105 cut-off events. [2024-01-27 14:50:31,029 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 14:50:31,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 1105 events. 564/1105 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6587 event pairs, 564 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 2065. Up to 899 conditions per place. [2024-01-27 14:50:31,033 INFO L140 encePairwiseOnDemand]: 310/324 looper letters, 42 selfloop transitions, 1 changer transitions 0/165 dead transitions. [2024-01-27 14:50:31,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 165 transitions, 428 flow [2024-01-27 14:50:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 695 transitions. [2024-01-27 14:50:31,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7150205761316872 [2024-01-27 14:50:31,036 INFO L175 Difference]: Start difference. First operand has 189 places, 178 transitions, 368 flow. Second operand 3 states and 695 transitions. [2024-01-27 14:50:31,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 165 transitions, 428 flow [2024-01-27 14:50:31,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 165 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:31,038 INFO L231 Difference]: Finished difference. Result has 176 places, 165 transitions, 340 flow [2024-01-27 14:50:31,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=176, PETRI_TRANSITIONS=165} [2024-01-27 14:50:31,039 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -154 predicate places. [2024-01-27 14:50:31,039 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 165 transitions, 340 flow [2024-01-27 14:50:31,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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:50:31,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:31,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:31,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 14:50:31,040 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:31,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2123357953, now seen corresponding path program 1 times [2024-01-27 14:50:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:31,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875880198] [2024-01-27 14:50:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:31,059 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:50:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875880198] [2024-01-27 14:50:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875880198] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:31,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:31,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37052620] [2024-01-27 14:50:31,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:31,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:31,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:31,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:31,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 324 [2024-01-27 14:50:31,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 165 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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:50:31,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:31,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 324 [2024-01-27 14:50:31,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:31,210 INFO L124 PetriNetUnfolderBase]: 564/1102 cut-off events. [2024-01-27 14:50:31,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:50:31,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 1102 events. 564/1102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6579 event pairs, 564 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 2053. Up to 886 conditions per place. [2024-01-27 14:50:31,214 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2024-01-27 14:50:31,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 162 transitions, 404 flow [2024-01-27 14:50:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-01-27 14:50:31,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520576131687243 [2024-01-27 14:50:31,216 INFO L175 Difference]: Start difference. First operand has 176 places, 165 transitions, 340 flow. Second operand 3 states and 731 transitions. [2024-01-27 14:50:31,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 162 transitions, 404 flow [2024-01-27 14:50:31,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 162 transitions, 403 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:50:31,219 INFO L231 Difference]: Finished difference. Result has 174 places, 162 transitions, 337 flow [2024-01-27 14:50:31,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=337, PETRI_PLACES=174, PETRI_TRANSITIONS=162} [2024-01-27 14:50:31,219 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -156 predicate places. [2024-01-27 14:50:31,220 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 162 transitions, 337 flow [2024-01-27 14:50:31,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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:50:31,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:31,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:31,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 14:50:31,221 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:31,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1399585102, now seen corresponding path program 1 times [2024-01-27 14:50:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966083292] [2024-01-27 14:50:31,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:31,239 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:50:31,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:31,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966083292] [2024-01-27 14:50:31,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966083292] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:31,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:31,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153439892] [2024-01-27 14:50:31,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:31,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:31,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:31,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:31,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 324 [2024-01-27 14:50:31,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 162 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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:50:31,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:31,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 324 [2024-01-27 14:50:31,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:31,365 INFO L124 PetriNetUnfolderBase]: 524/1038 cut-off events. [2024-01-27 14:50:31,366 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 14:50:31,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 1038 events. 524/1038 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 5955 event pairs, 359 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1955. Up to 575 conditions per place. [2024-01-27 14:50:31,370 INFO L140 encePairwiseOnDemand]: 307/324 looper letters, 47 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2024-01-27 14:50:31,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 164 transitions, 445 flow [2024-01-27 14:50:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-27 14:50:31,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7448559670781894 [2024-01-27 14:50:31,372 INFO L175 Difference]: Start difference. First operand has 174 places, 162 transitions, 337 flow. Second operand 3 states and 724 transitions. [2024-01-27 14:50:31,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 164 transitions, 445 flow [2024-01-27 14:50:31,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 164 transitions, 441 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:31,374 INFO L231 Difference]: Finished difference. Result has 167 places, 155 transitions, 347 flow [2024-01-27 14:50:31,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=167, PETRI_TRANSITIONS=155} [2024-01-27 14:50:31,375 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -163 predicate places. [2024-01-27 14:50:31,375 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 155 transitions, 347 flow [2024-01-27 14:50:31,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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:50:31,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:31,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:31,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 14:50:31,376 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:31,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash -437463187, now seen corresponding path program 1 times [2024-01-27 14:50:31,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:31,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431880316] [2024-01-27 14:50:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:31,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:31,393 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:50:31,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:31,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431880316] [2024-01-27 14:50:31,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431880316] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:31,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:31,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:31,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288416792] [2024-01-27 14:50:31,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:31,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:31,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:31,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:31,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:31,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 324 [2024-01-27 14:50:31,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 155 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 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:50:31,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:31,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 324 [2024-01-27 14:50:31,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:31,512 INFO L124 PetriNetUnfolderBase]: 524/1046 cut-off events. [2024-01-27 14:50:31,513 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-01-27 14:50:31,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1046 events. 524/1046 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 6428 event pairs, 514 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 2342. Up to 842 conditions per place. [2024-01-27 14:50:31,517 INFO L140 encePairwiseOnDemand]: 315/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/148 dead transitions. [2024-01-27 14:50:31,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 148 transitions, 413 flow [2024-01-27 14:50:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-01-27 14:50:31,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7376543209876543 [2024-01-27 14:50:31,519 INFO L175 Difference]: Start difference. First operand has 167 places, 155 transitions, 347 flow. Second operand 3 states and 717 transitions. [2024-01-27 14:50:31,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 148 transitions, 413 flow [2024-01-27 14:50:31,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 148 transitions, 405 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:31,522 INFO L231 Difference]: Finished difference. Result has 160 places, 148 transitions, 329 flow [2024-01-27 14:50:31,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=160, PETRI_TRANSITIONS=148} [2024-01-27 14:50:31,523 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -170 predicate places. [2024-01-27 14:50:31,523 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 148 transitions, 329 flow [2024-01-27 14:50:31,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 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:50:31,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:31,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:31,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 14:50:31,524 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:31,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash -676454737, now seen corresponding path program 1 times [2024-01-27 14:50:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:31,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134384597] [2024-01-27 14:50:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:31,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:31,542 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:50:31,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:31,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134384597] [2024-01-27 14:50:31,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134384597] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:31,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:31,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:31,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992536622] [2024-01-27 14:50:31,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:31,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:31,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:31,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:31,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:31,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 324 [2024-01-27 14:50:31,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 148 transitions, 329 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:50:31,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:31,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 324 [2024-01-27 14:50:31,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:31,651 INFO L124 PetriNetUnfolderBase]: 524/1045 cut-off events. [2024-01-27 14:50:31,651 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-01-27 14:50:31,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2256 conditions, 1045 events. 524/1045 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 6418 event pairs, 514 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 2245. Up to 848 conditions per place. [2024-01-27 14:50:31,656 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2024-01-27 14:50:31,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 147 transitions, 395 flow [2024-01-27 14:50:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2024-01-27 14:50:31,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7623456790123457 [2024-01-27 14:50:31,658 INFO L175 Difference]: Start difference. First operand has 160 places, 148 transitions, 329 flow. Second operand 3 states and 741 transitions. [2024-01-27 14:50:31,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 147 transitions, 395 flow [2024-01-27 14:50:31,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 147 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:31,660 INFO L231 Difference]: Finished difference. Result has 159 places, 147 transitions, 327 flow [2024-01-27 14:50:31,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=159, PETRI_TRANSITIONS=147} [2024-01-27 14:50:31,661 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -171 predicate places. [2024-01-27 14:50:31,661 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 147 transitions, 327 flow [2024-01-27 14:50:31,662 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:50:31,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:31,662 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, 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:50:31,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-27 14:50:31,662 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:31,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:31,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1896196065, now seen corresponding path program 1 times [2024-01-27 14:50:31,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:31,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051926027] [2024-01-27 14:50:31,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:31,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:31,846 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:50:31,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:31,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051926027] [2024-01-27 14:50:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051926027] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:31,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:31,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:50:31,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173646694] [2024-01-27 14:50:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:31,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:31,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:31,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:31,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:31,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 324 [2024-01-27 14:50:31,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 147 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 238.25) internal successors, (953), 4 states have internal predecessors, (953), 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:50:31,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:31,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 324 [2024-01-27 14:50:31,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:31,998 INFO L124 PetriNetUnfolderBase]: 524/976 cut-off events. [2024-01-27 14:50:31,998 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-01-27 14:50:31,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 976 events. 524/976 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 4510 event pairs, 310 based on Foata normal form. 62/710 useless extension candidates. Maximal degree in co-relation 2176. Up to 716 conditions per place. [2024-01-27 14:50:32,001 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 47 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2024-01-27 14:50:32,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 160 transitions, 471 flow [2024-01-27 14:50:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:50:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:50:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 983 transitions. [2024-01-27 14:50:32,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7584876543209876 [2024-01-27 14:50:32,004 INFO L175 Difference]: Start difference. First operand has 159 places, 147 transitions, 327 flow. Second operand 4 states and 983 transitions. [2024-01-27 14:50:32,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 160 transitions, 471 flow [2024-01-27 14:50:32,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 160 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:32,008 INFO L231 Difference]: Finished difference. Result has 158 places, 145 transitions, 323 flow [2024-01-27 14:50:32,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=158, PETRI_TRANSITIONS=145} [2024-01-27 14:50:32,008 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -172 predicate places. [2024-01-27 14:50:32,009 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 145 transitions, 323 flow [2024-01-27 14:50:32,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 238.25) internal successors, (953), 4 states have internal predecessors, (953), 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:50:32,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:32,010 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, 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:50:32,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-27 14:50:32,011 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-27 14:50:32,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:32,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1347466343, now seen corresponding path program 1 times [2024-01-27 14:50:32,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:32,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030361783] [2024-01-27 14:50:32,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:32,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:50:32,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 14:50:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:50:32,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 14:50:32,075 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 14:50:32,076 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (240 of 241 remaining) [2024-01-27 14:50:32,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (239 of 241 remaining) [2024-01-27 14:50:32,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (238 of 241 remaining) [2024-01-27 14:50:32,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (237 of 241 remaining) [2024-01-27 14:50:32,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (236 of 241 remaining) [2024-01-27 14:50:32,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (235 of 241 remaining) [2024-01-27 14:50:32,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (234 of 241 remaining) [2024-01-27 14:50:32,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (233 of 241 remaining) [2024-01-27 14:50:32,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (232 of 241 remaining) [2024-01-27 14:50:32,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (231 of 241 remaining) [2024-01-27 14:50:32,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (230 of 241 remaining) [2024-01-27 14:50:32,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (229 of 241 remaining) [2024-01-27 14:50:32,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (228 of 241 remaining) [2024-01-27 14:50:32,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (227 of 241 remaining) [2024-01-27 14:50:32,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (226 of 241 remaining) [2024-01-27 14:50:32,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (225 of 241 remaining) [2024-01-27 14:50:32,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (224 of 241 remaining) [2024-01-27 14:50:32,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (223 of 241 remaining) [2024-01-27 14:50:32,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 241 remaining) [2024-01-27 14:50:32,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 241 remaining) [2024-01-27 14:50:32,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 241 remaining) [2024-01-27 14:50:32,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 241 remaining) [2024-01-27 14:50:32,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 241 remaining) [2024-01-27 14:50:32,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 241 remaining) [2024-01-27 14:50:32,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 241 remaining) [2024-01-27 14:50:32,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 241 remaining) [2024-01-27 14:50:32,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 241 remaining) [2024-01-27 14:50:32,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 241 remaining) [2024-01-27 14:50:32,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 241 remaining) [2024-01-27 14:50:32,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 241 remaining) [2024-01-27 14:50:32,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 241 remaining) [2024-01-27 14:50:32,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 241 remaining) [2024-01-27 14:50:32,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 241 remaining) [2024-01-27 14:50:32,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 241 remaining) [2024-01-27 14:50:32,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 241 remaining) [2024-01-27 14:50:32,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 241 remaining) [2024-01-27 14:50:32,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (204 of 241 remaining) [2024-01-27 14:50:32,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (203 of 241 remaining) [2024-01-27 14:50:32,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 241 remaining) [2024-01-27 14:50:32,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 241 remaining) [2024-01-27 14:50:32,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 241 remaining) [2024-01-27 14:50:32,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 241 remaining) [2024-01-27 14:50:32,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 241 remaining) [2024-01-27 14:50:32,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 241 remaining) [2024-01-27 14:50:32,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 241 remaining) [2024-01-27 14:50:32,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 241 remaining) [2024-01-27 14:50:32,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 241 remaining) [2024-01-27 14:50:32,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 241 remaining) [2024-01-27 14:50:32,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 241 remaining) [2024-01-27 14:50:32,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 241 remaining) [2024-01-27 14:50:32,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 241 remaining) [2024-01-27 14:50:32,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 241 remaining) [2024-01-27 14:50:32,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 241 remaining) [2024-01-27 14:50:32,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 241 remaining) [2024-01-27 14:50:32,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 241 remaining) [2024-01-27 14:50:32,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 241 remaining) [2024-01-27 14:50:32,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err15ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 241 remaining) [2024-01-27 14:50:32,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err16ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 241 remaining) [2024-01-27 14:50:32,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err17ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 241 remaining) [2024-01-27 14:50:32,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err18ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 241 remaining) [2024-01-27 14:50:32,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err19ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 241 remaining) [2024-01-27 14:50:32,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 241 remaining) [2024-01-27 14:50:32,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 241 remaining) [2024-01-27 14:50:32,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 241 remaining) [2024-01-27 14:50:32,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 241 remaining) [2024-01-27 14:50:32,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 241 remaining) [2024-01-27 14:50:32,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 241 remaining) [2024-01-27 14:50:32,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 241 remaining) [2024-01-27 14:50:32,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 241 remaining) [2024-01-27 14:50:32,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 241 remaining) [2024-01-27 14:50:32,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 241 remaining) [2024-01-27 14:50:32,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 241 remaining) [2024-01-27 14:50:32,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 241 remaining) [2024-01-27 14:50:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 241 remaining) [2024-01-27 14:50:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 241 remaining) [2024-01-27 14:50:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 241 remaining) [2024-01-27 14:50:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 241 remaining) [2024-01-27 14:50:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 241 remaining) [2024-01-27 14:50:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 241 remaining) [2024-01-27 14:50:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 241 remaining) [2024-01-27 14:50:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 241 remaining) [2024-01-27 14:50:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 241 remaining) [2024-01-27 14:50:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 241 remaining) [2024-01-27 14:50:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 241 remaining) [2024-01-27 14:50:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 241 remaining) [2024-01-27 14:50:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 241 remaining) [2024-01-27 14:50:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 241 remaining) [2024-01-27 14:50:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 241 remaining) [2024-01-27 14:50:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 241 remaining) [2024-01-27 14:50:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 241 remaining) [2024-01-27 14:50:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 241 remaining) [2024-01-27 14:50:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 241 remaining) [2024-01-27 14:50:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 241 remaining) [2024-01-27 14:50:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 241 remaining) [2024-01-27 14:50:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 241 remaining) [2024-01-27 14:50:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 241 remaining) [2024-01-27 14:50:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 241 remaining) [2024-01-27 14:50:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 241 remaining) [2024-01-27 14:50:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 241 remaining) [2024-01-27 14:50:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 241 remaining) [2024-01-27 14:50:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 241 remaining) [2024-01-27 14:50:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 241 remaining) [2024-01-27 14:50:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 241 remaining) [2024-01-27 14:50:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 241 remaining) [2024-01-27 14:50:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 241 remaining) [2024-01-27 14:50:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 241 remaining) [2024-01-27 14:50:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 241 remaining) [2024-01-27 14:50:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 241 remaining) [2024-01-27 14:50:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 241 remaining) [2024-01-27 14:50:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 241 remaining) [2024-01-27 14:50:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 241 remaining) [2024-01-27 14:50:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 241 remaining) [2024-01-27 14:50:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 241 remaining) [2024-01-27 14:50:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 241 remaining) [2024-01-27 14:50:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 241 remaining) [2024-01-27 14:50:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 241 remaining) [2024-01-27 14:50:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 241 remaining) [2024-01-27 14:50:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 241 remaining) [2024-01-27 14:50:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 241 remaining) [2024-01-27 14:50:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 241 remaining) [2024-01-27 14:50:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 241 remaining) [2024-01-27 14:50:32,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 241 remaining) [2024-01-27 14:50:32,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 241 remaining) [2024-01-27 14:50:32,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 241 remaining) [2024-01-27 14:50:32,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 241 remaining) [2024-01-27 14:50:32,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 241 remaining) [2024-01-27 14:50:32,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 241 remaining) [2024-01-27 14:50:32,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 241 remaining) [2024-01-27 14:50:32,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 241 remaining) [2024-01-27 14:50:32,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 241 remaining) [2024-01-27 14:50:32,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 241 remaining) [2024-01-27 14:50:32,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 241 remaining) [2024-01-27 14:50:32,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 241 remaining) [2024-01-27 14:50:32,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 241 remaining) [2024-01-27 14:50:32,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 241 remaining) [2024-01-27 14:50:32,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 241 remaining) [2024-01-27 14:50:32,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 241 remaining) [2024-01-27 14:50:32,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 241 remaining) [2024-01-27 14:50:32,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 241 remaining) [2024-01-27 14:50:32,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 241 remaining) [2024-01-27 14:50:32,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 241 remaining) [2024-01-27 14:50:32,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 241 remaining) [2024-01-27 14:50:32,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 241 remaining) [2024-01-27 14:50:32,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 241 remaining) [2024-01-27 14:50:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 241 remaining) [2024-01-27 14:50:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 241 remaining) [2024-01-27 14:50:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 241 remaining) [2024-01-27 14:50:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 241 remaining) [2024-01-27 14:50:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 241 remaining) [2024-01-27 14:50:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 241 remaining) [2024-01-27 14:50:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 241 remaining) [2024-01-27 14:50:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 241 remaining) [2024-01-27 14:50:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 241 remaining) [2024-01-27 14:50:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 241 remaining) [2024-01-27 14:50:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 241 remaining) [2024-01-27 14:50:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 241 remaining) [2024-01-27 14:50:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 241 remaining) [2024-01-27 14:50:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 241 remaining) [2024-01-27 14:50:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 241 remaining) [2024-01-27 14:50:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 241 remaining) [2024-01-27 14:50:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 241 remaining) [2024-01-27 14:50:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 241 remaining) [2024-01-27 14:50:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 241 remaining) [2024-01-27 14:50:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 241 remaining) [2024-01-27 14:50:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 241 remaining) [2024-01-27 14:50:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 241 remaining) [2024-01-27 14:50:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 241 remaining) [2024-01-27 14:50:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 241 remaining) [2024-01-27 14:50:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 241 remaining) [2024-01-27 14:50:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 241 remaining) [2024-01-27 14:50:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 241 remaining) [2024-01-27 14:50:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 241 remaining) [2024-01-27 14:50:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 241 remaining) [2024-01-27 14:50:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 241 remaining) [2024-01-27 14:50:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 241 remaining) [2024-01-27 14:50:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 241 remaining) [2024-01-27 14:50:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 241 remaining) [2024-01-27 14:50:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 241 remaining) [2024-01-27 14:50:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONERROR_FUNCTION (62 of 241 remaining) [2024-01-27 14:50:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (61 of 241 remaining) [2024-01-27 14:50:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 241 remaining) [2024-01-27 14:50:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 241 remaining) [2024-01-27 14:50:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 241 remaining) [2024-01-27 14:50:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 241 remaining) [2024-01-27 14:50:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 241 remaining) [2024-01-27 14:50:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 241 remaining) [2024-01-27 14:50:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 241 remaining) [2024-01-27 14:50:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 241 remaining) [2024-01-27 14:50:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 241 remaining) [2024-01-27 14:50:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 241 remaining) [2024-01-27 14:50:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 241 remaining) [2024-01-27 14:50:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 241 remaining) [2024-01-27 14:50:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 241 remaining) [2024-01-27 14:50:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 241 remaining) [2024-01-27 14:50:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 241 remaining) [2024-01-27 14:50:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 241 remaining) [2024-01-27 14:50:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 241 remaining) [2024-01-27 14:50:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 241 remaining) [2024-01-27 14:50:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 241 remaining) [2024-01-27 14:50:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 241 remaining) [2024-01-27 14:50:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 241 remaining) [2024-01-27 14:50:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 241 remaining) [2024-01-27 14:50:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 241 remaining) [2024-01-27 14:50:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 241 remaining) [2024-01-27 14:50:32,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 241 remaining) [2024-01-27 14:50:32,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 241 remaining) [2024-01-27 14:50:32,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 241 remaining) [2024-01-27 14:50:32,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 241 remaining) [2024-01-27 14:50:32,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 241 remaining) [2024-01-27 14:50:32,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 241 remaining) [2024-01-27 14:50:32,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 241 remaining) [2024-01-27 14:50:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 241 remaining) [2024-01-27 14:50:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 241 remaining) [2024-01-27 14:50:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 241 remaining) [2024-01-27 14:50:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 241 remaining) [2024-01-27 14:50:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 241 remaining) [2024-01-27 14:50:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 241 remaining) [2024-01-27 14:50:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 241 remaining) [2024-01-27 14:50:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 241 remaining) [2024-01-27 14:50:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 241 remaining) [2024-01-27 14:50:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 241 remaining) [2024-01-27 14:50:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 241 remaining) [2024-01-27 14:50:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 241 remaining) [2024-01-27 14:50:32,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 241 remaining) [2024-01-27 14:50:32,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 241 remaining) [2024-01-27 14:50:32,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 241 remaining) [2024-01-27 14:50:32,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 241 remaining) [2024-01-27 14:50:32,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 241 remaining) [2024-01-27 14:50:32,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 241 remaining) [2024-01-27 14:50:32,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 241 remaining) [2024-01-27 14:50:32,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 241 remaining) [2024-01-27 14:50:32,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 241 remaining) [2024-01-27 14:50:32,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 241 remaining) [2024-01-27 14:50:32,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 241 remaining) [2024-01-27 14:50:32,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 241 remaining) [2024-01-27 14:50:32,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 241 remaining) [2024-01-27 14:50:32,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err15ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 241 remaining) [2024-01-27 14:50:32,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err16ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 241 remaining) [2024-01-27 14:50:32,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 241 remaining) [2024-01-27 14:50:32,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err18ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 241 remaining) [2024-01-27 14:50:32,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err19ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 241 remaining) [2024-01-27 14:50:32,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-27 14:50:32,112 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:32,120 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 14:50:32,121 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 14:50:32,217 INFO L503 ceAbstractionStarter]: Automizer considered 177 witness invariants [2024-01-27 14:50:32,217 INFO L504 ceAbstractionStarter]: WitnessConsidered=177 [2024-01-27 14:50:32,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 02:50:32 BasicIcfg [2024-01-27 14:50:32,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 14:50:32,218 INFO L158 Benchmark]: Toolchain (without parser) took 6512.73ms. Allocated memory was 207.6MB in the beginning and 591.4MB in the end (delta: 383.8MB). Free memory was 181.1MB in the beginning and 394.6MB in the end (delta: -213.6MB). Peak memory consumption was 169.2MB. Max. memory is 16.1GB. [2024-01-27 14:50:32,218 INFO L158 Benchmark]: Witness Parser took 1.16ms. Allocated memory is still 140.5MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:50:32,219 INFO L158 Benchmark]: CDTParser took 0.06ms. Allocated memory is still 140.5MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:50:32,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.12ms. Allocated memory is still 207.6MB. Free memory was 181.1MB in the beginning and 155.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-27 14:50:32,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.42ms. Allocated memory is still 207.6MB. Free memory was 155.9MB in the beginning and 152.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:50:32,219 INFO L158 Benchmark]: Boogie Preprocessor took 87.14ms. Allocated memory is still 207.6MB. Free memory was 151.7MB in the beginning and 148.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:50:32,219 INFO L158 Benchmark]: RCFGBuilder took 1694.53ms. Allocated memory is still 207.6MB. Free memory was 148.6MB in the beginning and 85.6MB in the end (delta: 63.0MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2024-01-27 14:50:32,220 INFO L158 Benchmark]: TraceAbstraction took 4243.83ms. Allocated memory was 207.6MB in the beginning and 591.4MB in the end (delta: 383.8MB). Free memory was 84.5MB in the beginning and 394.6MB in the end (delta: -310.1MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2024-01-27 14:50:32,221 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 1.16ms. Allocated memory is still 140.5MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.06ms. Allocated memory is still 140.5MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.12ms. Allocated memory is still 207.6MB. Free memory was 181.1MB in the beginning and 155.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.42ms. Allocated memory is still 207.6MB. Free memory was 155.9MB in the beginning and 152.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.14ms. Allocated memory is still 207.6MB. Free memory was 151.7MB in the beginning and 148.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1694.53ms. Allocated memory is still 207.6MB. Free memory was 148.6MB in the beginning and 85.6MB in the end (delta: 63.0MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4243.83ms. Allocated memory was 207.6MB in the beginning and 591.4MB in the end (delta: 383.8MB). Free memory was 84.5MB in the beginning and 394.6MB in the end (delta: -310.1MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 107]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int cardSet_0, cardRarity_1, cardId_2, cardType_3, cardSet_4, cardRarity_5, cardId_6, cardType_7, cardSet_8, cardRarity_9, cardId_10, cardType_11, result_12, result_13, result_14; [L76] 0 pthread_t t1, t2, t3; VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]]]] [L78] 0 cardSet_0 = __VERIFIER_nondet_int() [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] [L79] 0 cardRarity_1 = __VERIFIER_nondet_int() [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] [L80] 0 cardId_2 = __VERIFIER_nondet_int() [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] [L81] 0 cardType_3 = __VERIFIER_nondet_int() [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] [L82] 0 cardSet_4 = __VERIFIER_nondet_int() [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] [L83] 0 cardRarity_5 = __VERIFIER_nondet_int() [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] [L84] 0 cardId_6 = __VERIFIER_nondet_int() [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] [L85] 0 cardType_7 = __VERIFIER_nondet_int() [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] [L86] 0 cardSet_8 = __VERIFIER_nondet_int() [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] [L87] 0 cardRarity_9 = __VERIFIER_nondet_int() [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] [L88] 0 cardId_10 = __VERIFIER_nondet_int() [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] [L89] 0 cardType_11 = __VERIFIER_nondet_int() [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] [L92] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0] [L44] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L44] CALL 1 minus(cardSet_0, cardSet_4) [L106] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]] [L106] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]]]] [L106] CALL 1 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L35] COND FALSE 1 !(!cond) [L106] RET 1 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L107] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]] [L107] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[b],UnaryExpression[MINUS,IntegerLiteral[1]]]]] VAL [\old(a)=0, \old(b)=7, a=0, b=7, cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=7, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0] - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: 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: 50]: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: 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: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: 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: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: 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: 79]: 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: 79]: 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: 79]: 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: 79]: 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: 79]: 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: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: 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: 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: 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: 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: 100]: 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: 93]: 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: 94]: 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: 92]: 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 7 procedures, 403 locations, 241 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 669 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1069 IncrementalHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 119 mSDtfsCounter, 1069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=0, InterpolantAutomatonStates: 49, 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, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:50:32,267 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