./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-collitem-symm.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-symm.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cb09d658 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-symm.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-collitem-symm.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-cb09d65-m [2024-01-27 23:07:54,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:07:54,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:07:54,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:07:54,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:07:54,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:07:54,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:07:54,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:07:54,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:07:54,696 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:07:54,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:07:54,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:07:54,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:07:54,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:07:54,698 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:07:54,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:07:54,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:07:54,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:07:54,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:07:54,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:07:54,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:07:54,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:07:54,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:07:54,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:07:54,701 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:07:54,702 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:07:54,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:07:54,702 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:07:54,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:07:54,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:07:54,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:07:54,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:07:54,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:07:54,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:07:54,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:07:54,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:07:54,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:07:54,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:07:54,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:07:54,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:07:54,706 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:07:54,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:07:54,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:07:54,707 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 23:07:54,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:07:54,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:07:54,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:07:54,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:07:54,928 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:07:54,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-collitem-symm.wvr.c [2024-01-27 23:07:56,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:07:56,310 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:07:56,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-symm.wvr.c [2024-01-27 23:07:56,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69f51f99/268d2e42980f42f8a279e516c314f626/FLAG385896016 [2024-01-27 23:07:56,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69f51f99/268d2e42980f42f8a279e516c314f626 [2024-01-27 23:07:56,331 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:07:56,332 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:07:56,334 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-symm.wvr.yml/witness.yml [2024-01-27 23:07:56,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:07:56,462 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:07:56,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:07:56,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:07:56,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:07:56,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:07:56" (1/2) ... [2024-01-27 23:07:56,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51482ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:56, skipping insertion in model container [2024-01-27 23:07:56,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:07:56" (1/2) ... [2024-01-27 23:07:56,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@a3bcc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:56, skipping insertion in model container [2024-01-27 23:07:56,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:56" (2/2) ... [2024-01-27 23:07:56,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51482ed8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56, skipping insertion in model container [2024-01-27 23:07:56,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:56" (2/2) ... [2024-01-27 23:07:56,474 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:07:56,556 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:07:56,558 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-27 23:07:56,558 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardRarity_5 == 0 [2024-01-27 23:07:56,558 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_8 == 0 [2024-01-27 23:07:56,558 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardId_6 == 0 [2024-01-27 23:07:56,558 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-27 23:07:56,559 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-27 23:07:56,559 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardId_2 == 0 [2024-01-27 23:07:56,559 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_9 == 0 [2024-01-27 23:07:56,559 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-27 23:07:56,559 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardType_7 == 0 [2024-01-27 23:07:56,559 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-27 23:07:56,559 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardType_3 == 0 [2024-01-27 23:07:56,559 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] cardSet_4 == 0 [2024-01-27 23:07:56,562 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardType_3 == 0 [2024-01-27 23:07:56,562 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardSet_0 == 0 [2024-01-27 23:07:56,562 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardSet_4 == 0 [2024-01-27 23:07:56,562 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardId_6 == 0 [2024-01-27 23:07:56,562 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardType_7 == 0 [2024-01-27 23:07:56,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_8 == 0 [2024-01-27 23:07:56,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-27 23:07:56,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-27 23:07:56,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardRarity_1 == 0 [2024-01-27 23:07:56,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-27 23:07:56,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardRarity_5 == 0 [2024-01-27 23:07:56,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] cardId_2 == 0 [2024-01-27 23:07:56,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_9 == 0 [2024-01-27 23:07:56,564 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-27 23:07:56,564 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_9 == 0 [2024-01-27 23:07:56,564 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-27 23:07:56,564 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-27 23:07:56,564 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] b <= -1 [2024-01-27 23:07:56,564 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] b != 0 [2024-01-27 23:07:56,564 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-27 23:07:56,565 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] cardType_7 == 0 [2024-01-27 23:07:56,566 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] result_8 == 0 [2024-01-27 23:07:56,566 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] cardId_6 == 0 [2024-01-27 23:07:56,566 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-27 23:07:56,566 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] result_9 == 0 [2024-01-27 23:07:56,566 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-27 23:07:56,567 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-27 23:07:56,567 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-27 23:07:56,567 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-27 23:07:56,567 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] cardType_7 == 0 [2024-01-27 23:07:56,567 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-27 23:07:56,567 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] cardRarity_5 == 0 [2024-01-27 23:07:56,567 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-27 23:07:56,568 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] result_8 == 0 [2024-01-27 23:07:56,568 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] cardSet_4 == 0 [2024-01-27 23:07:56,568 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] cardId_6 == 0 [2024-01-27 23:07:56,568 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] result_9 == 0 [2024-01-27 23:07:56,568 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-27 23:07:56,581 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-27 23:07:56,582 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-27 23:07:56,582 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-27 23:07:56,582 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] cardType_3 == 0 [2024-01-27 23:07:56,583 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] cardSet_4 == 0 [2024-01-27 23:07:56,583 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] cardRarity_5 == 0 [2024-01-27 23:07:56,583 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] result_8 == 0 [2024-01-27 23:07:56,583 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-27 23:07:56,584 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] cardType_7 == 0 [2024-01-27 23:07:56,584 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] result_9 == 0 [2024-01-27 23:07:56,584 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-27 23:07:56,584 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] cardId_6 == 0 [2024-01-27 23:07:56,585 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-27 23:07:56,585 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] result_9 == 0 [2024-01-27 23:07:56,585 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] result_8 == 0 [2024-01-27 23:07:56,585 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-27 23:07:56,585 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-27 23:07:56,585 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-27 23:07:56,585 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-27 23:07:56,585 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] 1 <= b [2024-01-27 23:07:56,586 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] b != 0 [2024-01-27 23:07:56,586 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] cardId_6 == 0 [2024-01-27 23:07:56,586 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_8 == 0 [2024-01-27 23:07:56,586 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-27 23:07:56,586 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] cardRarity_5 == 0 [2024-01-27 23:07:56,589 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-27 23:07:56,590 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-27 23:07:56,590 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-27 23:07:56,590 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] cardType_7 == 0 [2024-01-27 23:07:56,590 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_9 == 0 [2024-01-27 23:07:56,590 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-27 23:07:56,590 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-27 23:07:56,590 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-27 23:07:56,590 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-27 23:07:56,591 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] cardType_7 == 0 [2024-01-27 23:07:56,591 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-27 23:07:56,591 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] result_8 == 0 [2024-01-27 23:07:56,591 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-27 23:07:56,591 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] result_9 == 0 [2024-01-27 23:07:56,591 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardId_2 == 0 [2024-01-27 23:07:56,591 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardType_7 == 0 [2024-01-27 23:07:56,591 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (long long )result_8 - (long long )result_9 >= 0LL [2024-01-27 23:07:56,592 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardType_3 == 0 [2024-01-27 23:07:56,592 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_8 == 0 [2024-01-27 23:07:56,592 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (0LL - (long long )result_8) + (long long )result_9 >= 0LL [2024-01-27 23:07:56,592 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (long long )result_8 + (long long )result_9 >= 0LL [2024-01-27 23:07:56,592 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (0LL - (long long )result_8) - (long long )result_9 >= 0LL [2024-01-27 23:07:56,592 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardRarity_5 == 0 [2024-01-27 23:07:56,592 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardId_6 == 0 [2024-01-27 23:07:56,592 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardSet_4 == 0 [2024-01-27 23:07:56,593 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] cardRarity_1 == 0 [2024-01-27 23:07:56,593 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_9 == 0 [2024-01-27 23:07:56,593 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] result_9 == 0 [2024-01-27 23:07:56,614 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:07:56,761 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-symm.wvr.c[3012,3025] [2024-01-27 23:07:56,774 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:07:56,787 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 23:07:56,800 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 [2024-01-27 23:07:56,881 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-symm.wvr.c[3012,3025] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:07:56,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:07:56,899 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:07:56,900 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56 WrapperNode [2024-01-27 23:07:56,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:07:56,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:07:56,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:07:56,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:07:56,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:56,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:56,965 INFO L138 Inliner]: procedures = 22, calls = 35, calls flagged for inlining = 15, calls inlined = 29, statements flattened = 394 [2024-01-27 23:07:56,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:07:56,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:07:56,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:07:56,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:07:56,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:56,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:56,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:57,022 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-27 23:07:57,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:57,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:57,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:57,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:57,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:57,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:57,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:07:57,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:07:57,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:07:57,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:07:57,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (1/1) ... [2024-01-27 23:07:57,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:07:57,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:07:57,077 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 23:07:57,081 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 23:07:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:07:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 23:07:57,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 23:07:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 23:07:57,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 23:07:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:07:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:07:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:07:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:07:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:07:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:07:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:07:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 23:07:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 23:07:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:07:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:07:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 23:07:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 23:07:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 23:07:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:07:57,114 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 23:07:57,190 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:07:57,192 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:07:57,677 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:07:57,677 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:07:58,490 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:07:58,491 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 23:07:58,492 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:07:58 BoogieIcfgContainer [2024-01-27 23:07:58,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:07:58,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:07:58,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:07:58,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:07:58,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:07:56" (1/4) ... [2024-01-27 23:07:58,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ee59cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:07:58, skipping insertion in model container [2024-01-27 23:07:58,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:56" (2/4) ... [2024-01-27 23:07:58,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ee59cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:07:58, skipping insertion in model container [2024-01-27 23:07:58,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:56" (3/4) ... [2024-01-27 23:07:58,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ee59cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:07:58, skipping insertion in model container [2024-01-27 23:07:58,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:07:58" (4/4) ... [2024-01-27 23:07:58,504 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-symm.wvr.c [2024-01-27 23:07:58,521 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:07:58,521 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 132 error locations. [2024-01-27 23:07:58,527 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:07:58,743 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 23:07:58,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 243 transitions, 500 flow [2024-01-27 23:07:58,834 INFO L124 PetriNetUnfolderBase]: 0/241 cut-off events. [2024-01-27 23:07:58,834 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 23:07:58,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 241 events. 0/241 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 368 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-27 23:07:58,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 243 transitions, 500 flow [2024-01-27 23:07:58,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 240 transitions, 492 flow [2024-01-27 23:07:58,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:07:58,863 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;@26e9635, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:07:58,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 174 error locations. [2024-01-27 23:07:58,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:07:58,866 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:07:58,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:58,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:58,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:07:58,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:07:58,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash 49064, now seen corresponding path program 1 times [2024-01-27 23:07:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839075101] [2024-01-27 23:07:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:58,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,047 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 23:07:59,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839075101] [2024-01-27 23:07:59,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839075101] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148594204] [2024-01-27 23:07:59,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 243 [2024-01-27 23:07:59,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 240 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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 23:07:59,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 243 [2024-01-27 23:07:59,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,373 INFO L124 PetriNetUnfolderBase]: 64/271 cut-off events. [2024-01-27 23:07:59,373 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:59,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 271 events. 64/271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 836 event pairs, 64 based on Foata normal form. 49/209 useless extension candidates. Maximal degree in co-relation 274. Up to 128 conditions per place. [2024-01-27 23:07:59,377 INFO L140 encePairwiseOnDemand]: 157/243 looper letters, 22 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2024-01-27 23:07:59,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 147 transitions, 348 flow [2024-01-27 23:07:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-01-27 23:07:59,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6748971193415638 [2024-01-27 23:07:59,390 INFO L175 Difference]: Start difference. First operand has 247 places, 240 transitions, 492 flow. Second operand 3 states and 492 transitions. [2024-01-27 23:07:59,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 147 transitions, 348 flow [2024-01-27 23:07:59,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 147 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:59,396 INFO L231 Difference]: Finished difference. Result has 154 places, 147 transitions, 302 flow [2024-01-27 23:07:59,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=152, 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=302, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2024-01-27 23:07:59,401 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -93 predicate places. [2024-01-27 23:07:59,401 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 302 flow [2024-01-27 23:07:59,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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 23:07:59,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 23:07:59,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:07:59,402 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:07:59,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,402 INFO L85 PathProgramCache]: Analyzing trace with hash 47201370, now seen corresponding path program 1 times [2024-01-27 23:07:59,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756264788] [2024-01-27 23:07:59,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,432 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 23:07:59,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756264788] [2024-01-27 23:07:59,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756264788] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084477262] [2024-01-27 23:07:59,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 243 [2024-01-27 23:07:59,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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 23:07:59,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 243 [2024-01-27 23:07:59,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,491 INFO L124 PetriNetUnfolderBase]: 64/268 cut-off events. [2024-01-27 23:07:59,492 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:07:59,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 268 events. 64/268 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 827 event pairs, 64 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 281. Up to 133 conditions per place. [2024-01-27 23:07:59,493 INFO L140 encePairwiseOnDemand]: 238/243 looper letters, 23 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-01-27 23:07:59,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 144 transitions, 346 flow [2024-01-27 23:07:59,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2024-01-27 23:07:59,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7709190672153635 [2024-01-27 23:07:59,496 INFO L175 Difference]: Start difference. First operand has 154 places, 147 transitions, 302 flow. Second operand 3 states and 562 transitions. [2024-01-27 23:07:59,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 144 transitions, 346 flow [2024-01-27 23:07:59,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 144 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:59,499 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 296 flow [2024-01-27 23:07:59,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2024-01-27 23:07:59,500 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -96 predicate places. [2024-01-27 23:07:59,500 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 296 flow [2024-01-27 23:07:59,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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 23:07:59,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 23:07:59,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:07:59,502 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:07:59,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1463243987, now seen corresponding path program 1 times [2024-01-27 23:07:59,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796726094] [2024-01-27 23:07:59,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,528 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 23:07:59,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796726094] [2024-01-27 23:07:59,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796726094] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791676854] [2024-01-27 23:07:59,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 243 [2024-01-27 23:07:59,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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 23:07:59,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 243 [2024-01-27 23:07:59,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,596 INFO L124 PetriNetUnfolderBase]: 64/262 cut-off events. [2024-01-27 23:07:59,596 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:07:59,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 262 events. 64/262 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 824 event pairs, 64 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 353. Up to 130 conditions per place. [2024-01-27 23:07:59,598 INFO L140 encePairwiseOnDemand]: 235/243 looper letters, 26 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-01-27 23:07:59,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 138 transitions, 340 flow [2024-01-27 23:07:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2024-01-27 23:07:59,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7544581618655692 [2024-01-27 23:07:59,600 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 296 flow. Second operand 3 states and 550 transitions. [2024-01-27 23:07:59,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 138 transitions, 340 flow [2024-01-27 23:07:59,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 138 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:59,602 INFO L231 Difference]: Finished difference. Result has 145 places, 138 transitions, 284 flow [2024-01-27 23:07:59,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=145, PETRI_TRANSITIONS=138} [2024-01-27 23:07:59,603 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -102 predicate places. [2024-01-27 23:07:59,604 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 138 transitions, 284 flow [2024-01-27 23:07:59,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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 23:07:59,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:59,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:07:59,605 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:07:59,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1723211873, now seen corresponding path program 1 times [2024-01-27 23:07:59,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256209727] [2024-01-27 23:07:59,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,631 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 23:07:59,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256209727] [2024-01-27 23:07:59,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256209727] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603641637] [2024-01-27 23:07:59,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 243 [2024-01-27 23:07:59,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 138 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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 23:07:59,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 243 [2024-01-27 23:07:59,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,708 INFO L124 PetriNetUnfolderBase]: 64/260 cut-off events. [2024-01-27 23:07:59,708 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:07:59,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 260 events. 64/260 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 820 event pairs, 64 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 308. Up to 134 conditions per place. [2024-01-27 23:07:59,709 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 23 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-01-27 23:07:59,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 136 transitions, 330 flow [2024-01-27 23:07:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2024-01-27 23:07:59,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7736625514403292 [2024-01-27 23:07:59,711 INFO L175 Difference]: Start difference. First operand has 145 places, 138 transitions, 284 flow. Second operand 3 states and 564 transitions. [2024-01-27 23:07:59,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 136 transitions, 330 flow [2024-01-27 23:07:59,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 136 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:59,713 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 280 flow [2024-01-27 23:07:59,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2024-01-27 23:07:59,714 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -104 predicate places. [2024-01-27 23:07:59,715 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 280 flow [2024-01-27 23:07:59,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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 23:07:59,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:59,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:07:59,716 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:07:59,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash -426453868, now seen corresponding path program 1 times [2024-01-27 23:07:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638870850] [2024-01-27 23:07:59,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,747 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 23:07:59,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638870850] [2024-01-27 23:07:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638870850] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21992123] [2024-01-27 23:07:59,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 243 [2024-01-27 23:07:59,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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 23:07:59,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 243 [2024-01-27 23:07:59,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,810 INFO L124 PetriNetUnfolderBase]: 64/252 cut-off events. [2024-01-27 23:07:59,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:59,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 252 events. 64/252 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 812 event pairs, 64 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 367. Up to 128 conditions per place. [2024-01-27 23:07:59,812 INFO L140 encePairwiseOnDemand]: 233/243 looper letters, 29 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2024-01-27 23:07:59,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 128 transitions, 326 flow [2024-01-27 23:07:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2024-01-27 23:07:59,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2024-01-27 23:07:59,814 INFO L175 Difference]: Start difference. First operand has 143 places, 136 transitions, 280 flow. Second operand 3 states and 540 transitions. [2024-01-27 23:07:59,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 128 transitions, 326 flow [2024-01-27 23:07:59,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 128 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:59,816 INFO L231 Difference]: Finished difference. Result has 135 places, 128 transitions, 264 flow [2024-01-27 23:07:59,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=135, PETRI_TRANSITIONS=128} [2024-01-27 23:07:59,817 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -112 predicate places. [2024-01-27 23:07:59,817 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 128 transitions, 264 flow [2024-01-27 23:07:59,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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 23:07:59,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:59,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:07:59,818 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:07:59,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash -335166481, now seen corresponding path program 1 times [2024-01-27 23:07:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659584840] [2024-01-27 23:07:59,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,841 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 23:07:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659584840] [2024-01-27 23:07:59,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659584840] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407691903] [2024-01-27 23:07:59,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 243 [2024-01-27 23:07:59,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 128 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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 23:07:59,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 243 [2024-01-27 23:07:59,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,899 INFO L124 PetriNetUnfolderBase]: 64/245 cut-off events. [2024-01-27 23:07:59,899 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:07:59,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 245 events. 64/245 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 809 event pairs, 64 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 288. Up to 129 conditions per place. [2024-01-27 23:07:59,901 INFO L140 encePairwiseOnDemand]: 234/243 looper letters, 27 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2024-01-27 23:07:59,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 121 transitions, 308 flow [2024-01-27 23:07:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2024-01-27 23:07:59,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489711934156379 [2024-01-27 23:07:59,903 INFO L175 Difference]: Start difference. First operand has 135 places, 128 transitions, 264 flow. Second operand 3 states and 546 transitions. [2024-01-27 23:07:59,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 121 transitions, 308 flow [2024-01-27 23:07:59,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 121 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:59,905 INFO L231 Difference]: Finished difference. Result has 128 places, 121 transitions, 250 flow [2024-01-27 23:07:59,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=128, PETRI_TRANSITIONS=121} [2024-01-27 23:07:59,906 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -119 predicate places. [2024-01-27 23:07:59,906 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 121 transitions, 250 flow [2024-01-27 23:07:59,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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 23:07:59,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:59,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:07:59,907 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:07:59,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1800224744, now seen corresponding path program 1 times [2024-01-27 23:07:59,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264371546] [2024-01-27 23:07:59,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,928 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 23:07:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264371546] [2024-01-27 23:07:59,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264371546] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692690370] [2024-01-27 23:07:59,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 243 [2024-01-27 23:07:59,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 121 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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 23:07:59,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 243 [2024-01-27 23:07:59,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,989 INFO L124 PetriNetUnfolderBase]: 64/237 cut-off events. [2024-01-27 23:07:59,989 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:07:59,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 237 events. 64/237 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 738 event pairs, 49 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 293. Up to 104 conditions per place. [2024-01-27 23:07:59,990 INFO L140 encePairwiseOnDemand]: 235/243 looper letters, 32 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2024-01-27 23:07:59,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 123 transitions, 326 flow [2024-01-27 23:07:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2024-01-27 23:07:59,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.766803840877915 [2024-01-27 23:07:59,992 INFO L175 Difference]: Start difference. First operand has 128 places, 121 transitions, 250 flow. Second operand 3 states and 559 transitions. [2024-01-27 23:07:59,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 123 transitions, 326 flow [2024-01-27 23:07:59,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 123 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:59,994 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 242 flow [2024-01-27 23:07:59,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2024-01-27 23:07:59,995 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -124 predicate places. [2024-01-27 23:07:59,995 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 242 flow [2024-01-27 23:07:59,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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 23:07:59,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:59,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 23:07:59,996 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:07:59,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash 27609230, now seen corresponding path program 1 times [2024-01-27 23:07:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246899056] [2024-01-27 23:07:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:00,018 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 23:08:00,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:00,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246899056] [2024-01-27 23:08:00,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246899056] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:00,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:00,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784934847] [2024-01-27 23:08:00,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:00,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:00,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:00,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:00,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 243 [2024-01-27 23:08:00,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 116 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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 23:08:00,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:00,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 243 [2024-01-27 23:08:00,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:00,068 INFO L124 PetriNetUnfolderBase]: 64/239 cut-off events. [2024-01-27 23:08:00,068 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-01-27 23:08:00,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 239 events. 64/239 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 768 event pairs, 51 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 286. Up to 112 conditions per place. [2024-01-27 23:08:00,069 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 26 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2024-01-27 23:08:00,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 310 flow [2024-01-27 23:08:00,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2024-01-27 23:08:00,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7860082304526749 [2024-01-27 23:08:00,071 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 242 flow. Second operand 3 states and 573 transitions. [2024-01-27 23:08:00,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 310 flow [2024-01-27 23:08:00,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:00,073 INFO L231 Difference]: Finished difference. Result has 122 places, 115 transitions, 240 flow [2024-01-27 23:08:00,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=122, PETRI_TRANSITIONS=115} [2024-01-27 23:08:00,074 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -125 predicate places. [2024-01-27 23:08:00,074 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 115 transitions, 240 flow [2024-01-27 23:08:00,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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 23:08:00,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:00,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:00,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 23:08:00,075 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:08:00,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash 855887653, now seen corresponding path program 1 times [2024-01-27 23:08:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:00,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658149766] [2024-01-27 23:08:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:00,095 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 23:08:00,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:00,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658149766] [2024-01-27 23:08:00,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658149766] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:00,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:00,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:00,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357492845] [2024-01-27 23:08:00,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:00,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:00,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:00,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:00,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:00,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 243 [2024-01-27 23:08:00,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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 23:08:00,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:00,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 243 [2024-01-27 23:08:00,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:00,152 INFO L124 PetriNetUnfolderBase]: 64/235 cut-off events. [2024-01-27 23:08:00,152 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-27 23:08:00,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 235 events. 64/235 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 793 event pairs, 64 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 322. Up to 132 conditions per place. [2024-01-27 23:08:00,153 INFO L140 encePairwiseOnDemand]: 237/243 looper letters, 24 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-01-27 23:08:00,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 111 transitions, 284 flow [2024-01-27 23:08:00,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2024-01-27 23:08:00,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7654320987654321 [2024-01-27 23:08:00,155 INFO L175 Difference]: Start difference. First operand has 122 places, 115 transitions, 240 flow. Second operand 3 states and 558 transitions. [2024-01-27 23:08:00,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 111 transitions, 284 flow [2024-01-27 23:08:00,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 111 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:00,157 INFO L231 Difference]: Finished difference. Result has 118 places, 111 transitions, 230 flow [2024-01-27 23:08:00,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=118, PETRI_TRANSITIONS=111} [2024-01-27 23:08:00,158 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -129 predicate places. [2024-01-27 23:08:00,158 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 111 transitions, 230 flow [2024-01-27 23:08:00,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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 23:08:00,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:00,159 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] [2024-01-27 23:08:00,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 23:08:00,160 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:08:00,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:00,160 INFO L85 PathProgramCache]: Analyzing trace with hash -101512783, now seen corresponding path program 1 times [2024-01-27 23:08:00,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:00,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142793324] [2024-01-27 23:08:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:00,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:00,211 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 23:08:00,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:00,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142793324] [2024-01-27 23:08:00,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142793324] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:00,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:00,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:00,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723426483] [2024-01-27 23:08:00,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:00,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:00,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:00,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:00,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:00,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 243 [2024-01-27 23:08:00,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 111 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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 23:08:00,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:00,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 243 [2024-01-27 23:08:00,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:00,356 INFO L124 PetriNetUnfolderBase]: 64/234 cut-off events. [2024-01-27 23:08:00,356 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:08:00,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 234 events. 64/234 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 789 event pairs, 64 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 329. Up to 126 conditions per place. [2024-01-27 23:08:00,358 INFO L140 encePairwiseOnDemand]: 240/243 looper letters, 29 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2024-01-27 23:08:00,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 110 transitions, 290 flow [2024-01-27 23:08:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2024-01-27 23:08:00,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7229080932784636 [2024-01-27 23:08:00,360 INFO L175 Difference]: Start difference. First operand has 118 places, 111 transitions, 230 flow. Second operand 3 states and 527 transitions. [2024-01-27 23:08:00,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 110 transitions, 290 flow [2024-01-27 23:08:00,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 110 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:00,361 INFO L231 Difference]: Finished difference. Result has 117 places, 110 transitions, 228 flow [2024-01-27 23:08:00,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=117, PETRI_TRANSITIONS=110} [2024-01-27 23:08:00,362 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -130 predicate places. [2024-01-27 23:08:00,362 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 110 transitions, 228 flow [2024-01-27 23:08:00,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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 23:08:00,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:00,363 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] [2024-01-27 23:08:00,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 23:08:00,364 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:08:00,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash -508696212, now seen corresponding path program 1 times [2024-01-27 23:08:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:00,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852755667] [2024-01-27 23:08:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:00,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:00,522 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 23:08:00,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:00,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852755667] [2024-01-27 23:08:00,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852755667] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:00,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:00,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:08:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723284376] [2024-01-27 23:08:00,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:00,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:08:00,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:08:00,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:08:00,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 243 [2024-01-27 23:08:00,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 110 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 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 23:08:00,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:00,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 243 [2024-01-27 23:08:00,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:00,586 INFO L124 PetriNetUnfolderBase]: 64/223 cut-off events. [2024-01-27 23:08:00,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:08:00,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 223 events. 64/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 526 event pairs, 28 based on Foata normal form. 12/178 useless extension candidates. Maximal degree in co-relation 267. Up to 108 conditions per place. [2024-01-27 23:08:00,588 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 28 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2024-01-27 23:08:00,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 115 transitions, 300 flow [2024-01-27 23:08:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:08:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:08:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 752 transitions. [2024-01-27 23:08:00,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7736625514403292 [2024-01-27 23:08:00,590 INFO L175 Difference]: Start difference. First operand has 117 places, 110 transitions, 228 flow. Second operand 4 states and 752 transitions. [2024-01-27 23:08:00,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 115 transitions, 300 flow [2024-01-27 23:08:00,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:00,592 INFO L231 Difference]: Finished difference. Result has 116 places, 108 transitions, 224 flow [2024-01-27 23:08:00,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=108} [2024-01-27 23:08:00,593 INFO L281 CegarLoopForPetriNet]: 247 programPoint places, -131 predicate places. [2024-01-27 23:08:00,593 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 108 transitions, 224 flow [2024-01-27 23:08:00,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 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 23:08:00,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:00,594 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] [2024-01-27 23:08:00,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 23:08:00,594 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 171 more)] === [2024-01-27 23:08:00,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1410288225, now seen corresponding path program 1 times [2024-01-27 23:08:00,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:00,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486856330] [2024-01-27 23:08:00,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:00,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:08:00,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:08:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:08:00,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:08:00,639 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:08:00,640 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 174 remaining) [2024-01-27 23:08:00,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 174 remaining) [2024-01-27 23:08:00,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 174 remaining) [2024-01-27 23:08:00,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 174 remaining) [2024-01-27 23:08:00,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 174 remaining) [2024-01-27 23:08:00,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 174 remaining) [2024-01-27 23:08:00,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 174 remaining) [2024-01-27 23:08:00,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 174 remaining) [2024-01-27 23:08:00,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 174 remaining) [2024-01-27 23:08:00,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 174 remaining) [2024-01-27 23:08:00,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 174 remaining) [2024-01-27 23:08:00,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 174 remaining) [2024-01-27 23:08:00,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 174 remaining) [2024-01-27 23:08:00,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 174 remaining) [2024-01-27 23:08:00,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 174 remaining) [2024-01-27 23:08:00,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 174 remaining) [2024-01-27 23:08:00,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 174 remaining) [2024-01-27 23:08:00,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 174 remaining) [2024-01-27 23:08:00,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 174 remaining) [2024-01-27 23:08:00,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 174 remaining) [2024-01-27 23:08:00,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 174 remaining) [2024-01-27 23:08:00,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 174 remaining) [2024-01-27 23:08:00,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 174 remaining) [2024-01-27 23:08:00,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 174 remaining) [2024-01-27 23:08:00,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 174 remaining) [2024-01-27 23:08:00,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 174 remaining) [2024-01-27 23:08:00,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 174 remaining) [2024-01-27 23:08:00,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 174 remaining) [2024-01-27 23:08:00,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 174 remaining) [2024-01-27 23:08:00,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 174 remaining) [2024-01-27 23:08:00,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 174 remaining) [2024-01-27 23:08:00,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 174 remaining) [2024-01-27 23:08:00,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 174 remaining) [2024-01-27 23:08:00,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 174 remaining) [2024-01-27 23:08:00,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 174 remaining) [2024-01-27 23:08:00,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 174 remaining) [2024-01-27 23:08:00,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 174 remaining) [2024-01-27 23:08:00,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 174 remaining) [2024-01-27 23:08:00,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 174 remaining) [2024-01-27 23:08:00,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 174 remaining) [2024-01-27 23:08:00,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 174 remaining) [2024-01-27 23:08:00,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 174 remaining) [2024-01-27 23:08:00,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 174 remaining) [2024-01-27 23:08:00,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 174 remaining) [2024-01-27 23:08:00,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 174 remaining) [2024-01-27 23:08:00,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 174 remaining) [2024-01-27 23:08:00,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 174 remaining) [2024-01-27 23:08:00,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 174 remaining) [2024-01-27 23:08:00,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 174 remaining) [2024-01-27 23:08:00,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 174 remaining) [2024-01-27 23:08:00,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 174 remaining) [2024-01-27 23:08:00,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 174 remaining) [2024-01-27 23:08:00,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 174 remaining) [2024-01-27 23:08:00,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 174 remaining) [2024-01-27 23:08:00,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 174 remaining) [2024-01-27 23:08:00,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 174 remaining) [2024-01-27 23:08:00,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 174 remaining) [2024-01-27 23:08:00,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 174 remaining) [2024-01-27 23:08:00,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 174 remaining) [2024-01-27 23:08:00,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 174 remaining) [2024-01-27 23:08:00,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 174 remaining) [2024-01-27 23:08:00,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 174 remaining) [2024-01-27 23:08:00,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 174 remaining) [2024-01-27 23:08:00,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 174 remaining) [2024-01-27 23:08:00,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 174 remaining) [2024-01-27 23:08:00,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 174 remaining) [2024-01-27 23:08:00,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 174 remaining) [2024-01-27 23:08:00,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 174 remaining) [2024-01-27 23:08:00,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 174 remaining) [2024-01-27 23:08:00,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 174 remaining) [2024-01-27 23:08:00,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 174 remaining) [2024-01-27 23:08:00,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 174 remaining) [2024-01-27 23:08:00,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 174 remaining) [2024-01-27 23:08:00,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 174 remaining) [2024-01-27 23:08:00,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 174 remaining) [2024-01-27 23:08:00,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 174 remaining) [2024-01-27 23:08:00,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 174 remaining) [2024-01-27 23:08:00,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 174 remaining) [2024-01-27 23:08:00,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 174 remaining) [2024-01-27 23:08:00,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 174 remaining) [2024-01-27 23:08:00,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 174 remaining) [2024-01-27 23:08:00,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 174 remaining) [2024-01-27 23:08:00,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 174 remaining) [2024-01-27 23:08:00,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 174 remaining) [2024-01-27 23:08:00,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 174 remaining) [2024-01-27 23:08:00,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 174 remaining) [2024-01-27 23:08:00,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 174 remaining) [2024-01-27 23:08:00,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 174 remaining) [2024-01-27 23:08:00,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 174 remaining) [2024-01-27 23:08:00,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 174 remaining) [2024-01-27 23:08:00,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 174 remaining) [2024-01-27 23:08:00,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 174 remaining) [2024-01-27 23:08:00,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 174 remaining) [2024-01-27 23:08:00,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 174 remaining) [2024-01-27 23:08:00,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 174 remaining) [2024-01-27 23:08:00,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 174 remaining) [2024-01-27 23:08:00,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 174 remaining) [2024-01-27 23:08:00,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 174 remaining) [2024-01-27 23:08:00,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 174 remaining) [2024-01-27 23:08:00,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 174 remaining) [2024-01-27 23:08:00,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 174 remaining) [2024-01-27 23:08:00,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 174 remaining) [2024-01-27 23:08:00,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 174 remaining) [2024-01-27 23:08:00,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 174 remaining) [2024-01-27 23:08:00,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 174 remaining) [2024-01-27 23:08:00,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 174 remaining) [2024-01-27 23:08:00,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 174 remaining) [2024-01-27 23:08:00,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 174 remaining) [2024-01-27 23:08:00,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 174 remaining) [2024-01-27 23:08:00,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 174 remaining) [2024-01-27 23:08:00,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 174 remaining) [2024-01-27 23:08:00,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 174 remaining) [2024-01-27 23:08:00,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 174 remaining) [2024-01-27 23:08:00,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 174 remaining) [2024-01-27 23:08:00,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 174 remaining) [2024-01-27 23:08:00,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 174 remaining) [2024-01-27 23:08:00,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 174 remaining) [2024-01-27 23:08:00,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 174 remaining) [2024-01-27 23:08:00,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 174 remaining) [2024-01-27 23:08:00,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 174 remaining) [2024-01-27 23:08:00,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 174 remaining) [2024-01-27 23:08:00,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 174 remaining) [2024-01-27 23:08:00,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 174 remaining) [2024-01-27 23:08:00,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 174 remaining) [2024-01-27 23:08:00,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 174 remaining) [2024-01-27 23:08:00,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 174 remaining) [2024-01-27 23:08:00,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 174 remaining) [2024-01-27 23:08:00,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 174 remaining) [2024-01-27 23:08:00,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 174 remaining) [2024-01-27 23:08:00,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 174 remaining) [2024-01-27 23:08:00,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 174 remaining) [2024-01-27 23:08:00,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 174 remaining) [2024-01-27 23:08:00,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION (41 of 174 remaining) [2024-01-27 23:08:00,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 174 remaining) [2024-01-27 23:08:00,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 174 remaining) [2024-01-27 23:08:00,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 174 remaining) [2024-01-27 23:08:00,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 174 remaining) [2024-01-27 23:08:00,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 174 remaining) [2024-01-27 23:08:00,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 174 remaining) [2024-01-27 23:08:00,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 174 remaining) [2024-01-27 23:08:00,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 174 remaining) [2024-01-27 23:08:00,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 174 remaining) [2024-01-27 23:08:00,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 174 remaining) [2024-01-27 23:08:00,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 174 remaining) [2024-01-27 23:08:00,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 174 remaining) [2024-01-27 23:08:00,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 174 remaining) [2024-01-27 23:08:00,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 174 remaining) [2024-01-27 23:08:00,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 174 remaining) [2024-01-27 23:08:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 174 remaining) [2024-01-27 23:08:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 174 remaining) [2024-01-27 23:08:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 174 remaining) [2024-01-27 23:08:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 174 remaining) [2024-01-27 23:08:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 174 remaining) [2024-01-27 23:08:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 174 remaining) [2024-01-27 23:08:00,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 174 remaining) [2024-01-27 23:08:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 174 remaining) [2024-01-27 23:08:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 174 remaining) [2024-01-27 23:08:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 174 remaining) [2024-01-27 23:08:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 174 remaining) [2024-01-27 23:08:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 174 remaining) [2024-01-27 23:08:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 174 remaining) [2024-01-27 23:08:00,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 174 remaining) [2024-01-27 23:08:00,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 174 remaining) [2024-01-27 23:08:00,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 174 remaining) [2024-01-27 23:08:00,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 174 remaining) [2024-01-27 23:08:00,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 174 remaining) [2024-01-27 23:08:00,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 174 remaining) [2024-01-27 23:08:00,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 174 remaining) [2024-01-27 23:08:00,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 174 remaining) [2024-01-27 23:08:00,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 174 remaining) [2024-01-27 23:08:00,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 174 remaining) [2024-01-27 23:08:00,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 174 remaining) [2024-01-27 23:08:00,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 174 remaining) [2024-01-27 23:08:00,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 174 remaining) [2024-01-27 23:08:00,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 23:08:00,668 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:00,673 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:08:00,674 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:08:00,736 INFO L503 ceAbstractionStarter]: Automizer considered 131 witness invariants [2024-01-27 23:08:00,736 INFO L504 ceAbstractionStarter]: WitnessConsidered=131 [2024-01-27 23:08:00,737 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:08:00 BasicIcfg [2024-01-27 23:08:00,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:08:00,738 INFO L158 Benchmark]: Toolchain (without parser) took 4275.44ms. Allocated memory was 209.7MB in the beginning and 335.5MB in the end (delta: 125.8MB). Free memory was 158.2MB in the beginning and 189.5MB in the end (delta: -31.3MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2024-01-27 23:08:00,738 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:08:00,738 INFO L158 Benchmark]: Witness Parser took 0.40ms. Allocated memory is still 209.7MB. Free memory is still 164.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:08:00,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.49ms. Allocated memory is still 209.7MB. Free memory was 158.2MB in the beginning and 158.2MB in the end (delta: -41.4kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 23:08:00,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.47ms. Allocated memory is still 209.7MB. Free memory was 158.2MB in the beginning and 155.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 23:08:00,739 INFO L158 Benchmark]: Boogie Preprocessor took 81.01ms. Allocated memory is still 209.7MB. Free memory was 155.1MB in the beginning and 151.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:08:00,739 INFO L158 Benchmark]: RCFGBuilder took 1439.64ms. Allocated memory was 209.7MB in the beginning and 335.5MB in the end (delta: 125.8MB). Free memory was 151.4MB in the beginning and 175.9MB in the end (delta: -24.5MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2024-01-27 23:08:00,739 INFO L158 Benchmark]: TraceAbstraction took 2243.21ms. Allocated memory is still 335.5MB. Free memory was 174.8MB in the beginning and 189.5MB in the end (delta: -14.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:08:00,740 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.40ms. Allocated memory is still 209.7MB. Free memory is still 164.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.49ms. Allocated memory is still 209.7MB. Free memory was 158.2MB in the beginning and 158.2MB in the end (delta: -41.4kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.47ms. Allocated memory is still 209.7MB. Free memory was 158.2MB in the beginning and 155.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.01ms. Allocated memory is still 209.7MB. Free memory was 155.1MB in the beginning and 151.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1439.64ms. Allocated memory was 209.7MB in the beginning and 335.5MB in the end (delta: 125.8MB). Free memory was 151.4MB in the beginning and 175.9MB in the end (delta: -24.5MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2243.21ms. Allocated memory is still 335.5MB. Free memory was 174.8MB in the beginning and 189.5MB in the end (delta: -14.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 93]: 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, result_8, result_9; [L65] 0 pthread_t t1, t2; VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=0, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] [L67] 0 cardSet_0 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] [L68] 0 cardRarity_1 = __VERIFIER_nondet_int() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] [L69] 0 cardId_2 = __VERIFIER_nondet_int() [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] [L70] 0 cardType_3 = __VERIFIER_nondet_int() [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] [L71] 0 cardSet_4 = __VERIFIER_nondet_int() [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] [L72] 0 cardRarity_5 = __VERIFIER_nondet_int() [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] [L73] 0 cardId_6 = __VERIFIER_nondet_int() [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] [L74] 0 cardType_7 = __VERIFIER_nondet_int() [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[result_8]]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[result_8]],CastExpression[ACSLType[long long],IdentifierExpression[result_9]]],IntegerLiteral[0LL]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] [L75] 0 result_8 = __VERIFIER_nondet_int() [L76] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] [L76] 0 result_9 = __VERIFIER_nondet_int() [L79] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0, t1={5:0}, t2={3:0}] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=0] [L44] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L44] CALL 1 minus(cardSet_0, cardSet_4) [L93] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]] VAL [\old(a)=-2, \old(b)=0, a=-2, b=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardSet_0=-2, cardSet_4=0, cardType_3=0, cardType_7=0, result_8=0, result_9=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: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: 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: 79]: 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: 80]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 296 locations, 174 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: 1.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 672 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 845 IncrementalHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 52 mSDtfsCounter, 845 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 23:08:00,794 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