./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-collitem-subst.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-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ab2e0ac4 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-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-collitem-subst.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-ab2e0ac-m [2024-01-29 14:17:39,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:17:39,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:17:39,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:17:39,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:17:39,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:17:39,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:17:39,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:17:39,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:17:39,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:17:39,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:17:39,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:17:39,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:17:39,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:17:39,263 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:17:39,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:17:39,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:17:39,264 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:17:39,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:17:39,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:17:39,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:17:39,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:17:39,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:17:39,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:17:39,266 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:17:39,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:17:39,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:17:39,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:17:39,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:17:39,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:17:39,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:17:39,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:17:39,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:17:39,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:17:39,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:17:39,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:17:39,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:17:39,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:17:39,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:17:39,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:17:39,269 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:17:39,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:17:39,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:17:39,270 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-29 14:17:39,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:17:39,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:17:39,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:17:39,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:17:39,496 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:17:39,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c [2024-01-29 14:17:40,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:17:40,879 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:17:40,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-collitem-subst.wvr.c [2024-01-29 14:17:40,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5b90878/c85c0343094140149a700ed152933506/FLAGaa3a1934a [2024-01-29 14:17:40,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5b90878/c85c0343094140149a700ed152933506 [2024-01-29 14:17:40,905 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:17:40,905 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:17:40,906 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-subst.wvr.yml/witness.yml [2024-01-29 14:17:41,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:17:41,056 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:17:41,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:17:41,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:17:41,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:17:41,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:17:40" (1/2) ... [2024-01-29 14:17:41,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9db8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:41, skipping insertion in model container [2024-01-29 14:17:41,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:17:40" (1/2) ... [2024-01-29 14:17:41,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@29a1660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:41, skipping insertion in model container [2024-01-29 14:17:41,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:41" (2/2) ... [2024-01-29 14:17:41,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9db8f6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41, skipping insertion in model container [2024-01-29 14:17:41,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:41" (2/2) ... [2024-01-29 14:17:41,066 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:17:41,096 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:17:41,097 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,097 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] b != 0 [2024-01-29 14:17:41,098 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] b <= -1 [2024-01-29 14:17:41,098 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] result_12 == 0 [2024-01-29 14:17:41,098 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] result_13 == 0 [2024-01-29 14:17:41,098 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] result_14 == 0 [2024-01-29 14:17:41,098 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] cardType_11 == 0 [2024-01-29 14:17:41,098 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_13 == 0 [2024-01-29 14:17:41,098 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_14 == 0 [2024-01-29 14:17:41,099 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_12 == 0 [2024-01-29 14:17:41,099 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] cardType_11 == 0 [2024-01-29 14:17:41,099 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] result_12 == 0 [2024-01-29 14:17:41,099 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] result_13 == 0 [2024-01-29 14:17:41,099 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] result_14 == 0 [2024-01-29 14:17:41,099 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] cardId_10 == 0 [2024-01-29 14:17:41,099 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] cardType_11 == 0 [2024-01-29 14:17:41,100 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,100 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] result_14 == 0 [2024-01-29 14:17:41,100 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] result_12 == 0 [2024-01-29 14:17:41,100 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] result_13 == 0 [2024-01-29 14:17:41,100 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardId_6 == 0 [2024-01-29 14:17:41,101 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardType_7 == 0 [2024-01-29 14:17:41,101 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] result_13 == 0 [2024-01-29 14:17:41,101 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardSet_8 == 0 [2024-01-29 14:17:41,101 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardType_11 == 0 [2024-01-29 14:17:41,101 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] result_12 == 0 [2024-01-29 14:17:41,101 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardRarity_5 == 0 [2024-01-29 14:17:41,102 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardRarity_9 == 0 [2024-01-29 14:17:41,102 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] result_14 == 0 [2024-01-29 14:17:41,102 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cardId_10 == 0 [2024-01-29 14:17:41,102 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,102 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,102 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardId_2 == 0 [2024-01-29 14:17:41,102 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardId_10 == 0 [2024-01-29 14:17:41,103 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardType_11 == 0 [2024-01-29 14:17:41,103 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardRarity_1 == 0 [2024-01-29 14:17:41,103 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardType_7 == 0 [2024-01-29 14:17:41,103 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] result_12 == 0 [2024-01-29 14:17:41,105 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] result_14 == 0 [2024-01-29 14:17:41,105 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardId_6 == 0 [2024-01-29 14:17:41,105 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardSet_0 == 0 [2024-01-29 14:17:41,105 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardRarity_9 == 0 [2024-01-29 14:17:41,105 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardSet_8 == 0 [2024-01-29 14:17:41,105 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardSet_4 == 0 [2024-01-29 14:17:41,105 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardRarity_5 == 0 [2024-01-29 14:17:41,106 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] result_13 == 0 [2024-01-29 14:17:41,106 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cardType_3 == 0 [2024-01-29 14:17:41,106 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,106 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,106 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] result_12 == 0 [2024-01-29 14:17:41,106 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardRarity_5 == 0 [2024-01-29 14:17:41,107 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardId_6 == 0 [2024-01-29 14:17:41,107 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardRarity_9 == 0 [2024-01-29 14:17:41,107 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] result_13 == 0 [2024-01-29 14:17:41,107 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardType_7 == 0 [2024-01-29 14:17:41,108 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] result_14 == 0 [2024-01-29 14:17:41,108 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardId_10 == 0 [2024-01-29 14:17:41,109 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardSet_4 == 0 [2024-01-29 14:17:41,109 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardType_11 == 0 [2024-01-29 14:17:41,109 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cardSet_8 == 0 [2024-01-29 14:17:41,109 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] result_12 == 0 [2024-01-29 14:17:41,109 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardRarity_5 == 0 [2024-01-29 14:17:41,109 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardRarity_9 == 0 [2024-01-29 14:17:41,110 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] result_13 == 0 [2024-01-29 14:17:41,110 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardId_10 == 0 [2024-01-29 14:17:41,110 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardId_6 == 0 [2024-01-29 14:17:41,110 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardSet_8 == 0 [2024-01-29 14:17:41,110 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardSet_4 == 0 [2024-01-29 14:17:41,110 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] result_14 == 0 [2024-01-29 14:17:41,110 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardType_3 == 0 [2024-01-29 14:17:41,110 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardType_11 == 0 [2024-01-29 14:17:41,111 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cardType_7 == 0 [2024-01-29 14:17:41,111 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardType_11 == 0 [2024-01-29 14:17:41,111 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] result_14 == 0 [2024-01-29 14:17:41,111 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] result_12 == 0 [2024-01-29 14:17:41,111 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardId_10 == 0 [2024-01-29 14:17:41,111 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardType_7 == 0 [2024-01-29 14:17:41,111 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardSet_8 == 0 [2024-01-29 14:17:41,111 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardRarity_9 == 0 [2024-01-29 14:17:41,112 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cardId_6 == 0 [2024-01-29 14:17:41,112 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] result_13 == 0 [2024-01-29 14:17:41,112 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,112 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,112 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] result_13 == 0 [2024-01-29 14:17:41,112 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardType_11 == 0 [2024-01-29 14:17:41,112 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardType_7 == 0 [2024-01-29 14:17:41,112 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] result_12 == 0 [2024-01-29 14:17:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardSet_8 == 0 [2024-01-29 14:17:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardId_10 == 0 [2024-01-29 14:17:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] result_14 == 0 [2024-01-29 14:17:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cardRarity_9 == 0 [2024-01-29 14:17:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] result_14 == 0 [2024-01-29 14:17:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] cardRarity_9 == 0 [2024-01-29 14:17:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] cardId_10 == 0 [2024-01-29 14:17:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] result_12 == 0 [2024-01-29 14:17:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] result_13 == 0 [2024-01-29 14:17:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] cardType_11 == 0 [2024-01-29 14:17:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] result_12 == 0 [2024-01-29 14:17:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardId_10 == 0 [2024-01-29 14:17:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardSet_8 == 0 [2024-01-29 14:17:41,115 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] result_14 == 0 [2024-01-29 14:17:41,115 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardType_11 == 0 [2024-01-29 14:17:41,115 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cardRarity_9 == 0 [2024-01-29 14:17:41,115 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] result_13 == 0 [2024-01-29 14:17:41,116 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,116 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 14:17:41,116 INFO L98 nessWitnessExtractor]: Location invariant before [L107-L107] b != 0 [2024-01-29 14:17:41,118 INFO L98 nessWitnessExtractor]: Location invariant before [L107-L107] 1 <= b [2024-01-29 14:17:41,118 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] result_13 == 0 [2024-01-29 14:17:41,118 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardType_3 == 0 [2024-01-29 14:17:41,118 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardSet_4 == 0 [2024-01-29 14:17:41,118 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardId_10 == 0 [2024-01-29 14:17:41,118 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] result_12 == 0 [2024-01-29 14:17:41,119 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardRarity_9 == 0 [2024-01-29 14:17:41,119 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardSet_8 == 0 [2024-01-29 14:17:41,119 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardRarity_1 == 0 [2024-01-29 14:17:41,119 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardId_6 == 0 [2024-01-29 14:17:41,119 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] result_14 == 0 [2024-01-29 14:17:41,119 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardType_11 == 0 [2024-01-29 14:17:41,119 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardRarity_5 == 0 [2024-01-29 14:17:41,120 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardId_2 == 0 [2024-01-29 14:17:41,120 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cardType_7 == 0 [2024-01-29 14:17:41,120 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardId_6 == 0 [2024-01-29 14:17:41,120 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] result_13 == 0 [2024-01-29 14:17:41,120 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardSet_8 == 0 [2024-01-29 14:17:41,120 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardType_7 == 0 [2024-01-29 14:17:41,121 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardRarity_9 == 0 [2024-01-29 14:17:41,121 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardId_2 == 0 [2024-01-29 14:17:41,121 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardType_3 == 0 [2024-01-29 14:17:41,121 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] result_14 == 0 [2024-01-29 14:17:41,121 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardRarity_5 == 0 [2024-01-29 14:17:41,121 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardSet_4 == 0 [2024-01-29 14:17:41,121 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardType_11 == 0 [2024-01-29 14:17:41,121 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] result_12 == 0 [2024-01-29 14:17:41,122 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cardId_10 == 0 [2024-01-29 14:17:41,143 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:17:41,277 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-subst.wvr.c[3583,3596] [2024-01-29 14:17:41,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:17:41,298 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 14:17:41,308 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:17:41,411 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-subst.wvr.c[3583,3596] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:17:41,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:17:41,434 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:17:41,434 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41 WrapperNode [2024-01-29 14:17:41,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:17:41,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:17:41,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:17:41,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:17:41,442 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 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,450 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 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,493 INFO L138 Inliner]: procedures = 23, calls = 46, calls flagged for inlining = 18, calls inlined = 40, statements flattened = 544 [2024-01-29 14:17:41,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:17:41,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:17:41,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:17:41,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:17:41,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,539 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-29 14:17:41,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:17:41,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:17:41,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:17:41,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:17:41,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41" (1/1) ... [2024-01-29 14:17:41,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:17:41,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:17:41,614 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-29 14:17:41,632 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-29 14:17:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:17:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:17:41,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:17:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:17:41,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:17:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 14:17:41,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 14:17:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:17:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:17:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:17:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 14:17:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:17:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:17:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:17:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:17:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 14:17:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 14:17:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 14:17:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:17:41,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:17:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:17:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:17:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:17:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 14:17:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:17:41,664 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 14:17:41,761 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:17:41,763 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:17:42,390 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:17:42,390 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:17:43,228 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:17:43,229 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 14:17:43,229 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:17:43 BoogieIcfgContainer [2024-01-29 14:17:43,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:17:43,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:17:43,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:17:43,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:17:43,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:17:40" (1/4) ... [2024-01-29 14:17:43,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c76ecf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:17:43, skipping insertion in model container [2024-01-29 14:17:43,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:41" (2/4) ... [2024-01-29 14:17:43,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c76ecf8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:17:43, skipping insertion in model container [2024-01-29 14:17:43,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:41" (3/4) ... [2024-01-29 14:17:43,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c76ecf8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:17:43, skipping insertion in model container [2024-01-29 14:17:43,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:17:43" (4/4) ... [2024-01-29 14:17:43,235 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2024-01-29 14:17:43,248 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:17:43,248 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 178 error locations. [2024-01-29 14:17:43,249 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:17:43,504 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-29 14:17:43,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 324 transitions, 669 flow [2024-01-29 14:17:43,606 INFO L124 PetriNetUnfolderBase]: 0/321 cut-off events. [2024-01-29 14:17:43,606 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 14:17:43,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 321 events. 0/321 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 572 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-29 14:17:43,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 324 transitions, 669 flow [2024-01-29 14:17:43,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 320 transitions, 658 flow [2024-01-29 14:17:43,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:17:43,628 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;@48912fe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:17:43,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 241 error locations. [2024-01-29 14:17:43,630 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:17:43,630 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:17:43,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:17:43,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:43,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:17:43,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:43,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:43,635 INFO L85 PathProgramCache]: Analyzing trace with hash 66742, now seen corresponding path program 1 times [2024-01-29 14:17:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054325471] [2024-01-29 14:17:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:43,897 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-29 14:17:43,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:43,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054325471] [2024-01-29 14:17:43,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054325471] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:43,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:43,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:43,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008494459] [2024-01-29 14:17:43,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:43,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:43,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:43,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 324 [2024-01-29 14:17:43,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 320 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 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-29 14:17:43,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:43,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 324 [2024-01-29 14:17:43,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:44,136 INFO L124 PetriNetUnfolderBase]: 279/741 cut-off events. [2024-01-29 14:17:44,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:17:44,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 741 events. 279/741 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3337 event pairs, 279 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 995. Up to 458 conditions per place. [2024-01-29 14:17:44,144 INFO L140 encePairwiseOnDemand]: 270/324 looper letters, 31 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-01-29 14:17:44,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 255 transitions, 585 flow [2024-01-29 14:17:44,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 772 transitions. [2024-01-29 14:17:44,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7942386831275721 [2024-01-29 14:17:44,158 INFO L175 Difference]: Start difference. First operand has 330 places, 320 transitions, 658 flow. Second operand 3 states and 772 transitions. [2024-01-29 14:17:44,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 255 transitions, 585 flow [2024-01-29 14:17:44,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 255 transitions, 582 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 14:17:44,166 INFO L231 Difference]: Finished difference. Result has 264 places, 255 transitions, 520 flow [2024-01-29 14:17:44,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=264, PETRI_TRANSITIONS=255} [2024-01-29 14:17:44,170 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -66 predicate places. [2024-01-29 14:17:44,170 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 255 transitions, 520 flow [2024-01-29 14:17:44,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 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-29 14:17:44,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:44,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:17:44,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:17:44,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:44,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2070920, now seen corresponding path program 1 times [2024-01-29 14:17:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:44,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594807557] [2024-01-29 14:17:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:44,204 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-29 14:17:44,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:44,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594807557] [2024-01-29 14:17:44,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594807557] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:44,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:44,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:44,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172552465] [2024-01-29 14:17:44,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:44,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:44,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:44,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:44,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:44,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 324 [2024-01-29 14:17:44,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 255 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:44,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:44,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 324 [2024-01-29 14:17:44,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:44,398 INFO L124 PetriNetUnfolderBase]: 279/728 cut-off events. [2024-01-29 14:17:44,398 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:44,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 728 events. 279/728 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3308 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1133. Up to 472 conditions per place. [2024-01-29 14:17:44,402 INFO L140 encePairwiseOnDemand]: 310/324 looper letters, 39 selfloop transitions, 1 changer transitions 0/242 dead transitions. [2024-01-29 14:17:44,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 242 transitions, 574 flow [2024-01-29 14:17:44,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2024-01-29 14:17:44,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7119341563786008 [2024-01-29 14:17:44,418 INFO L175 Difference]: Start difference. First operand has 264 places, 255 transitions, 520 flow. Second operand 3 states and 692 transitions. [2024-01-29 14:17:44,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 242 transitions, 574 flow [2024-01-29 14:17:44,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 242 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:44,423 INFO L231 Difference]: Finished difference. Result has 251 places, 242 transitions, 492 flow [2024-01-29 14:17:44,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=251, PETRI_TRANSITIONS=242} [2024-01-29 14:17:44,424 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -79 predicate places. [2024-01-29 14:17:44,424 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 242 transitions, 492 flow [2024-01-29 14:17:44,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:44,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:44,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 14:17:44,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:17:44,425 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:44,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash 64200518, now seen corresponding path program 1 times [2024-01-29 14:17:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548065255] [2024-01-29 14:17:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:44,521 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-29 14:17:44,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:44,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548065255] [2024-01-29 14:17:44,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548065255] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:44,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:44,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:44,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29230587] [2024-01-29 14:17:44,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:44,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:44,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:44,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:44,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:44,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 324 [2024-01-29 14:17:44,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 242 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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-29 14:17:44,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:44,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 324 [2024-01-29 14:17:44,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:44,655 INFO L124 PetriNetUnfolderBase]: 279/722 cut-off events. [2024-01-29 14:17:44,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:17:44,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 722 events. 279/722 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3320 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1229. Up to 456 conditions per place. [2024-01-29 14:17:44,660 INFO L140 encePairwiseOnDemand]: 316/324 looper letters, 33 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2024-01-29 14:17:44,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 236 transitions, 550 flow [2024-01-29 14:17:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2024-01-29 14:17:44,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7366255144032922 [2024-01-29 14:17:44,662 INFO L175 Difference]: Start difference. First operand has 251 places, 242 transitions, 492 flow. Second operand 3 states and 716 transitions. [2024-01-29 14:17:44,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 236 transitions, 550 flow [2024-01-29 14:17:44,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 236 transitions, 549 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:17:44,666 INFO L231 Difference]: Finished difference. Result has 246 places, 236 transitions, 483 flow [2024-01-29 14:17:44,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=246, PETRI_TRANSITIONS=236} [2024-01-29 14:17:44,667 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -84 predicate places. [2024-01-29 14:17:44,667 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 236 transitions, 483 flow [2024-01-29 14:17:44,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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-29 14:17:44,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:44,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 14:17:44,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:17:44,668 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:44,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1990218163, now seen corresponding path program 1 times [2024-01-29 14:17:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:44,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465832679] [2024-01-29 14:17:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:44,697 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-29 14:17:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465832679] [2024-01-29 14:17:44,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465832679] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:44,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:44,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661408404] [2024-01-29 14:17:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:44,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:44,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:44,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:44,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:44,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 324 [2024-01-29 14:17:44,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 236 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:44,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:44,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 324 [2024-01-29 14:17:44,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:44,822 INFO L124 PetriNetUnfolderBase]: 279/717 cut-off events. [2024-01-29 14:17:44,823 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:44,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 717 events. 279/717 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3314 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1224. Up to 457 conditions per place. [2024-01-29 14:17:44,827 INFO L140 encePairwiseOnDemand]: 317/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2024-01-29 14:17:44,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 231 transitions, 541 flow [2024-01-29 14:17:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2024-01-29 14:17:44,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2024-01-29 14:17:44,829 INFO L175 Difference]: Start difference. First operand has 246 places, 236 transitions, 483 flow. Second operand 3 states and 720 transitions. [2024-01-29 14:17:44,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 231 transitions, 541 flow [2024-01-29 14:17:44,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 231 transitions, 537 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:44,833 INFO L231 Difference]: Finished difference. Result has 241 places, 231 transitions, 473 flow [2024-01-29 14:17:44,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=241, PETRI_TRANSITIONS=231} [2024-01-29 14:17:44,834 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -89 predicate places. [2024-01-29 14:17:44,834 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 231 transitions, 473 flow [2024-01-29 14:17:44,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:44,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:44,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:17:44,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:17:44,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:44,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1567222948, now seen corresponding path program 1 times [2024-01-29 14:17:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:44,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46091323] [2024-01-29 14:17:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:44,861 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-29 14:17:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:44,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46091323] [2024-01-29 14:17:44,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46091323] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:44,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:44,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286197567] [2024-01-29 14:17:44,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:44,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:44,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:44,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:44,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:44,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 324 [2024-01-29 14:17:44,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 231 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:44,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:44,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 324 [2024-01-29 14:17:44,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:44,995 INFO L124 PetriNetUnfolderBase]: 279/708 cut-off events. [2024-01-29 14:17:44,995 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:44,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 708 events. 279/708 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3291 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1219. Up to 453 conditions per place. [2024-01-29 14:17:44,998 INFO L140 encePairwiseOnDemand]: 313/324 looper letters, 36 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-01-29 14:17:44,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 222 transitions, 531 flow [2024-01-29 14:17:44,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2024-01-29 14:17:45,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7242798353909465 [2024-01-29 14:17:45,000 INFO L175 Difference]: Start difference. First operand has 241 places, 231 transitions, 473 flow. Second operand 3 states and 704 transitions. [2024-01-29 14:17:45,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 222 transitions, 531 flow [2024-01-29 14:17:45,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 222 transitions, 527 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,003 INFO L231 Difference]: Finished difference. Result has 232 places, 222 transitions, 455 flow [2024-01-29 14:17:45,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=232, PETRI_TRANSITIONS=222} [2024-01-29 14:17:45,004 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -98 predicate places. [2024-01-29 14:17:45,005 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 222 transitions, 455 flow [2024-01-29 14:17:45,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:17:45,006 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:45,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1339273066, now seen corresponding path program 1 times [2024-01-29 14:17:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615162518] [2024-01-29 14:17:45,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,028 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-29 14:17:45,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615162518] [2024-01-29 14:17:45,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615162518] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272468244] [2024-01-29 14:17:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 324 [2024-01-29 14:17:45,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 222 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 324 [2024-01-29 14:17:45,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,128 INFO L124 PetriNetUnfolderBase]: 279/698 cut-off events. [2024-01-29 14:17:45,128 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:45,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 698 events. 279/698 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3322 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1210. Up to 452 conditions per place. [2024-01-29 14:17:45,132 INFO L140 encePairwiseOnDemand]: 312/324 looper letters, 37 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-01-29 14:17:45,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 212 transitions, 513 flow [2024-01-29 14:17:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2024-01-29 14:17:45,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.720164609053498 [2024-01-29 14:17:45,134 INFO L175 Difference]: Start difference. First operand has 232 places, 222 transitions, 455 flow. Second operand 3 states and 700 transitions. [2024-01-29 14:17:45,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 212 transitions, 513 flow [2024-01-29 14:17:45,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 212 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,137 INFO L231 Difference]: Finished difference. Result has 222 places, 212 transitions, 435 flow [2024-01-29 14:17:45,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=222, PETRI_TRANSITIONS=212} [2024-01-29 14:17:45,138 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -108 predicate places. [2024-01-29 14:17:45,138 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 212 transitions, 435 flow [2024-01-29 14:17:45,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:17:45,140 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:45,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1432205737, now seen corresponding path program 1 times [2024-01-29 14:17:45,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830806085] [2024-01-29 14:17:45,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830806085] [2024-01-29 14:17:45,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830806085] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407439972] [2024-01-29 14:17:45,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 324 [2024-01-29 14:17:45,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 212 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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-29 14:17:45,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 324 [2024-01-29 14:17:45,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,243 INFO L124 PetriNetUnfolderBase]: 279/697 cut-off events. [2024-01-29 14:17:45,243 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:45,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 697 events. 279/697 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3302 event pairs, 279 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 1200. Up to 461 conditions per place. [2024-01-29 14:17:45,246 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 28 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-01-29 14:17:45,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 211 transitions, 493 flow [2024-01-29 14:17:45,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2024-01-29 14:17:45,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.757201646090535 [2024-01-29 14:17:45,248 INFO L175 Difference]: Start difference. First operand has 222 places, 212 transitions, 435 flow. Second operand 3 states and 736 transitions. [2024-01-29 14:17:45,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 211 transitions, 493 flow [2024-01-29 14:17:45,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 211 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,251 INFO L231 Difference]: Finished difference. Result has 221 places, 211 transitions, 433 flow [2024-01-29 14:17:45,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=221, PETRI_TRANSITIONS=211} [2024-01-29 14:17:45,252 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -109 predicate places. [2024-01-29 14:17:45,252 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 211 transitions, 433 flow [2024-01-29 14:17:45,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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-29 14:17:45,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:17:45,253 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:45,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1448702854, now seen corresponding path program 1 times [2024-01-29 14:17:45,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364304019] [2024-01-29 14:17:45,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,278 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-29 14:17:45,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364304019] [2024-01-29 14:17:45,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364304019] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091878104] [2024-01-29 14:17:45,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 324 [2024-01-29 14:17:45,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 211 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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-29 14:17:45,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 324 [2024-01-29 14:17:45,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,364 INFO L124 PetriNetUnfolderBase]: 279/690 cut-off events. [2024-01-29 14:17:45,365 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:45,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 690 events. 279/690 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3284 event pairs, 279 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1197. Up to 455 conditions per place. [2024-01-29 14:17:45,368 INFO L140 encePairwiseOnDemand]: 315/324 looper letters, 32 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2024-01-29 14:17:45,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 204 transitions, 487 flow [2024-01-29 14:17:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2024-01-29 14:17:45,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7366255144032922 [2024-01-29 14:17:45,370 INFO L175 Difference]: Start difference. First operand has 221 places, 211 transitions, 433 flow. Second operand 3 states and 716 transitions. [2024-01-29 14:17:45,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 204 transitions, 487 flow [2024-01-29 14:17:45,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 204 transitions, 483 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,373 INFO L231 Difference]: Finished difference. Result has 214 places, 204 transitions, 419 flow [2024-01-29 14:17:45,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=214, PETRI_TRANSITIONS=204} [2024-01-29 14:17:45,374 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -116 predicate places. [2024-01-29 14:17:45,374 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 204 transitions, 419 flow [2024-01-29 14:17:45,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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-29 14:17:45,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:17:45,375 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:45,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1960113356, now seen corresponding path program 1 times [2024-01-29 14:17:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141300927] [2024-01-29 14:17:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:45,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141300927] [2024-01-29 14:17:45,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141300927] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572688345] [2024-01-29 14:17:45,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 324 [2024-01-29 14:17:45,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 204 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 324 [2024-01-29 14:17:45,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,500 INFO L124 PetriNetUnfolderBase]: 279/677 cut-off events. [2024-01-29 14:17:45,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:17:45,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 677 events. 279/677 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3239 event pairs, 279 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1190. Up to 472 conditions per place. [2024-01-29 14:17:45,504 INFO L140 encePairwiseOnDemand]: 310/324 looper letters, 39 selfloop transitions, 1 changer transitions 0/191 dead transitions. [2024-01-29 14:17:45,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 191 transitions, 473 flow [2024-01-29 14:17:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2024-01-29 14:17:45,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7119341563786008 [2024-01-29 14:17:45,506 INFO L175 Difference]: Start difference. First operand has 214 places, 204 transitions, 419 flow. Second operand 3 states and 692 transitions. [2024-01-29 14:17:45,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 191 transitions, 473 flow [2024-01-29 14:17:45,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 191 transitions, 469 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,509 INFO L231 Difference]: Finished difference. Result has 201 places, 191 transitions, 391 flow [2024-01-29 14:17:45,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=201, PETRI_TRANSITIONS=191} [2024-01-29 14:17:45,509 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -129 predicate places. [2024-01-29 14:17:45,510 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 191 transitions, 391 flow [2024-01-29 14:17:45,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:17:45,511 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:45,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash -633969820, now seen corresponding path program 1 times [2024-01-29 14:17:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212014390] [2024-01-29 14:17:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,530 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-29 14:17:45,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212014390] [2024-01-29 14:17:45,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212014390] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755034035] [2024-01-29 14:17:45,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 324 [2024-01-29 14:17:45,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 191 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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-29 14:17:45,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 324 [2024-01-29 14:17:45,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,614 INFO L124 PetriNetUnfolderBase]: 279/664 cut-off events. [2024-01-29 14:17:45,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:17:45,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 664 events. 279/664 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3236 event pairs, 279 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1173. Up to 469 conditions per place. [2024-01-29 14:17:45,618 INFO L140 encePairwiseOnDemand]: 310/324 looper letters, 36 selfloop transitions, 1 changer transitions 0/178 dead transitions. [2024-01-29 14:17:45,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 178 transitions, 439 flow [2024-01-29 14:17:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2024-01-29 14:17:45,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7181069958847737 [2024-01-29 14:17:45,620 INFO L175 Difference]: Start difference. First operand has 201 places, 191 transitions, 391 flow. Second operand 3 states and 698 transitions. [2024-01-29 14:17:45,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 178 transitions, 439 flow [2024-01-29 14:17:45,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 178 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:17:45,623 INFO L231 Difference]: Finished difference. Result has 189 places, 178 transitions, 366 flow [2024-01-29 14:17:45,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=189, PETRI_TRANSITIONS=178} [2024-01-29 14:17:45,624 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -141 predicate places. [2024-01-29 14:17:45,624 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 178 transitions, 366 flow [2024-01-29 14:17:45,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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-29 14:17:45,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:17:45,625 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:45,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1821774276, now seen corresponding path program 1 times [2024-01-29 14:17:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173280860] [2024-01-29 14:17:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,644 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-29 14:17:45,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173280860] [2024-01-29 14:17:45,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173280860] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081250197] [2024-01-29 14:17:45,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 324 [2024-01-29 14:17:45,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 178 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 324 [2024-01-29 14:17:45,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,731 INFO L124 PetriNetUnfolderBase]: 279/656 cut-off events. [2024-01-29 14:17:45,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:17:45,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 656 events. 279/656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3251 event pairs, 279 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1165. Up to 454 conditions per place. [2024-01-29 14:17:45,734 INFO L140 encePairwiseOnDemand]: 314/324 looper letters, 35 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-01-29 14:17:45,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 170 transitions, 424 flow [2024-01-29 14:17:45,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2024-01-29 14:17:45,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2024-01-29 14:17:45,737 INFO L175 Difference]: Start difference. First operand has 189 places, 178 transitions, 366 flow. Second operand 3 states and 708 transitions. [2024-01-29 14:17:45,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 170 transitions, 424 flow [2024-01-29 14:17:45,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 170 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:17:45,739 INFO L231 Difference]: Finished difference. Result has 182 places, 170 transitions, 353 flow [2024-01-29 14:17:45,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=182, PETRI_TRANSITIONS=170} [2024-01-29 14:17:45,740 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -148 predicate places. [2024-01-29 14:17:45,740 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 170 transitions, 353 flow [2024-01-29 14:17:45,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 14:17:45,741 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:45,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash 640429774, now seen corresponding path program 1 times [2024-01-29 14:17:45,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268927102] [2024-01-29 14:17:45,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:45,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268927102] [2024-01-29 14:17:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268927102] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332898448] [2024-01-29 14:17:45,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2024-01-29 14:17:45,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 170 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2024-01-29 14:17:45,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,839 INFO L124 PetriNetUnfolderBase]: 279/654 cut-off events. [2024-01-29 14:17:45,840 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:45,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 654 events. 279/654 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3214 event pairs, 279 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1158. Up to 460 conditions per place. [2024-01-29 14:17:45,843 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-01-29 14:17:45,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 168 transitions, 411 flow [2024-01-29 14:17:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2024-01-29 14:17:45,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2024-01-29 14:17:45,845 INFO L175 Difference]: Start difference. First operand has 182 places, 170 transitions, 353 flow. Second operand 3 states and 732 transitions. [2024-01-29 14:17:45,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 168 transitions, 411 flow [2024-01-29 14:17:45,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 168 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,847 INFO L231 Difference]: Finished difference. Result has 180 places, 168 transitions, 349 flow [2024-01-29 14:17:45,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=180, PETRI_TRANSITIONS=168} [2024-01-29 14:17:45,848 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -150 predicate places. [2024-01-29 14:17:45,848 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 168 transitions, 349 flow [2024-01-29 14:17:45,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 14:17:45,849 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:45,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1621511474, now seen corresponding path program 1 times [2024-01-29 14:17:45,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445296656] [2024-01-29 14:17:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,867 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-29 14:17:45,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445296656] [2024-01-29 14:17:45,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445296656] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762301283] [2024-01-29 14:17:45,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 324 [2024-01-29 14:17:45,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 168 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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-29 14:17:45,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 324 [2024-01-29 14:17:45,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,982 INFO L124 PetriNetUnfolderBase]: 279/642 cut-off events. [2024-01-29 14:17:45,983 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:45,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 642 events. 279/642 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3185 event pairs, 279 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 1155. Up to 450 conditions per place. [2024-01-29 14:17:45,985 INFO L140 encePairwiseOnDemand]: 310/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2024-01-29 14:17:45,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 156 transitions, 405 flow [2024-01-29 14:17:45,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2024-01-29 14:17:45,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7139917695473251 [2024-01-29 14:17:45,987 INFO L175 Difference]: Start difference. First operand has 180 places, 168 transitions, 349 flow. Second operand 3 states and 694 transitions. [2024-01-29 14:17:45,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 156 transitions, 405 flow [2024-01-29 14:17:45,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 156 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:45,989 INFO L231 Difference]: Finished difference. Result has 168 places, 156 transitions, 325 flow [2024-01-29 14:17:45,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=168, PETRI_TRANSITIONS=156} [2024-01-29 14:17:45,990 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -162 predicate places. [2024-01-29 14:17:45,990 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 156 transitions, 325 flow [2024-01-29 14:17:45,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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-29 14:17:45,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:45,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 14:17:45,991 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:45,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1272753884, now seen corresponding path program 1 times [2024-01-29 14:17:45,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849792544] [2024-01-29 14:17:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:46,009 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-29 14:17:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:46,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849792544] [2024-01-29 14:17:46,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849792544] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:46,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:46,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087685127] [2024-01-29 14:17:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:46,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:46,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:46,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:46,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 324 [2024-01-29 14:17:46,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 156 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:46,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 324 [2024-01-29 14:17:46,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:46,096 INFO L124 PetriNetUnfolderBase]: 279/631 cut-off events. [2024-01-29 14:17:46,097 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:46,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 631 events. 279/631 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3194 event pairs, 279 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 1144. Up to 451 conditions per place. [2024-01-29 14:17:46,100 INFO L140 encePairwiseOnDemand]: 311/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-01-29 14:17:46,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 145 transitions, 383 flow [2024-01-29 14:17:46,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2024-01-29 14:17:46,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2024-01-29 14:17:46,102 INFO L175 Difference]: Start difference. First operand has 168 places, 156 transitions, 325 flow. Second operand 3 states and 696 transitions. [2024-01-29 14:17:46,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 145 transitions, 383 flow [2024-01-29 14:17:46,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 145 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:46,104 INFO L231 Difference]: Finished difference. Result has 157 places, 145 transitions, 303 flow [2024-01-29 14:17:46,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=157, PETRI_TRANSITIONS=145} [2024-01-29 14:17:46,105 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -173 predicate places. [2024-01-29 14:17:46,105 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 145 transitions, 303 flow [2024-01-29 14:17:46,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:46,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:46,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 14:17:46,106 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:46,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash 800666921, now seen corresponding path program 1 times [2024-01-29 14:17:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:46,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573973817] [2024-01-29 14:17:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:46,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:46,123 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-29 14:17:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:46,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573973817] [2024-01-29 14:17:46,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573973817] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:46,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:46,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847708509] [2024-01-29 14:17:46,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:46,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:46,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:46,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:46,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 324 [2024-01-29 14:17:46,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 145 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 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-29 14:17:46,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:46,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 324 [2024-01-29 14:17:46,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:46,201 INFO L124 PetriNetUnfolderBase]: 279/628 cut-off events. [2024-01-29 14:17:46,201 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:46,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 628 events. 279/628 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3203 event pairs, 279 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 1132. Up to 459 conditions per place. [2024-01-29 14:17:46,204 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 29 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2024-01-29 14:17:46,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 142 transitions, 359 flow [2024-01-29 14:17:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2024-01-29 14:17:46,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7510288065843621 [2024-01-29 14:17:46,206 INFO L175 Difference]: Start difference. First operand has 157 places, 145 transitions, 303 flow. Second operand 3 states and 730 transitions. [2024-01-29 14:17:46,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 142 transitions, 359 flow [2024-01-29 14:17:46,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 142 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:46,209 INFO L231 Difference]: Finished difference. Result has 154 places, 142 transitions, 297 flow [2024-01-29 14:17:46,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=154, PETRI_TRANSITIONS=142} [2024-01-29 14:17:46,209 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -176 predicate places. [2024-01-29 14:17:46,209 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 142 transitions, 297 flow [2024-01-29 14:17:46,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 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-29 14:17:46,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:46,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:46,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 14:17:46,210 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:46,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash -274774340, now seen corresponding path program 1 times [2024-01-29 14:17:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:46,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690489156] [2024-01-29 14:17:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:46,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:46,347 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-29 14:17:46,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:46,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690489156] [2024-01-29 14:17:46,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690489156] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:46,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:46,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:17:46,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705770785] [2024-01-29 14:17:46,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:46,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:46,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:46,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:46,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:46,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 324 [2024-01-29 14:17:46,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 142 transitions, 297 flow. Second operand has 4 states, 4 states have (on average 238.25) internal successors, (953), 4 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:46,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 324 [2024-01-29 14:17:46,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:46,445 INFO L124 PetriNetUnfolderBase]: 279/586 cut-off events. [2024-01-29 14:17:46,446 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:46,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 586 events. 279/586 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2194 event pairs, 165 based on Foata normal form. 42/429 useless extension candidates. Maximal degree in co-relation 1088. Up to 366 conditions per place. [2024-01-29 14:17:46,449 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 38 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2024-01-29 14:17:46,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 151 transitions, 399 flow [2024-01-29 14:17:46,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:17:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:17:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 978 transitions. [2024-01-29 14:17:46,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7546296296296297 [2024-01-29 14:17:46,451 INFO L175 Difference]: Start difference. First operand has 154 places, 142 transitions, 297 flow. Second operand 4 states and 978 transitions. [2024-01-29 14:17:46,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 151 transitions, 399 flow [2024-01-29 14:17:46,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 151 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:46,453 INFO L231 Difference]: Finished difference. Result has 153 places, 140 transitions, 293 flow [2024-01-29 14:17:46,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=153, PETRI_TRANSITIONS=140} [2024-01-29 14:17:46,454 INFO L281 CegarLoopForPetriNet]: 330 programPoint places, -177 predicate places. [2024-01-29 14:17:46,454 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 140 transitions, 293 flow [2024-01-29 14:17:46,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 238.25) internal successors, (953), 4 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:46,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:46,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 14:17:46,455 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 238 more)] === [2024-01-29 14:17:46,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:46,456 INFO L85 PathProgramCache]: Analyzing trace with hash 71932274, now seen corresponding path program 1 times [2024-01-29 14:17:46,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:46,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312871801] [2024-01-29 14:17:46,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:46,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:17:46,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:17:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:17:46,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:17:46,524 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:17:46,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (240 of 241 remaining) [2024-01-29 14:17:46,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (239 of 241 remaining) [2024-01-29 14:17:46,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (238 of 241 remaining) [2024-01-29 14:17:46,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (237 of 241 remaining) [2024-01-29 14:17:46,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (236 of 241 remaining) [2024-01-29 14:17:46,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (235 of 241 remaining) [2024-01-29 14:17:46,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (234 of 241 remaining) [2024-01-29 14:17:46,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (233 of 241 remaining) [2024-01-29 14:17:46,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (232 of 241 remaining) [2024-01-29 14:17:46,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (231 of 241 remaining) [2024-01-29 14:17:46,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (230 of 241 remaining) [2024-01-29 14:17:46,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (229 of 241 remaining) [2024-01-29 14:17:46,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (228 of 241 remaining) [2024-01-29 14:17:46,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (227 of 241 remaining) [2024-01-29 14:17:46,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (226 of 241 remaining) [2024-01-29 14:17:46,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (225 of 241 remaining) [2024-01-29 14:17:46,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (224 of 241 remaining) [2024-01-29 14:17:46,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (223 of 241 remaining) [2024-01-29 14:17:46,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 241 remaining) [2024-01-29 14:17:46,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 241 remaining) [2024-01-29 14:17:46,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 241 remaining) [2024-01-29 14:17:46,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 241 remaining) [2024-01-29 14:17:46,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 241 remaining) [2024-01-29 14:17:46,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 241 remaining) [2024-01-29 14:17:46,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 241 remaining) [2024-01-29 14:17:46,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 241 remaining) [2024-01-29 14:17:46,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 241 remaining) [2024-01-29 14:17:46,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 241 remaining) [2024-01-29 14:17:46,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 241 remaining) [2024-01-29 14:17:46,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 241 remaining) [2024-01-29 14:17:46,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 241 remaining) [2024-01-29 14:17:46,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 241 remaining) [2024-01-29 14:17:46,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 241 remaining) [2024-01-29 14:17:46,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 241 remaining) [2024-01-29 14:17:46,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 241 remaining) [2024-01-29 14:17:46,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 241 remaining) [2024-01-29 14:17:46,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (204 of 241 remaining) [2024-01-29 14:17:46,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (203 of 241 remaining) [2024-01-29 14:17:46,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 241 remaining) [2024-01-29 14:17:46,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 241 remaining) [2024-01-29 14:17:46,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 241 remaining) [2024-01-29 14:17:46,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 241 remaining) [2024-01-29 14:17:46,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 241 remaining) [2024-01-29 14:17:46,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 241 remaining) [2024-01-29 14:17:46,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 241 remaining) [2024-01-29 14:17:46,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 241 remaining) [2024-01-29 14:17:46,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 241 remaining) [2024-01-29 14:17:46,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 241 remaining) [2024-01-29 14:17:46,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 241 remaining) [2024-01-29 14:17:46,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 241 remaining) [2024-01-29 14:17:46,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 241 remaining) [2024-01-29 14:17:46,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 241 remaining) [2024-01-29 14:17:46,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 241 remaining) [2024-01-29 14:17:46,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 241 remaining) [2024-01-29 14:17:46,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 241 remaining) [2024-01-29 14:17:46,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 241 remaining) [2024-01-29 14:17:46,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err15ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 241 remaining) [2024-01-29 14:17:46,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err16ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 241 remaining) [2024-01-29 14:17:46,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err17ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 241 remaining) [2024-01-29 14:17:46,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err18ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 241 remaining) [2024-01-29 14:17:46,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err19ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 241 remaining) [2024-01-29 14:17:46,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 241 remaining) [2024-01-29 14:17:46,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 241 remaining) [2024-01-29 14:17:46,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 241 remaining) [2024-01-29 14:17:46,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 241 remaining) [2024-01-29 14:17:46,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 241 remaining) [2024-01-29 14:17:46,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 241 remaining) [2024-01-29 14:17:46,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 241 remaining) [2024-01-29 14:17:46,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 241 remaining) [2024-01-29 14:17:46,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 241 remaining) [2024-01-29 14:17:46,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 241 remaining) [2024-01-29 14:17:46,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 241 remaining) [2024-01-29 14:17:46,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 241 remaining) [2024-01-29 14:17:46,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 241 remaining) [2024-01-29 14:17:46,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 241 remaining) [2024-01-29 14:17:46,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 241 remaining) [2024-01-29 14:17:46,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 241 remaining) [2024-01-29 14:17:46,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 241 remaining) [2024-01-29 14:17:46,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 241 remaining) [2024-01-29 14:17:46,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 241 remaining) [2024-01-29 14:17:46,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 241 remaining) [2024-01-29 14:17:46,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 241 remaining) [2024-01-29 14:17:46,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 241 remaining) [2024-01-29 14:17:46,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 241 remaining) [2024-01-29 14:17:46,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 241 remaining) [2024-01-29 14:17:46,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 241 remaining) [2024-01-29 14:17:46,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 241 remaining) [2024-01-29 14:17:46,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 241 remaining) [2024-01-29 14:17:46,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 241 remaining) [2024-01-29 14:17:46,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 241 remaining) [2024-01-29 14:17:46,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 241 remaining) [2024-01-29 14:17:46,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 241 remaining) [2024-01-29 14:17:46,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 241 remaining) [2024-01-29 14:17:46,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 241 remaining) [2024-01-29 14:17:46,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 241 remaining) [2024-01-29 14:17:46,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 241 remaining) [2024-01-29 14:17:46,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 241 remaining) [2024-01-29 14:17:46,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 241 remaining) [2024-01-29 14:17:46,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 241 remaining) [2024-01-29 14:17:46,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 241 remaining) [2024-01-29 14:17:46,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 241 remaining) [2024-01-29 14:17:46,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 241 remaining) [2024-01-29 14:17:46,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 241 remaining) [2024-01-29 14:17:46,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 241 remaining) [2024-01-29 14:17:46,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 241 remaining) [2024-01-29 14:17:46,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 241 remaining) [2024-01-29 14:17:46,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 241 remaining) [2024-01-29 14:17:46,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 241 remaining) [2024-01-29 14:17:46,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 241 remaining) [2024-01-29 14:17:46,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 241 remaining) [2024-01-29 14:17:46,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 241 remaining) [2024-01-29 14:17:46,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 241 remaining) [2024-01-29 14:17:46,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 241 remaining) [2024-01-29 14:17:46,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 241 remaining) [2024-01-29 14:17:46,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 241 remaining) [2024-01-29 14:17:46,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 241 remaining) [2024-01-29 14:17:46,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 241 remaining) [2024-01-29 14:17:46,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 241 remaining) [2024-01-29 14:17:46,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 241 remaining) [2024-01-29 14:17:46,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 241 remaining) [2024-01-29 14:17:46,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 241 remaining) [2024-01-29 14:17:46,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 241 remaining) [2024-01-29 14:17:46,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 241 remaining) [2024-01-29 14:17:46,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 241 remaining) [2024-01-29 14:17:46,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 241 remaining) [2024-01-29 14:17:46,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 241 remaining) [2024-01-29 14:17:46,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 241 remaining) [2024-01-29 14:17:46,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 241 remaining) [2024-01-29 14:17:46,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 241 remaining) [2024-01-29 14:17:46,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 241 remaining) [2024-01-29 14:17:46,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 241 remaining) [2024-01-29 14:17:46,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 241 remaining) [2024-01-29 14:17:46,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 241 remaining) [2024-01-29 14:17:46,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 241 remaining) [2024-01-29 14:17:46,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 241 remaining) [2024-01-29 14:17:46,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 241 remaining) [2024-01-29 14:17:46,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 241 remaining) [2024-01-29 14:17:46,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 241 remaining) [2024-01-29 14:17:46,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 241 remaining) [2024-01-29 14:17:46,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 241 remaining) [2024-01-29 14:17:46,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 241 remaining) [2024-01-29 14:17:46,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 241 remaining) [2024-01-29 14:17:46,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 241 remaining) [2024-01-29 14:17:46,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 241 remaining) [2024-01-29 14:17:46,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 241 remaining) [2024-01-29 14:17:46,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 241 remaining) [2024-01-29 14:17:46,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 241 remaining) [2024-01-29 14:17:46,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 241 remaining) [2024-01-29 14:17:46,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 241 remaining) [2024-01-29 14:17:46,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 241 remaining) [2024-01-29 14:17:46,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 241 remaining) [2024-01-29 14:17:46,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 241 remaining) [2024-01-29 14:17:46,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 241 remaining) [2024-01-29 14:17:46,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 241 remaining) [2024-01-29 14:17:46,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 241 remaining) [2024-01-29 14:17:46,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 241 remaining) [2024-01-29 14:17:46,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 241 remaining) [2024-01-29 14:17:46,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 241 remaining) [2024-01-29 14:17:46,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 241 remaining) [2024-01-29 14:17:46,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 241 remaining) [2024-01-29 14:17:46,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 241 remaining) [2024-01-29 14:17:46,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 241 remaining) [2024-01-29 14:17:46,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 241 remaining) [2024-01-29 14:17:46,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 241 remaining) [2024-01-29 14:17:46,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 241 remaining) [2024-01-29 14:17:46,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 241 remaining) [2024-01-29 14:17:46,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 241 remaining) [2024-01-29 14:17:46,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 241 remaining) [2024-01-29 14:17:46,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 241 remaining) [2024-01-29 14:17:46,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 241 remaining) [2024-01-29 14:17:46,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 241 remaining) [2024-01-29 14:17:46,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 241 remaining) [2024-01-29 14:17:46,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 241 remaining) [2024-01-29 14:17:46,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 241 remaining) [2024-01-29 14:17:46,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 241 remaining) [2024-01-29 14:17:46,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 241 remaining) [2024-01-29 14:17:46,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 241 remaining) [2024-01-29 14:17:46,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 241 remaining) [2024-01-29 14:17:46,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONERROR_FUNCTION (62 of 241 remaining) [2024-01-29 14:17:46,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (61 of 241 remaining) [2024-01-29 14:17:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 241 remaining) [2024-01-29 14:17:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 241 remaining) [2024-01-29 14:17:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 241 remaining) [2024-01-29 14:17:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 241 remaining) [2024-01-29 14:17:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 241 remaining) [2024-01-29 14:17:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 241 remaining) [2024-01-29 14:17:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 241 remaining) [2024-01-29 14:17:46,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 241 remaining) [2024-01-29 14:17:46,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 241 remaining) [2024-01-29 14:17:46,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 241 remaining) [2024-01-29 14:17:46,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 241 remaining) [2024-01-29 14:17:46,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 241 remaining) [2024-01-29 14:17:46,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 241 remaining) [2024-01-29 14:17:46,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 241 remaining) [2024-01-29 14:17:46,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 241 remaining) [2024-01-29 14:17:46,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 241 remaining) [2024-01-29 14:17:46,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 241 remaining) [2024-01-29 14:17:46,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 241 remaining) [2024-01-29 14:17:46,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 241 remaining) [2024-01-29 14:17:46,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 241 remaining) [2024-01-29 14:17:46,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 241 remaining) [2024-01-29 14:17:46,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 241 remaining) [2024-01-29 14:17:46,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 241 remaining) [2024-01-29 14:17:46,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 241 remaining) [2024-01-29 14:17:46,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 241 remaining) [2024-01-29 14:17:46,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 241 remaining) [2024-01-29 14:17:46,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 241 remaining) [2024-01-29 14:17:46,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 241 remaining) [2024-01-29 14:17:46,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 241 remaining) [2024-01-29 14:17:46,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 241 remaining) [2024-01-29 14:17:46,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 241 remaining) [2024-01-29 14:17:46,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 241 remaining) [2024-01-29 14:17:46,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 241 remaining) [2024-01-29 14:17:46,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 241 remaining) [2024-01-29 14:17:46,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 241 remaining) [2024-01-29 14:17:46,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 241 remaining) [2024-01-29 14:17:46,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 241 remaining) [2024-01-29 14:17:46,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 241 remaining) [2024-01-29 14:17:46,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 241 remaining) [2024-01-29 14:17:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 241 remaining) [2024-01-29 14:17:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 241 remaining) [2024-01-29 14:17:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 241 remaining) [2024-01-29 14:17:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 241 remaining) [2024-01-29 14:17:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 241 remaining) [2024-01-29 14:17:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 241 remaining) [2024-01-29 14:17:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 241 remaining) [2024-01-29 14:17:46,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 241 remaining) [2024-01-29 14:17:46,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 241 remaining) [2024-01-29 14:17:46,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 241 remaining) [2024-01-29 14:17:46,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 241 remaining) [2024-01-29 14:17:46,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 241 remaining) [2024-01-29 14:17:46,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 241 remaining) [2024-01-29 14:17:46,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 241 remaining) [2024-01-29 14:17:46,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 241 remaining) [2024-01-29 14:17:46,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 241 remaining) [2024-01-29 14:17:46,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 241 remaining) [2024-01-29 14:17:46,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err15ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 241 remaining) [2024-01-29 14:17:46,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err16ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 241 remaining) [2024-01-29 14:17:46,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 241 remaining) [2024-01-29 14:17:46,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err18ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 241 remaining) [2024-01-29 14:17:46,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err19ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 241 remaining) [2024-01-29 14:17:46,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 14:17:46,563 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:46,583 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:17:46,584 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:17:46,714 INFO L503 ceAbstractionStarter]: Automizer considered 177 witness invariants [2024-01-29 14:17:46,715 INFO L504 ceAbstractionStarter]: WitnessConsidered=177 [2024-01-29 14:17:46,715 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:17:46 BasicIcfg [2024-01-29 14:17:46,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:17:46,716 INFO L158 Benchmark]: Toolchain (without parser) took 5660.48ms. Allocated memory was 165.7MB in the beginning and 549.5MB in the end (delta: 383.8MB). Free memory was 125.2MB in the beginning and 446.1MB in the end (delta: -320.9MB). Peak memory consumption was 266.6MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,716 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:17:46,716 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:17:46,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.94ms. Allocated memory is still 165.7MB. Free memory was 125.2MB in the beginning and 100.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.22ms. Allocated memory is still 165.7MB. Free memory was 100.0MB in the beginning and 95.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,717 INFO L158 Benchmark]: Boogie Preprocessor took 68.10ms. Allocated memory is still 165.7MB. Free memory was 95.8MB in the beginning and 92.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,717 INFO L158 Benchmark]: RCFGBuilder took 1658.94ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 92.6MB in the beginning and 142.9MB in the end (delta: -50.4MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,718 INFO L158 Benchmark]: TraceAbstraction took 3484.94ms. Allocated memory was 245.4MB in the beginning and 549.5MB in the end (delta: 304.1MB). Free memory was 141.9MB in the beginning and 446.1MB in the end (delta: -304.2MB). Peak memory consumption was 202.8MB. Max. memory is 16.1GB. [2024-01-29 14:17:46,719 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.14ms. Allocated memory is still 121.6MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.94ms. Allocated memory is still 165.7MB. Free memory was 125.2MB in the beginning and 100.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.22ms. Allocated memory is still 165.7MB. Free memory was 100.0MB in the beginning and 95.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.10ms. Allocated memory is still 165.7MB. Free memory was 95.8MB in the beginning and 92.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1658.94ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 92.6MB in the beginning and 142.9MB in the end (delta: -50.4MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3484.94ms. Allocated memory was 245.4MB in the beginning and 549.5MB in the end (delta: 304.1MB). Free memory was 141.9MB in the beginning and 446.1MB in the end (delta: -304.2MB). Peak memory consumption was 202.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 107]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int cardSet_0, cardRarity_1, cardId_2, cardType_3, cardSet_4, cardRarity_5, cardId_6, cardType_7, cardSet_8, cardRarity_9, cardId_10, cardType_11, result_12, result_13, result_14; [L76] 0 pthread_t t1, t2, t3; VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_0],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=0, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] [L78] 0 cardSet_0 = __VERIFIER_nondet_int() [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_1],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] [L79] 0 cardRarity_1 = __VERIFIER_nondet_int() [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_2],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] [L80] 0 cardId_2 = __VERIFIER_nondet_int() [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_3],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] [L81] 0 cardType_3 = __VERIFIER_nondet_int() [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_4],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] [L82] 0 cardSet_4 = __VERIFIER_nondet_int() [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_5],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L83] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] [L83] 0 cardRarity_5 = __VERIFIER_nondet_int() [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_6],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L84] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] [L84] 0 cardId_6 = __VERIFIER_nondet_int() [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_7],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] [L85] 0 cardType_7 = __VERIFIER_nondet_int() [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardSet_8],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] [L86] 0 cardSet_8 = __VERIFIER_nondet_int() [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardRarity_9],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] [L87] 0 cardRarity_9 = __VERIFIER_nondet_int() [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardId_10],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] [L88] 0 cardId_10 = __VERIFIER_nondet_int() [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cardType_11],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] [L89] 0 cardType_11 = __VERIFIER_nondet_int() [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_13],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_12],IntegerLiteral[0]]]] VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L92] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_14],IntegerLiteral[0]]]] [L92] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0, t1={5:0}, t2={6:0}, t3={3:0}] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0] [L44] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L44] CALL 1 minus(cardSet_0, cardSet_4) [L107] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]]]] VAL [\old(a)=-2, \old(b)=0, a=-2, b=0, cardId_10=0, cardId_2=0, cardId_6=0, cardRarity_1=0, cardRarity_5=0, cardRarity_9=0, cardSet_0=-2, cardSet_4=0, cardSet_8=0, cardType_11=0, cardType_3=0, cardType_7=0, result_12=0, result_13=0, result_14=0] - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: 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: 92]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 403 locations, 241 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 632 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 339 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 241 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 949 IncrementalHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 241 mSolverCounterUnsat, 107 mSDtfsCounter, 949 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 14:17:46,765 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