./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-two-queue.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-two-queue.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 22:59:27,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:59:27,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:59:27,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:59:27,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:59:27,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:59:27,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:59:27,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:59:27,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:59:27,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:59:27,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:59:27,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:59:27,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:59:27,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:59:27,354 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:59:27,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:59:27,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:59:27,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:59:27,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:59:27,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:59:27,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:59:27,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:59:27,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:59:27,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:59:27,357 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:59:27,357 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:59:27,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:59:27,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:59:27,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:59:27,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:59:27,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:59:27,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:59:27,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:59:27,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:59:27,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:59:27,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:59:27,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:59:27,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:59:27,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:59:27,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:59:27,362 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:59:27,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:59:27,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:59:27,363 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 22:59:27,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:59:27,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:59:27,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:59:27,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:59:27,663 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:59:27,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-01-29 22:59:28,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:59:29,116 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:59:29,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-01-29 22:59:29,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bbd28131/737b0db52c5f475293dfacdb0c7d5927/FLAG9c3ce1501 [2024-01-29 22:59:29,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bbd28131/737b0db52c5f475293dfacdb0c7d5927 [2024-01-29 22:59:29,148 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:59:29,149 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:59:29,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-two-queue.wvr.yml/witness.yml [2024-01-29 22:59:29,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:59:29,310 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:59:29,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:59:29,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:59:29,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:59:29,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:59:29" (1/2) ... [2024-01-29 22:59:29,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b32c123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:59:29, skipping insertion in model container [2024-01-29 22:59:29,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:59:29" (1/2) ... [2024-01-29 22:59:29,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4e434dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:59:29, skipping insertion in model container [2024-01-29 22:59:29,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:59:29" (2/2) ... [2024-01-29 22:59:29,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b32c123 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:29, skipping insertion in model container [2024-01-29 22:59:29,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:59:29" (2/2) ... [2024-01-29 22:59:29,322 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:59:29,375 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:59:29,377 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (q1 == 0) && (j == 0) [2024-01-29 22:59:29,377 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((q1 == 0) && (j == 0)) && (n2 == 0) [2024-01-29 22:59:29,377 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q1 == 0 [2024-01-29 22:59:29,378 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (q1 == 0) && (q2 == 0) [2024-01-29 22:59:29,378 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (q1 == 0) && (q1_front == 0) [2024-01-29 22:59:29,379 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (q1 == 0) && (i == 0) [2024-01-29 22:59:29,379 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (q1 == 0) && (q1_back == 0) [2024-01-29 22:59:29,379 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((q1 == 0) && (j == 0)) && (n1 == 0) [2024-01-29 22:59:29,379 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (q1 == 0) && (q2_front == 0) [2024-01-29 22:59:29,379 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (q1 == 0) && (q2_back == 0) [2024-01-29 22:59:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (q2 == 0) && (i == 0) [2024-01-29 22:59:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] q2 == 0 [2024-01-29 22:59:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((q2 == 0) && (i == 0)) && (j == 0) [2024-01-29 22:59:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] (i == 0) && (j == 0) [2024-01-29 22:59:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] i == 0 [2024-01-29 22:59:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (-2147483647 <= q1_front) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:29,382 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] -2147483647 <= q1_front [2024-01-29 22:59:29,382 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (0 <= q1_back) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:29,382 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] 0 <= q1_back [2024-01-29 22:59:29,382 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (q1 == 0) && (q2 == 0) [2024-01-29 22:59:29,382 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q1 == 0 [2024-01-29 22:59:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((q1 == 0) && (q2 == 0)) && (j == 0) [2024-01-29 22:59:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((q1 == 0) && (q2 == 0)) && (q2_front == 0) [2024-01-29 22:59:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((q1 == 0) && (q2 == 0)) && (q1_front == 0) [2024-01-29 22:59:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((q1 == 0) && (q2 == 0)) && (q2_back == 0) [2024-01-29 22:59:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((q1 == 0) && (q2 == 0)) && (n2 == 0) [2024-01-29 22:59:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((q1 == 0) && (q2 == 0)) && (q1_back == 0) [2024-01-29 22:59:29,384 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] ((q1 == 0) && (q2 == 0)) && (i == 0) [2024-01-29 22:59:29,384 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (q1 == 0) && (q2 == 0) [2024-01-29 22:59:29,384 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((q1 == 0) && (q2 == 0)) && (q1_back == 0) [2024-01-29 22:59:29,384 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((q1 == 0) && (q2 == 0)) && (q2_back == 0) [2024-01-29 22:59:29,384 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((q1 == 0) && (q2 == 0)) && (i == 0) [2024-01-29 22:59:29,385 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q1 == 0 [2024-01-29 22:59:29,386 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((q1 == 0) && (q2 == 0)) && (j == 0) [2024-01-29 22:59:29,386 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((q1 == 0) && (q2 == 0)) && (q2_front == 0) [2024-01-29 22:59:29,386 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] (q2 == 0) && (i == 0) [2024-01-29 22:59:29,386 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] q2 == 0 [2024-01-29 22:59:29,387 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] ((q2 == 0) && (i == 0)) && (j == 0) [2024-01-29 22:59:29,387 INFO L98 nessWitnessExtractor]: Loop invariant at [L47-L59] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,387 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] ((q2 == 0) && (i == 0)) && (j == 0) [2024-01-29 22:59:29,387 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] (q2 == 0) && (i == 0) [2024-01-29 22:59:29,387 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] q2 == 0 [2024-01-29 22:59:29,388 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,388 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] (q2 == 0) && (j == 0) [2024-01-29 22:59:29,388 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] ((q2 == 0) && (j == 0)) && (((((0LL - (long long )i) + (long long )size >= 0LL && size != 0) && ((((((((7 <= size && (-14LL + (long long )i) + (long long )size >= 0LL) && i == 7) || ((6 <= size && (-12LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((5 <= size && (-10LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((4 <= size && (-8LL + (long long )i) + (long long )size >= 0LL) && i == 4)) || ((3 <= size && (-6LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((2 <= size && (-4LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((1 <= size && (-2LL + (long long )i) + (long long )size >= 0LL) && i == 1))) || (0 == i && i == 0)) || (((((8 <= size && 8 <= i) && (-16LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && size != 0) && i != 1)) [2024-01-29 22:59:29,388 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] q2 == 0 [2024-01-29 22:59:29,388 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] (q2 == 0) && (i == 0) [2024-01-29 22:59:29,389 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,389 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] (q2 == 0) && (i == 0) [2024-01-29 22:59:29,389 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] q2 == 0 [2024-01-29 22:59:29,390 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] ((q2 == 0) && (i == 0)) && (j == 0) [2024-01-29 22:59:29,390 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,391 INFO L98 nessWitnessExtractor]: Loop invariant at [L65-L77] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,391 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,391 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (q1 == 0) && (q2 == 0) [2024-01-29 22:59:29,391 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((q1 == 0) && (q2 == 0)) && (q2_back == 0) [2024-01-29 22:59:29,391 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((q1 == 0) && (q2 == 0)) && (q2_front == 0) [2024-01-29 22:59:29,391 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q1 == 0 [2024-01-29 22:59:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((q1 == 0) && (q2 == 0)) && (i == 0) [2024-01-29 22:59:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((q1 == 0) && (q2 == 0)) && (j == 0) [2024-01-29 22:59:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (((q1 == 0) && (q2_front == 0)) && (i == 0)) && (N == 0) [2024-01-29 22:59:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((q1 == 0) && (q2_front == 0)) && (i == 0) [2024-01-29 22:59:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (((q1 == 0) && (q2_front == 0)) && (i == 0)) && (n2 == 0) [2024-01-29 22:59:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (q1 == 0) && (q2_front == 0) [2024-01-29 22:59:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (((q1 == 0) && (q2_front == 0)) && (i == 0)) && (n1 == 0) [2024-01-29 22:59:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q1 == 0 [2024-01-29 22:59:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((q1 == 0) && (q2_front == 0)) && (q2_back == 0) [2024-01-29 22:59:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (q1 == 0) && (q2 == 0) [2024-01-29 22:59:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (((q1 == 0) && (q2_front == 0)) && (i == 0)) && (j == 0) [2024-01-29 22:59:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (q1 == 0) && (q1_front == 0) [2024-01-29 22:59:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (q1 == 0) && (q1_back == 0) [2024-01-29 22:59:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (q1 == 0) && (i == 0) [2024-01-29 22:59:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] q1 == 0 [2024-01-29 22:59:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ((q1 == 0) && (i == 0)) && (j == 0) [2024-01-29 22:59:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (q1 == 0) && (q2 == 0) [2024-01-29 22:59:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (((-1LL - (long long )i) + (long long )size >= 0LL) && (q2 == 0)) && (i == 0) [2024-01-29 22:59:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ((((-1LL - (long long )i) + (long long )size >= 0LL) && (q2 == 0)) && (i == 0)) && ((((((((((8 <= size && (-15LL + (long long )i) + (long long )size >= 0LL) && i == 7) || ((7 <= size && (-13LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((6 <= size && (-11LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((5 <= size && (-9LL + (long long )i) + (long long )size >= 0LL) && i == 4)) || ((4 <= size && (-7LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((3 <= size && (-5LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((2 <= size && (-3LL + (long long )i) + (long long )size >= 0LL) && i == 1)) || (((1 <= size && (-1LL + (long long )i) + (long long )size >= 0LL) && 0 == i) && i == 0)) || (((((8 <= i && 9 <= size) && i <= 2147483646) && (-17LL + (long long )i) + (long long )size >= 0LL) && i != 0) && i != 1)) [2024-01-29 22:59:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ((-1LL - (long long )i) + (long long )size >= 0LL) && (q2 == 0) [2024-01-29 22:59:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ((((-1LL - (long long )i) + (long long )size >= 0LL) && (q2 == 0)) && (i == 0)) && (j == 0) [2024-01-29 22:59:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ((((-1LL - (long long )i) + (long long )size >= 0LL) && (q2 == 0)) && (i == 0)) && (size != 0) [2024-01-29 22:59:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-29 22:59:29,396 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,396 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((q1 == 0) && (q2 == 0)) && (q2_back == 0) [2024-01-29 22:59:29,396 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (((q1 == 0) && (q2 == 0)) && (q2_back == 0)) && (j == 0) [2024-01-29 22:59:29,396 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (q1 == 0) && (q2 == 0) [2024-01-29 22:59:29,396 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] q1 == 0 [2024-01-29 22:59:29,396 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (((q1 == 0) && (q2 == 0)) && (q2_back == 0)) && (i == 0) [2024-01-29 22:59:29,396 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] (q2 == 0) && (j == 0) [2024-01-29 22:59:29,397 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] q2 == 0 [2024-01-29 22:59:29,397 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] (q2 == 0) && (i == 0) [2024-01-29 22:59:29,397 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,397 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (((q1 == 0) && (q2 == 0)) && (q1_back == 0)) && (q2_back == 0) [2024-01-29 22:59:29,397 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((q1 == 0) && (q2 == 0)) && (q1_back == 0) [2024-01-29 22:59:29,397 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (q1 == 0) && (q2 == 0) [2024-01-29 22:59:29,398 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((q1 == 0) && (q2 == 0)) && (q1_front == 0) [2024-01-29 22:59:29,398 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q1 == 0 [2024-01-29 22:59:29,398 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((q1 == 0) && (q2 == 0)) && (q1_back == 0)) && (q2_back == 0)) && (j == 0) [2024-01-29 22:59:29,398 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((q1 == 0) && (q2 == 0)) && (q1_back == 0)) && (q2_back == 0)) && (i == 0) [2024-01-29 22:59:29,398 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (((q1 == 0) && (q2 == 0)) && (q1_back == 0)) && (q2_front == 0) [2024-01-29 22:59:29,399 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] -2147483647 <= q2_front [2024-01-29 22:59:29,399 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (-2147483647 <= q2_front) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:29,399 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] (0 <= q2_back) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:29,402 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] 0 <= q2_back [2024-01-29 22:59:29,402 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (-2147483647 <= q1_back) && (q1_front <= 2147483646) [2024-01-29 22:59:29,402 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] -2147483647 <= q1_back [2024-01-29 22:59:29,403 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] ((-2147483647 <= q1_back) && (q1_front <= 2147483646)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:29,403 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (-2147483647 <= q2_back) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:29,403 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] -2147483647 <= q2_back [2024-01-29 22:59:29,403 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (-2147483647 <= q1_back) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:29,403 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] -2147483647 <= q1_back [2024-01-29 22:59:29,403 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,404 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,404 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] ((-2147483647 <= q2_back) && (q2_front <= 2147483646)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:29,404 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (-2147483647 <= q2_back) && (q2_front <= 2147483646) [2024-01-29 22:59:29,404 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] -2147483647 <= q2_back [2024-01-29 22:59:29,404 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] ((0 <= i) && ((long long )i - (long long )size >= 0LL)) && (q2 == 0) [2024-01-29 22:59:29,404 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] (0 <= i) && ((long long )i - (long long )size >= 0LL) [2024-01-29 22:59:29,405 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] (((0 <= i) && ((long long )i - (long long )size >= 0LL)) && (q2 == 0)) && (i == 0) [2024-01-29 22:59:29,405 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] (((0 <= i) && ((long long )i - (long long )size >= 0LL)) && (q2 == 0)) && (j == 0) [2024-01-29 22:59:29,405 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] 0 <= i [2024-01-29 22:59:29,405 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-29 22:59:29,425 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:59:29,599 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[3013,3026] [2024-01-29 22:59:29,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:59:29,615 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:59:29,634 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:59:29,742 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[3013,3026] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:59:29,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:59:29,807 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:59:29,808 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:29 WrapperNode [2024-01-29 22:59:29,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:59:29,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:59:29,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:59:29,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:59:29,822 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 10:59:29" (1/1) ... [2024-01-29 22:59:29,844 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 10:59:29" (1/1) ... [2024-01-29 22:59:29,893 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 369 [2024-01-29 22:59:29,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:59:29,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:59:29,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:59:29,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:59:29,907 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 10:59:29" (1/1) ... [2024-01-29 22:59:29,908 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 10:59:29" (1/1) ... [2024-01-29 22:59:29,924 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 10:59:29" (1/1) ... [2024-01-29 22:59:29,954 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 2, 2, 6]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 2]. [2024-01-29 22:59:29,954 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 10:59:29" (1/1) ... [2024-01-29 22:59:29,954 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 10:59:29" (1/1) ... [2024-01-29 22:59:29,967 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 10:59:29" (1/1) ... [2024-01-29 22:59:29,985 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 10:59:29" (1/1) ... [2024-01-29 22:59:29,999 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 10:59:29" (1/1) ... [2024-01-29 22:59:30,001 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 10:59:29" (1/1) ... [2024-01-29 22:59:30,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:59:30,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:59:30,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:59:30,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:59:30,014 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 10:59:29" (1/1) ... [2024-01-29 22:59:30,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:59:30,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:59:30,045 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 22:59:30,074 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 22:59:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:59:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:59:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:59:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:59:30,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:59:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:59:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:59:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:59:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:59:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:59:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:59:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:59:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:59:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:59:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 22:59:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 22:59:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-29 22:59:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:59:30,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:59:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:59:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:59:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:59:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:59:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:59:30,105 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 22:59:30,238 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:59:30,240 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:59:31,134 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:59:31,134 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:59:31,380 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:59:31,380 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-29 22:59:31,381 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:59:31 BoogieIcfgContainer [2024-01-29 22:59:31,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:59:31,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:59:31,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:59:31,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:59:31,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:59:29" (1/4) ... [2024-01-29 22:59:31,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d2b5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:59:31, skipping insertion in model container [2024-01-29 22:59:31,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:59:29" (2/4) ... [2024-01-29 22:59:31,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d2b5fd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:59:31, skipping insertion in model container [2024-01-29 22:59:31,387 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 10:59:29" (3/4) ... [2024-01-29 22:59:31,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d2b5fd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:59:31, skipping insertion in model container [2024-01-29 22:59:31,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:59:31" (4/4) ... [2024-01-29 22:59:31,389 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-01-29 22:59:31,406 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:59:31,406 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 160 error locations. [2024-01-29 22:59:31,407 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:59:31,524 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 22:59:31,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 319 transitions, 652 flow [2024-01-29 22:59:31,634 INFO L124 PetriNetUnfolderBase]: 4/317 cut-off events. [2024-01-29 22:59:31,634 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:59:31,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 317 events. 4/317 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 562 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 281. Up to 2 conditions per place. [2024-01-29 22:59:31,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 319 transitions, 652 flow [2024-01-29 22:59:31,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 316 transitions, 644 flow [2024-01-29 22:59:31,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:59:31,665 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;@2e43ee82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:59:31,667 INFO L358 AbstractCegarLoop]: Starting to check reachability of 200 error locations. [2024-01-29 22:59:31,669 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:59:31,669 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:59:31,669 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:59:31,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:31,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:59:31,670 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:31,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:31,678 INFO L85 PathProgramCache]: Analyzing trace with hash 38836, now seen corresponding path program 1 times [2024-01-29 22:59:31,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:31,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511566091] [2024-01-29 22:59:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:31,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:31,989 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 22:59:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511566091] [2024-01-29 22:59:31,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511566091] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:31,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:31,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:31,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99528393] [2024-01-29 22:59:31,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:32,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:32,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:32,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:32,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 319 [2024-01-29 22:59:32,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 644 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 22:59:32,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:32,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 319 [2024-01-29 22:59:32,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:32,618 INFO L124 PetriNetUnfolderBase]: 448/1185 cut-off events. [2024-01-29 22:59:32,618 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-01-29 22:59:32,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1933 conditions, 1185 events. 448/1185 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6611 event pairs, 294 based on Foata normal form. 5/724 useless extension candidates. Maximal degree in co-relation 1524. Up to 700 conditions per place. [2024-01-29 22:59:32,628 INFO L140 encePairwiseOnDemand]: 292/319 looper letters, 58 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-01-29 22:59:32,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 291 transitions, 714 flow [2024-01-29 22:59:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2024-01-29 22:59:32,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.819226750261233 [2024-01-29 22:59:32,670 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 644 flow. Second operand 3 states and 784 transitions. [2024-01-29 22:59:32,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 291 transitions, 714 flow [2024-01-29 22:59:32,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 291 transitions, 706 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:59:32,680 INFO L231 Difference]: Finished difference. Result has 292 places, 291 transitions, 590 flow [2024-01-29 22:59:32,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=292, PETRI_TRANSITIONS=291} [2024-01-29 22:59:32,686 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -27 predicate places. [2024-01-29 22:59:32,687 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 291 transitions, 590 flow [2024-01-29 22:59:32,687 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 22:59:32,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:32,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:59:32,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:59:32,688 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:32,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1204979, now seen corresponding path program 1 times [2024-01-29 22:59:32,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:32,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021289839] [2024-01-29 22:59:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:32,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:32,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:32,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021289839] [2024-01-29 22:59:32,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021289839] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:32,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:32,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:32,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332045803] [2024-01-29 22:59:32,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:32,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:32,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:32,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:32,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:32,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 319 [2024-01-29 22:59:32,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 291 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 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 22:59:32,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:32,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 319 [2024-01-29 22:59:32,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:33,153 INFO L124 PetriNetUnfolderBase]: 448/1183 cut-off events. [2024-01-29 22:59:33,154 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:33,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1906 conditions, 1183 events. 448/1183 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6622 event pairs, 294 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 1809. Up to 701 conditions per place. [2024-01-29 22:59:33,161 INFO L140 encePairwiseOnDemand]: 315/319 looper letters, 54 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-01-29 22:59:33,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 289 transitions, 698 flow [2024-01-29 22:59:33,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2024-01-29 22:59:33,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8035527690700105 [2024-01-29 22:59:33,168 INFO L175 Difference]: Start difference. First operand has 292 places, 291 transitions, 590 flow. Second operand 3 states and 769 transitions. [2024-01-29 22:59:33,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 289 transitions, 698 flow [2024-01-29 22:59:33,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:33,174 INFO L231 Difference]: Finished difference. Result has 290 places, 289 transitions, 586 flow [2024-01-29 22:59:33,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=290, PETRI_TRANSITIONS=289} [2024-01-29 22:59:33,177 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -29 predicate places. [2024-01-29 22:59:33,177 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 289 transitions, 586 flow [2024-01-29 22:59:33,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 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 22:59:33,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:33,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:59:33,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:59:33,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:33,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:33,189 INFO L85 PathProgramCache]: Analyzing trace with hash 37355424, now seen corresponding path program 1 times [2024-01-29 22:59:33,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:33,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69239580] [2024-01-29 22:59:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:33,306 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 22:59:33,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:33,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69239580] [2024-01-29 22:59:33,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69239580] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:33,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:33,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:33,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094273194] [2024-01-29 22:59:33,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:33,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:33,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:33,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:33,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:33,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 319 [2024-01-29 22:59:33,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 289 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:33,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:33,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 319 [2024-01-29 22:59:33,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:33,816 INFO L124 PetriNetUnfolderBase]: 448/1176 cut-off events. [2024-01-29 22:59:33,817 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:33,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 1176 events. 448/1176 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6628 event pairs, 294 based on Foata normal form. 5/718 useless extension candidates. Maximal degree in co-relation 1827. Up to 704 conditions per place. [2024-01-29 22:59:33,824 INFO L140 encePairwiseOnDemand]: 310/319 looper letters, 56 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-01-29 22:59:33,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 282 transitions, 688 flow [2024-01-29 22:59:33,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2024-01-29 22:59:33,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7889237199582028 [2024-01-29 22:59:33,827 INFO L175 Difference]: Start difference. First operand has 290 places, 289 transitions, 586 flow. Second operand 3 states and 755 transitions. [2024-01-29 22:59:33,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 282 transitions, 688 flow [2024-01-29 22:59:33,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 282 transitions, 684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:33,832 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 572 flow [2024-01-29 22:59:33,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2024-01-29 22:59:33,833 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -36 predicate places. [2024-01-29 22:59:33,833 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 572 flow [2024-01-29 22:59:33,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:33,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:33,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:59:33,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:59:33,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:33,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:33,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1158019324, now seen corresponding path program 1 times [2024-01-29 22:59:33,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:33,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572981659] [2024-01-29 22:59:33,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:33,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:33,890 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 22:59:33,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:33,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572981659] [2024-01-29 22:59:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572981659] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:33,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:33,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:33,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299542339] [2024-01-29 22:59:33,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:33,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:33,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:34,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 319 [2024-01-29 22:59:34,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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 22:59:34,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:34,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 319 [2024-01-29 22:59:34,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:34,407 INFO L124 PetriNetUnfolderBase]: 448/1161 cut-off events. [2024-01-29 22:59:34,408 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:59:34,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 1161 events. 448/1161 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6600 event pairs, 294 based on Foata normal form. 8/743 useless extension candidates. Maximal degree in co-relation 1794. Up to 694 conditions per place. [2024-01-29 22:59:34,415 INFO L140 encePairwiseOnDemand]: 302/319 looper letters, 81 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2024-01-29 22:59:34,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 267 transitions, 708 flow [2024-01-29 22:59:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2024-01-29 22:59:34,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7168234064785789 [2024-01-29 22:59:34,418 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 572 flow. Second operand 3 states and 686 transitions. [2024-01-29 22:59:34,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 267 transitions, 708 flow [2024-01-29 22:59:34,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 267 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:34,423 INFO L231 Difference]: Finished difference. Result has 268 places, 267 transitions, 542 flow [2024-01-29 22:59:34,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=268, PETRI_TRANSITIONS=267} [2024-01-29 22:59:34,425 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -51 predicate places. [2024-01-29 22:59:34,425 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 267 transitions, 542 flow [2024-01-29 22:59:34,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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 22:59:34,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:34,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 22:59:34,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:59:34,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:34,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1538861994, now seen corresponding path program 1 times [2024-01-29 22:59:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:34,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579612959] [2024-01-29 22:59:34,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:34,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:34,500 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 22:59:34,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:34,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579612959] [2024-01-29 22:59:34,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579612959] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:34,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:34,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:34,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753537806] [2024-01-29 22:59:34,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:34,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:34,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:34,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:34,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:34,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 319 [2024-01-29 22:59:34,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 267 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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 22:59:34,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:34,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 319 [2024-01-29 22:59:34,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:34,841 INFO L124 PetriNetUnfolderBase]: 448/1159 cut-off events. [2024-01-29 22:59:34,842 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:34,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 1159 events. 448/1159 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6588 event pairs, 294 based on Foata normal form. 1/707 useless extension candidates. Maximal degree in co-relation 1709. Up to 696 conditions per place. [2024-01-29 22:59:34,847 INFO L140 encePairwiseOnDemand]: 315/319 looper letters, 48 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-01-29 22:59:34,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 265 transitions, 638 flow [2024-01-29 22:59:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 766 transitions. [2024-01-29 22:59:34,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.800417972831766 [2024-01-29 22:59:34,850 INFO L175 Difference]: Start difference. First operand has 268 places, 267 transitions, 542 flow. Second operand 3 states and 766 transitions. [2024-01-29 22:59:34,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 265 transitions, 638 flow [2024-01-29 22:59:34,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 265 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:34,855 INFO L231 Difference]: Finished difference. Result has 266 places, 265 transitions, 538 flow [2024-01-29 22:59:34,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=266, PETRI_TRANSITIONS=265} [2024-01-29 22:59:34,856 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -53 predicate places. [2024-01-29 22:59:34,856 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 265 transitions, 538 flow [2024-01-29 22:59:34,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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 22:59:34,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:34,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:34,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:59:34,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:34,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1377666349, now seen corresponding path program 1 times [2024-01-29 22:59:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:34,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002422696] [2024-01-29 22:59:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:34,904 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 22:59:34,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:34,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002422696] [2024-01-29 22:59:34,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002422696] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:34,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:34,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803270390] [2024-01-29 22:59:34,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:34,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:34,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:34,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:34,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:35,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 319 [2024-01-29 22:59:35,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 265 transitions, 538 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 22:59:35,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:35,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 319 [2024-01-29 22:59:35,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:35,358 INFO L124 PetriNetUnfolderBase]: 448/1158 cut-off events. [2024-01-29 22:59:35,358 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:35,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 1158 events. 448/1158 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6582 event pairs, 294 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1788. Up to 704 conditions per place. [2024-01-29 22:59:35,365 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 52 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-01-29 22:59:35,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 264 transitions, 644 flow [2024-01-29 22:59:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2024-01-29 22:59:35,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2024-01-29 22:59:35,368 INFO L175 Difference]: Start difference. First operand has 266 places, 265 transitions, 538 flow. Second operand 3 states and 754 transitions. [2024-01-29 22:59:35,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 264 transitions, 644 flow [2024-01-29 22:59:35,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 264 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:35,372 INFO L231 Difference]: Finished difference. Result has 265 places, 264 transitions, 536 flow [2024-01-29 22:59:35,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=265, PETRI_TRANSITIONS=264} [2024-01-29 22:59:35,376 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -54 predicate places. [2024-01-29 22:59:35,376 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 264 transitions, 536 flow [2024-01-29 22:59:35,376 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 22:59:35,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:35,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:35,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:59:35,377 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:35,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:35,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1087467410, now seen corresponding path program 1 times [2024-01-29 22:59:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291684556] [2024-01-29 22:59:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:35,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:35,451 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 22:59:35,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:35,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291684556] [2024-01-29 22:59:35,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291684556] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:35,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:35,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:35,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89491594] [2024-01-29 22:59:35,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:35,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:35,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:35,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:35,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:35,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 319 [2024-01-29 22:59:35,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 264 transitions, 536 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 22:59:35,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:35,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 319 [2024-01-29 22:59:35,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:35,856 INFO L124 PetriNetUnfolderBase]: 448/1157 cut-off events. [2024-01-29 22:59:35,857 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:35,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 1157 events. 448/1157 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6606 event pairs, 294 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1844. Up to 703 conditions per place. [2024-01-29 22:59:35,864 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 52 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2024-01-29 22:59:35,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 642 flow [2024-01-29 22:59:35,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2024-01-29 22:59:35,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2024-01-29 22:59:35,866 INFO L175 Difference]: Start difference. First operand has 265 places, 264 transitions, 536 flow. Second operand 3 states and 754 transitions. [2024-01-29 22:59:35,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 642 flow [2024-01-29 22:59:35,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 263 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:35,871 INFO L231 Difference]: Finished difference. Result has 264 places, 263 transitions, 534 flow [2024-01-29 22:59:35,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=264, PETRI_TRANSITIONS=263} [2024-01-29 22:59:35,872 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -55 predicate places. [2024-01-29 22:59:35,872 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 263 transitions, 534 flow [2024-01-29 22:59:35,873 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 22:59:35,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:35,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:35,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:59:35,873 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:35,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:35,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1379162192, now seen corresponding path program 1 times [2024-01-29 22:59:35,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:35,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584591546] [2024-01-29 22:59:35,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:35,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:35,917 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 22:59:35,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:35,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584591546] [2024-01-29 22:59:35,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584591546] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:35,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:35,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:35,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167316638] [2024-01-29 22:59:35,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:35,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:35,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:35,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:35,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:36,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 319 [2024-01-29 22:59:36,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 263 transitions, 534 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 22:59:36,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:36,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 319 [2024-01-29 22:59:36,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:36,312 INFO L124 PetriNetUnfolderBase]: 440/1124 cut-off events. [2024-01-29 22:59:36,313 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:36,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 1124 events. 440/1124 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6286 event pairs, 327 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 1811. Up to 720 conditions per place. [2024-01-29 22:59:36,318 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 52 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2024-01-29 22:59:36,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 262 transitions, 640 flow [2024-01-29 22:59:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2024-01-29 22:59:36,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2024-01-29 22:59:36,321 INFO L175 Difference]: Start difference. First operand has 264 places, 263 transitions, 534 flow. Second operand 3 states and 754 transitions. [2024-01-29 22:59:36,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 262 transitions, 640 flow [2024-01-29 22:59:36,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 262 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:36,325 INFO L231 Difference]: Finished difference. Result has 263 places, 262 transitions, 532 flow [2024-01-29 22:59:36,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=263, PETRI_TRANSITIONS=262} [2024-01-29 22:59:36,326 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -56 predicate places. [2024-01-29 22:59:36,326 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 262 transitions, 532 flow [2024-01-29 22:59:36,327 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 22:59:36,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:36,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:36,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:59:36,328 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:36,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:36,328 INFO L85 PathProgramCache]: Analyzing trace with hash 964873653, now seen corresponding path program 1 times [2024-01-29 22:59:36,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:36,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252984951] [2024-01-29 22:59:36,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:36,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:36,369 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 22:59:36,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:36,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252984951] [2024-01-29 22:59:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252984951] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:36,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:36,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:36,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380614657] [2024-01-29 22:59:36,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:36,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:36,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:36,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:36,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:36,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 319 [2024-01-29 22:59:36,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 262 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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 22:59:36,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:36,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 319 [2024-01-29 22:59:36,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:36,761 INFO L124 PetriNetUnfolderBase]: 448/1155 cut-off events. [2024-01-29 22:59:36,762 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:36,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 1155 events. 448/1155 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6620 event pairs, 294 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 1853. Up to 700 conditions per place. [2024-01-29 22:59:36,768 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 48 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2024-01-29 22:59:36,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 261 transitions, 630 flow [2024-01-29 22:59:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2024-01-29 22:59:36,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8056426332288401 [2024-01-29 22:59:36,771 INFO L175 Difference]: Start difference. First operand has 263 places, 262 transitions, 532 flow. Second operand 3 states and 771 transitions. [2024-01-29 22:59:36,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 261 transitions, 630 flow [2024-01-29 22:59:36,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 261 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:36,775 INFO L231 Difference]: Finished difference. Result has 262 places, 261 transitions, 530 flow [2024-01-29 22:59:36,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=262, PETRI_TRANSITIONS=261} [2024-01-29 22:59:36,778 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -57 predicate places. [2024-01-29 22:59:36,778 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 261 transitions, 530 flow [2024-01-29 22:59:36,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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 22:59:36,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:36,779 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] [2024-01-29 22:59:36,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:59:36,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:36,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash -101563578, now seen corresponding path program 1 times [2024-01-29 22:59:36,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:36,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177654164] [2024-01-29 22:59:36,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:36,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:36,850 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 22:59:36,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:36,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177654164] [2024-01-29 22:59:36,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177654164] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:36,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:36,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:36,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468853750] [2024-01-29 22:59:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:36,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:36,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:36,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:37,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 319 [2024-01-29 22:59:37,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 261 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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 22:59:37,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:37,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 319 [2024-01-29 22:59:37,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:37,251 INFO L124 PetriNetUnfolderBase]: 448/1154 cut-off events. [2024-01-29 22:59:37,251 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:59:37,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 1154 events. 448/1154 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6587 event pairs, 294 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 1840. Up to 699 conditions per place. [2024-01-29 22:59:37,258 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 48 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2024-01-29 22:59:37,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 260 transitions, 628 flow [2024-01-29 22:59:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2024-01-29 22:59:37,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8056426332288401 [2024-01-29 22:59:37,263 INFO L175 Difference]: Start difference. First operand has 262 places, 261 transitions, 530 flow. Second operand 3 states and 771 transitions. [2024-01-29 22:59:37,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 260 transitions, 628 flow [2024-01-29 22:59:37,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 260 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:37,270 INFO L231 Difference]: Finished difference. Result has 261 places, 260 transitions, 528 flow [2024-01-29 22:59:37,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=261, PETRI_TRANSITIONS=260} [2024-01-29 22:59:37,272 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -58 predicate places. [2024-01-29 22:59:37,273 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 260 transitions, 528 flow [2024-01-29 22:59:37,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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 22:59:37,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:37,274 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] [2024-01-29 22:59:37,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:59:37,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:37,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1181686017, now seen corresponding path program 1 times [2024-01-29 22:59:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:37,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316454585] [2024-01-29 22:59:37,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:37,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:37,324 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 22:59:37,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316454585] [2024-01-29 22:59:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316454585] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:37,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:37,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:37,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573708214] [2024-01-29 22:59:37,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:37,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:37,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:37,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:37,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:37,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 319 [2024-01-29 22:59:37,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 260 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 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 22:59:37,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:37,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 319 [2024-01-29 22:59:37,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:37,867 INFO L124 PetriNetUnfolderBase]: 448/1146 cut-off events. [2024-01-29 22:59:37,868 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:37,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 1146 events. 448/1146 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6659 event pairs, 294 based on Foata normal form. 2/714 useless extension candidates. Maximal degree in co-relation 1832. Up to 700 conditions per place. [2024-01-29 22:59:37,878 INFO L140 encePairwiseOnDemand]: 309/319 looper letters, 64 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-01-29 22:59:37,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 252 transitions, 644 flow [2024-01-29 22:59:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:37,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2024-01-29 22:59:37,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7168234064785789 [2024-01-29 22:59:37,881 INFO L175 Difference]: Start difference. First operand has 261 places, 260 transitions, 528 flow. Second operand 3 states and 686 transitions. [2024-01-29 22:59:37,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 252 transitions, 644 flow [2024-01-29 22:59:37,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 252 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:37,886 INFO L231 Difference]: Finished difference. Result has 253 places, 252 transitions, 512 flow [2024-01-29 22:59:37,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=253, PETRI_TRANSITIONS=252} [2024-01-29 22:59:37,886 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -66 predicate places. [2024-01-29 22:59:37,887 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 252 transitions, 512 flow [2024-01-29 22:59:37,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 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 22:59:37,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:37,888 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] [2024-01-29 22:59:37,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:59:37,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:37,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2022437951, now seen corresponding path program 1 times [2024-01-29 22:59:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:37,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450684709] [2024-01-29 22:59:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:37,957 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 22:59:37,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:37,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450684709] [2024-01-29 22:59:37,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450684709] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:37,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006631509] [2024-01-29 22:59:37,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:37,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:37,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:37,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:38,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 319 [2024-01-29 22:59:38,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 252 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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 22:59:38,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:38,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 319 [2024-01-29 22:59:38,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:38,418 INFO L124 PetriNetUnfolderBase]: 448/1143 cut-off events. [2024-01-29 22:59:38,418 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:38,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 1143 events. 448/1143 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6656 event pairs, 294 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 1715. Up to 703 conditions per place. [2024-01-29 22:59:38,425 INFO L140 encePairwiseOnDemand]: 314/319 looper letters, 59 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2024-01-29 22:59:38,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 249 transitions, 628 flow [2024-01-29 22:59:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2024-01-29 22:59:38,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7345872518286312 [2024-01-29 22:59:38,428 INFO L175 Difference]: Start difference. First operand has 253 places, 252 transitions, 512 flow. Second operand 3 states and 703 transitions. [2024-01-29 22:59:38,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 249 transitions, 628 flow [2024-01-29 22:59:38,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 249 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:38,433 INFO L231 Difference]: Finished difference. Result has 250 places, 249 transitions, 506 flow [2024-01-29 22:59:38,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=250, PETRI_TRANSITIONS=249} [2024-01-29 22:59:38,435 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -69 predicate places. [2024-01-29 22:59:38,436 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 249 transitions, 506 flow [2024-01-29 22:59:38,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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 22:59:38,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:38,437 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] [2024-01-29 22:59:38,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:59:38,437 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:38,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1728933980, now seen corresponding path program 1 times [2024-01-29 22:59:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:38,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779180926] [2024-01-29 22:59:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:38,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:38,501 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 22:59:38,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:38,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779180926] [2024-01-29 22:59:38,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779180926] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:38,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:38,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:38,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858912894] [2024-01-29 22:59:38,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:38,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:38,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:38,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:38,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:38,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 319 [2024-01-29 22:59:38,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 249 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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 22:59:38,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:38,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 319 [2024-01-29 22:59:38,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:38,972 INFO L124 PetriNetUnfolderBase]: 448/1142 cut-off events. [2024-01-29 22:59:38,972 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:38,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1865 conditions, 1142 events. 448/1142 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6618 event pairs, 294 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1795. Up to 705 conditions per place. [2024-01-29 22:59:38,978 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 54 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-01-29 22:59:38,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 248 transitions, 616 flow [2024-01-29 22:59:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2024-01-29 22:59:38,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7554858934169278 [2024-01-29 22:59:38,981 INFO L175 Difference]: Start difference. First operand has 250 places, 249 transitions, 506 flow. Second operand 3 states and 723 transitions. [2024-01-29 22:59:38,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 248 transitions, 616 flow [2024-01-29 22:59:38,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 248 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:38,985 INFO L231 Difference]: Finished difference. Result has 249 places, 248 transitions, 504 flow [2024-01-29 22:59:38,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=249, PETRI_TRANSITIONS=248} [2024-01-29 22:59:38,985 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -70 predicate places. [2024-01-29 22:59:38,986 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 248 transitions, 504 flow [2024-01-29 22:59:38,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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 22:59:38,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:38,986 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] [2024-01-29 22:59:38,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:59:38,987 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:38,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2057347028, now seen corresponding path program 1 times [2024-01-29 22:59:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:38,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345184189] [2024-01-29 22:59:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:39,035 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 22:59:39,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:39,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345184189] [2024-01-29 22:59:39,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345184189] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:39,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:39,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:39,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790906643] [2024-01-29 22:59:39,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:39,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:39,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:39,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:39,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:39,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 319 [2024-01-29 22:59:39,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 248 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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 22:59:39,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:39,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 319 [2024-01-29 22:59:39,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:39,573 INFO L124 PetriNetUnfolderBase]: 448/1138 cut-off events. [2024-01-29 22:59:39,573 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:39,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 1138 events. 448/1138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6661 event pairs, 294 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 1823. Up to 701 conditions per place. [2024-01-29 22:59:39,579 INFO L140 encePairwiseOnDemand]: 313/319 looper letters, 60 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-01-29 22:59:39,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 244 transitions, 620 flow [2024-01-29 22:59:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2024-01-29 22:59:39,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7335423197492164 [2024-01-29 22:59:39,590 INFO L175 Difference]: Start difference. First operand has 249 places, 248 transitions, 504 flow. Second operand 3 states and 702 transitions. [2024-01-29 22:59:39,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 244 transitions, 620 flow [2024-01-29 22:59:39,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 244 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:39,594 INFO L231 Difference]: Finished difference. Result has 245 places, 244 transitions, 496 flow [2024-01-29 22:59:39,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=245, PETRI_TRANSITIONS=244} [2024-01-29 22:59:39,595 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -74 predicate places. [2024-01-29 22:59:39,595 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 244 transitions, 496 flow [2024-01-29 22:59:39,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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 22:59:39,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:39,596 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] [2024-01-29 22:59:39,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:59:39,596 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:39,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash -646750354, now seen corresponding path program 1 times [2024-01-29 22:59:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:39,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107411176] [2024-01-29 22:59:39,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:39,660 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 22:59:39,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:39,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107411176] [2024-01-29 22:59:39,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107411176] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:39,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:39,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:39,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968951786] [2024-01-29 22:59:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:39,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:39,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 319 [2024-01-29 22:59:39,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 244 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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 22:59:39,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:39,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 319 [2024-01-29 22:59:39,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:40,097 INFO L124 PetriNetUnfolderBase]: 448/1136 cut-off events. [2024-01-29 22:59:40,097 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:40,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 1136 events. 448/1136 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6576 event pairs, 294 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 1776. Up to 704 conditions per place. [2024-01-29 22:59:40,103 INFO L140 encePairwiseOnDemand]: 315/319 looper letters, 55 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2024-01-29 22:59:40,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 242 transitions, 606 flow [2024-01-29 22:59:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-01-29 22:59:40,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7450365726227796 [2024-01-29 22:59:40,105 INFO L175 Difference]: Start difference. First operand has 245 places, 244 transitions, 496 flow. Second operand 3 states and 713 transitions. [2024-01-29 22:59:40,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 242 transitions, 606 flow [2024-01-29 22:59:40,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 242 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:40,109 INFO L231 Difference]: Finished difference. Result has 243 places, 242 transitions, 492 flow [2024-01-29 22:59:40,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=243, PETRI_TRANSITIONS=242} [2024-01-29 22:59:40,110 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -76 predicate places. [2024-01-29 22:59:40,110 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 242 transitions, 492 flow [2024-01-29 22:59:40,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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 22:59:40,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:40,111 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] [2024-01-29 22:59:40,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:59:40,111 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:40,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:40,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1425576777, now seen corresponding path program 1 times [2024-01-29 22:59:40,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:40,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086861894] [2024-01-29 22:59:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:40,172 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 22:59:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:40,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086861894] [2024-01-29 22:59:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086861894] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:40,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:40,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299982957] [2024-01-29 22:59:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:40,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:40,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:40,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:40,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:40,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 319 [2024-01-29 22:59:40,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 242 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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 22:59:40,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:40,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 319 [2024-01-29 22:59:40,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:40,663 INFO L124 PetriNetUnfolderBase]: 448/1133 cut-off events. [2024-01-29 22:59:40,663 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:40,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 1133 events. 448/1133 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6605 event pairs, 294 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1803. Up to 702 conditions per place. [2024-01-29 22:59:40,672 INFO L140 encePairwiseOnDemand]: 314/319 looper letters, 57 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2024-01-29 22:59:40,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 239 transitions, 604 flow [2024-01-29 22:59:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2024-01-29 22:59:40,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7387669801462905 [2024-01-29 22:59:40,675 INFO L175 Difference]: Start difference. First operand has 243 places, 242 transitions, 492 flow. Second operand 3 states and 707 transitions. [2024-01-29 22:59:40,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 239 transitions, 604 flow [2024-01-29 22:59:40,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 239 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:40,681 INFO L231 Difference]: Finished difference. Result has 240 places, 239 transitions, 486 flow [2024-01-29 22:59:40,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=240, PETRI_TRANSITIONS=239} [2024-01-29 22:59:40,682 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -79 predicate places. [2024-01-29 22:59:40,682 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 239 transitions, 486 flow [2024-01-29 22:59:40,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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 22:59:40,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:40,683 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] [2024-01-29 22:59:40,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:59:40,683 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:40,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1243208174, now seen corresponding path program 1 times [2024-01-29 22:59:40,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:40,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153466186] [2024-01-29 22:59:40,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:40,745 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 22:59:40,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:40,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153466186] [2024-01-29 22:59:40,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153466186] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:40,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:40,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:40,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950963406] [2024-01-29 22:59:40,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:40,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:40,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:40,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:40,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:41,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 319 [2024-01-29 22:59:41,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 239 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 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 22:59:41,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:41,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 319 [2024-01-29 22:59:41,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:41,189 INFO L124 PetriNetUnfolderBase]: 448/1128 cut-off events. [2024-01-29 22:59:41,189 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:41,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1858 conditions, 1128 events. 448/1128 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6575 event pairs, 294 based on Foata normal form. 2/712 useless extension candidates. Maximal degree in co-relation 1786. Up to 697 conditions per place. [2024-01-29 22:59:41,194 INFO L140 encePairwiseOnDemand]: 312/319 looper letters, 61 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2024-01-29 22:59:41,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 234 transitions, 602 flow [2024-01-29 22:59:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2024-01-29 22:59:41,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7293625914315569 [2024-01-29 22:59:41,197 INFO L175 Difference]: Start difference. First operand has 240 places, 239 transitions, 486 flow. Second operand 3 states and 698 transitions. [2024-01-29 22:59:41,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 234 transitions, 602 flow [2024-01-29 22:59:41,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 234 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:41,201 INFO L231 Difference]: Finished difference. Result has 235 places, 234 transitions, 476 flow [2024-01-29 22:59:41,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=235, PETRI_TRANSITIONS=234} [2024-01-29 22:59:41,202 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -84 predicate places. [2024-01-29 22:59:41,202 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 234 transitions, 476 flow [2024-01-29 22:59:41,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 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 22:59:41,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:41,203 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] [2024-01-29 22:59:41,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:59:41,203 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:41,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash 912786667, now seen corresponding path program 1 times [2024-01-29 22:59:41,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:41,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713122254] [2024-01-29 22:59:41,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:41,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:41,267 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 22:59:41,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:41,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713122254] [2024-01-29 22:59:41,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713122254] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:41,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:41,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:41,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572402815] [2024-01-29 22:59:41,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:41,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:41,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 319 [2024-01-29 22:59:41,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 234 transitions, 476 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 22:59:41,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:41,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 319 [2024-01-29 22:59:41,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:41,691 INFO L124 PetriNetUnfolderBase]: 448/1127 cut-off events. [2024-01-29 22:59:41,691 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:41,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1850 conditions, 1127 events. 448/1127 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6620 event pairs, 294 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 1715. Up to 703 conditions per place. [2024-01-29 22:59:41,696 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 54 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-01-29 22:59:41,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 233 transitions, 586 flow [2024-01-29 22:59:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2024-01-29 22:59:41,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7241379310344828 [2024-01-29 22:59:41,699 INFO L175 Difference]: Start difference. First operand has 235 places, 234 transitions, 476 flow. Second operand 3 states and 693 transitions. [2024-01-29 22:59:41,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 233 transitions, 586 flow [2024-01-29 22:59:41,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 233 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:41,702 INFO L231 Difference]: Finished difference. Result has 234 places, 233 transitions, 474 flow [2024-01-29 22:59:41,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=234, PETRI_TRANSITIONS=233} [2024-01-29 22:59:41,703 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -85 predicate places. [2024-01-29 22:59:41,703 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 233 transitions, 474 flow [2024-01-29 22:59:41,704 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 22:59:41,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:41,704 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] [2024-01-29 22:59:41,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 22:59:41,704 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:41,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:41,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1768383249, now seen corresponding path program 1 times [2024-01-29 22:59:41,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:41,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557048527] [2024-01-29 22:59:41,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:41,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:41,769 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 22:59:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:41,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557048527] [2024-01-29 22:59:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557048527] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:41,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837845127] [2024-01-29 22:59:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:41,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:42,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 319 [2024-01-29 22:59:42,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 233 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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 22:59:42,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:42,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 319 [2024-01-29 22:59:42,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:42,250 INFO L124 PetriNetUnfolderBase]: 448/1125 cut-off events. [2024-01-29 22:59:42,250 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:42,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 1125 events. 448/1125 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6594 event pairs, 294 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 1796. Up to 710 conditions per place. [2024-01-29 22:59:42,254 INFO L140 encePairwiseOnDemand]: 315/319 looper letters, 61 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2024-01-29 22:59:42,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 231 transitions, 596 flow [2024-01-29 22:59:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2024-01-29 22:59:42,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792058516196448 [2024-01-29 22:59:42,257 INFO L175 Difference]: Start difference. First operand has 234 places, 233 transitions, 474 flow. Second operand 3 states and 650 transitions. [2024-01-29 22:59:42,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 231 transitions, 596 flow [2024-01-29 22:59:42,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 231 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:42,260 INFO L231 Difference]: Finished difference. Result has 232 places, 231 transitions, 470 flow [2024-01-29 22:59:42,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=230, 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=470, PETRI_PLACES=232, PETRI_TRANSITIONS=231} [2024-01-29 22:59:42,261 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -87 predicate places. [2024-01-29 22:59:42,261 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 231 transitions, 470 flow [2024-01-29 22:59:42,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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 22:59:42,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:42,262 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] [2024-01-29 22:59:42,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 22:59:42,262 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:42,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:42,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1014695168, now seen corresponding path program 1 times [2024-01-29 22:59:42,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:42,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543610754] [2024-01-29 22:59:42,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:42,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:42,351 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 22:59:42,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:42,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543610754] [2024-01-29 22:59:42,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543610754] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:42,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:42,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083690131] [2024-01-29 22:59:42,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:42,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:42,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:42,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:42,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 319 [2024-01-29 22:59:42,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 231 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 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 22:59:42,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:42,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 319 [2024-01-29 22:59:42,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:42,812 INFO L124 PetriNetUnfolderBase]: 448/1124 cut-off events. [2024-01-29 22:59:42,812 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:42,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1124 events. 448/1124 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6621 event pairs, 294 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1793. Up to 707 conditions per place. [2024-01-29 22:59:42,817 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 58 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2024-01-29 22:59:42,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 230 transitions, 588 flow [2024-01-29 22:59:42,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2024-01-29 22:59:42,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6938349007314525 [2024-01-29 22:59:42,819 INFO L175 Difference]: Start difference. First operand has 232 places, 231 transitions, 470 flow. Second operand 3 states and 664 transitions. [2024-01-29 22:59:42,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 230 transitions, 588 flow [2024-01-29 22:59:42,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 230 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:42,823 INFO L231 Difference]: Finished difference. Result has 231 places, 230 transitions, 468 flow [2024-01-29 22:59:42,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=231, PETRI_TRANSITIONS=230} [2024-01-29 22:59:42,823 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -88 predicate places. [2024-01-29 22:59:42,823 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 230 transitions, 468 flow [2024-01-29 22:59:42,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 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 22:59:42,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:42,824 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] [2024-01-29 22:59:42,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 22:59:42,824 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:42,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2053104686, now seen corresponding path program 1 times [2024-01-29 22:59:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:42,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343835500] [2024-01-29 22:59:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:42,903 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 22:59:42,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:42,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343835500] [2024-01-29 22:59:42,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343835500] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:42,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:42,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065686487] [2024-01-29 22:59:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:42,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:42,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:43,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 319 [2024-01-29 22:59:43,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 230 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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 22:59:43,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:43,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 319 [2024-01-29 22:59:43,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:43,418 INFO L124 PetriNetUnfolderBase]: 448/1123 cut-off events. [2024-01-29 22:59:43,418 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:43,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 1123 events. 448/1123 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6571 event pairs, 294 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1795. Up to 707 conditions per place. [2024-01-29 22:59:43,423 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 61 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2024-01-29 22:59:43,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 229 transitions, 592 flow [2024-01-29 22:59:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2024-01-29 22:59:43,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2024-01-29 22:59:43,425 INFO L175 Difference]: Start difference. First operand has 231 places, 230 transitions, 468 flow. Second operand 3 states and 667 transitions. [2024-01-29 22:59:43,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 229 transitions, 592 flow [2024-01-29 22:59:43,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 229 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:43,429 INFO L231 Difference]: Finished difference. Result has 230 places, 229 transitions, 466 flow [2024-01-29 22:59:43,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=230, PETRI_TRANSITIONS=229} [2024-01-29 22:59:43,430 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -89 predicate places. [2024-01-29 22:59:43,430 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 229 transitions, 466 flow [2024-01-29 22:59:43,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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 22:59:43,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:43,431 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] [2024-01-29 22:59:43,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 22:59:43,431 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:43,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:43,432 INFO L85 PathProgramCache]: Analyzing trace with hash -586348535, now seen corresponding path program 1 times [2024-01-29 22:59:43,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:43,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854440865] [2024-01-29 22:59:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:43,588 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 22:59:43,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:43,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854440865] [2024-01-29 22:59:43,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854440865] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:43,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:43,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:43,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942168305] [2024-01-29 22:59:43,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:43,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:43,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:43,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:43,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:43,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 319 [2024-01-29 22:59:43,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 229 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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 22:59:43,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:43,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 319 [2024-01-29 22:59:43,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:44,008 INFO L124 PetriNetUnfolderBase]: 448/1122 cut-off events. [2024-01-29 22:59:44,009 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:59:44,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 1122 events. 448/1122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6561 event pairs, 294 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 1777. Up to 704 conditions per place. [2024-01-29 22:59:44,012 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 58 selfloop transitions, 2 changer transitions 0/228 dead transitions. [2024-01-29 22:59:44,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 228 transitions, 584 flow [2024-01-29 22:59:44,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2024-01-29 22:59:44,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2024-01-29 22:59:44,015 INFO L175 Difference]: Start difference. First operand has 230 places, 229 transitions, 466 flow. Second operand 3 states and 682 transitions. [2024-01-29 22:59:44,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 228 transitions, 584 flow [2024-01-29 22:59:44,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 228 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:44,018 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 464 flow [2024-01-29 22:59:44,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2024-01-29 22:59:44,020 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -90 predicate places. [2024-01-29 22:59:44,020 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 464 flow [2024-01-29 22:59:44,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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 22:59:44,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:44,021 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] [2024-01-29 22:59:44,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-29 22:59:44,021 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:44,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash -276180552, now seen corresponding path program 1 times [2024-01-29 22:59:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:44,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901914195] [2024-01-29 22:59:44,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:44,097 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 22:59:44,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:44,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901914195] [2024-01-29 22:59:44,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901914195] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:44,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:44,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:44,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046077989] [2024-01-29 22:59:44,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:44,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:44,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:44,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:44,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:44,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 319 [2024-01-29 22:59:44,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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 22:59:44,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:44,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 319 [2024-01-29 22:59:44,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:44,484 INFO L124 PetriNetUnfolderBase]: 448/1121 cut-off events. [2024-01-29 22:59:44,485 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:44,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1121 events. 448/1121 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6602 event pairs, 294 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 1771. Up to 691 conditions per place. [2024-01-29 22:59:44,489 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 52 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2024-01-29 22:59:44,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 227 transitions, 570 flow [2024-01-29 22:59:44,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2024-01-29 22:59:44,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2024-01-29 22:59:44,492 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 464 flow. Second operand 3 states and 754 transitions. [2024-01-29 22:59:44,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 227 transitions, 570 flow [2024-01-29 22:59:44,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 227 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:44,495 INFO L231 Difference]: Finished difference. Result has 228 places, 227 transitions, 462 flow [2024-01-29 22:59:44,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=228, PETRI_TRANSITIONS=227} [2024-01-29 22:59:44,496 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -91 predicate places. [2024-01-29 22:59:44,496 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 227 transitions, 462 flow [2024-01-29 22:59:44,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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 22:59:44,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:44,497 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] [2024-01-29 22:59:44,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-29 22:59:44,497 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:44,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:44,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2066379849, now seen corresponding path program 1 times [2024-01-29 22:59:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:44,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907793964] [2024-01-29 22:59:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:44,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:44,582 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 22:59:44,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907793964] [2024-01-29 22:59:44,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907793964] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:44,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:44,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:44,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973359771] [2024-01-29 22:59:44,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:44,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:44,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:44,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:44,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:44,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 319 [2024-01-29 22:59:44,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 227 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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 22:59:44,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:44,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 319 [2024-01-29 22:59:44,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:44,984 INFO L124 PetriNetUnfolderBase]: 448/1101 cut-off events. [2024-01-29 22:59:44,984 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:44,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 1101 events. 448/1101 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6535 event pairs, 294 based on Foata normal form. 11/706 useless extension candidates. Maximal degree in co-relation 1696. Up to 683 conditions per place. [2024-01-29 22:59:44,988 INFO L140 encePairwiseOnDemand]: 297/319 looper letters, 53 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2024-01-29 22:59:44,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 207 transitions, 532 flow [2024-01-29 22:59:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-01-29 22:59:44,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7492163009404389 [2024-01-29 22:59:44,991 INFO L175 Difference]: Start difference. First operand has 228 places, 227 transitions, 462 flow. Second operand 3 states and 717 transitions. [2024-01-29 22:59:44,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 207 transitions, 532 flow [2024-01-29 22:59:44,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 207 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:44,995 INFO L231 Difference]: Finished difference. Result has 208 places, 207 transitions, 422 flow [2024-01-29 22:59:44,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=208, PETRI_TRANSITIONS=207} [2024-01-29 22:59:44,995 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -111 predicate places. [2024-01-29 22:59:44,996 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 207 transitions, 422 flow [2024-01-29 22:59:44,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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 22:59:44,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:44,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:44,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-29 22:59:44,997 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:44,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:44,997 INFO L85 PathProgramCache]: Analyzing trace with hash 63432653, now seen corresponding path program 1 times [2024-01-29 22:59:44,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:44,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467028245] [2024-01-29 22:59:44,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:44,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:45,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 22:59:45,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467028245] [2024-01-29 22:59:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467028245] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:45,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:45,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:45,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374959975] [2024-01-29 22:59:45,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:45,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:45,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:45,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:45,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 319 [2024-01-29 22:59:45,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 207 transitions, 422 flow. Second operand has 4 states, 4 states have (on average 203.25) internal successors, (813), 4 states have internal predecessors, (813), 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 22:59:45,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:45,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 319 [2024-01-29 22:59:45,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:45,703 INFO L124 PetriNetUnfolderBase]: 448/1097 cut-off events. [2024-01-29 22:59:45,703 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:59:45,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1097 events. 448/1097 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6439 event pairs, 294 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 1638. Up to 681 conditions per place. [2024-01-29 22:59:45,708 INFO L140 encePairwiseOnDemand]: 305/319 looper letters, 72 selfloop transitions, 10 changer transitions 0/203 dead transitions. [2024-01-29 22:59:45,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 203 transitions, 578 flow [2024-01-29 22:59:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 878 transitions. [2024-01-29 22:59:45,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6880877742946708 [2024-01-29 22:59:45,711 INFO L175 Difference]: Start difference. First operand has 208 places, 207 transitions, 422 flow. Second operand 4 states and 878 transitions. [2024-01-29 22:59:45,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 203 transitions, 578 flow [2024-01-29 22:59:45,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 203 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:45,715 INFO L231 Difference]: Finished difference. Result has 205 places, 203 transitions, 430 flow [2024-01-29 22:59:45,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=430, PETRI_PLACES=205, PETRI_TRANSITIONS=203} [2024-01-29 22:59:45,716 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -114 predicate places. [2024-01-29 22:59:45,716 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 203 transitions, 430 flow [2024-01-29 22:59:45,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 203.25) internal successors, (813), 4 states have internal predecessors, (813), 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 22:59:45,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:45,717 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] [2024-01-29 22:59:45,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-29 22:59:45,717 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:45,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1930262038, now seen corresponding path program 1 times [2024-01-29 22:59:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:45,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595817493] [2024-01-29 22:59:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:45,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:45,768 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 22:59:45,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:45,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595817493] [2024-01-29 22:59:45,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595817493] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:45,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:45,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:45,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389798484] [2024-01-29 22:59:45,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:45,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:45,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:45,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:45,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 319 [2024-01-29 22:59:45,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 203 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:45,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:45,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 319 [2024-01-29 22:59:45,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:46,006 INFO L124 PetriNetUnfolderBase]: 448/1095 cut-off events. [2024-01-29 22:59:46,006 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 22:59:46,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 1095 events. 448/1095 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6466 event pairs, 294 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 1638. Up to 702 conditions per place. [2024-01-29 22:59:46,012 INFO L140 encePairwiseOnDemand]: 313/319 looper letters, 57 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2024-01-29 22:59:46,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 201 transitions, 548 flow [2024-01-29 22:59:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 774 transitions. [2024-01-29 22:59:46,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8087774294670846 [2024-01-29 22:59:46,015 INFO L175 Difference]: Start difference. First operand has 205 places, 203 transitions, 430 flow. Second operand 3 states and 774 transitions. [2024-01-29 22:59:46,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 201 transitions, 548 flow [2024-01-29 22:59:46,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 201 transitions, 528 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:59:46,019 INFO L231 Difference]: Finished difference. Result has 202 places, 201 transitions, 414 flow [2024-01-29 22:59:46,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=202, PETRI_TRANSITIONS=201} [2024-01-29 22:59:46,020 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -117 predicate places. [2024-01-29 22:59:46,020 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 201 transitions, 414 flow [2024-01-29 22:59:46,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:46,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:46,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:46,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-01-29 22:59:46,021 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:46,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:46,022 INFO L85 PathProgramCache]: Analyzing trace with hash 291420011, now seen corresponding path program 1 times [2024-01-29 22:59:46,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:46,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675767776] [2024-01-29 22:59:46,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:46,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:46,154 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 22:59:46,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:46,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675767776] [2024-01-29 22:59:46,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675767776] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:46,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:46,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:59:46,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491977263] [2024-01-29 22:59:46,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:46,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:59:46,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:46,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:59:46,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:59:46,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 319 [2024-01-29 22:59:46,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 201 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 162.6) internal successors, (813), 5 states have internal predecessors, (813), 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 22:59:46,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:46,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 319 [2024-01-29 22:59:46,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:46,760 INFO L124 PetriNetUnfolderBase]: 448/1087 cut-off events. [2024-01-29 22:59:46,760 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:59:46,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 1087 events. 448/1087 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6434 event pairs, 294 based on Foata normal form. 2/703 useless extension candidates. Maximal degree in co-relation 1822. Up to 681 conditions per place. [2024-01-29 22:59:46,764 INFO L140 encePairwiseOnDemand]: 299/319 looper letters, 113 selfloop transitions, 12 changer transitions 0/193 dead transitions. [2024-01-29 22:59:46,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 193 transitions, 648 flow [2024-01-29 22:59:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:59:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:59:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 893 transitions. [2024-01-29 22:59:46,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5598746081504702 [2024-01-29 22:59:46,767 INFO L175 Difference]: Start difference. First operand has 202 places, 201 transitions, 414 flow. Second operand 5 states and 893 transitions. [2024-01-29 22:59:46,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 193 transitions, 648 flow [2024-01-29 22:59:46,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 193 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:46,770 INFO L231 Difference]: Finished difference. Result has 196 places, 193 transitions, 414 flow [2024-01-29 22:59:46,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=414, PETRI_PLACES=196, PETRI_TRANSITIONS=193} [2024-01-29 22:59:46,771 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -123 predicate places. [2024-01-29 22:59:46,771 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 193 transitions, 414 flow [2024-01-29 22:59:46,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 162.6) internal successors, (813), 5 states have internal predecessors, (813), 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 22:59:46,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:46,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:46,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-01-29 22:59:46,772 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:46,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:46,773 INFO L85 PathProgramCache]: Analyzing trace with hash 291413573, now seen corresponding path program 1 times [2024-01-29 22:59:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:46,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867053867] [2024-01-29 22:59:46,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:46,957 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 22:59:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:46,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867053867] [2024-01-29 22:59:46,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867053867] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:46,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:46,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:59:46,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422716862] [2024-01-29 22:59:46,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:46,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:59:46,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:46,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:59:46,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:59:47,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 319 [2024-01-29 22:59:47,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 193 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 169.6) internal successors, (848), 5 states have internal predecessors, (848), 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 22:59:47,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:47,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 319 [2024-01-29 22:59:47,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:47,658 INFO L124 PetriNetUnfolderBase]: 448/1079 cut-off events. [2024-01-29 22:59:47,658 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:47,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 1079 events. 448/1079 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6393 event pairs, 294 based on Foata normal form. 1/694 useless extension candidates. Maximal degree in co-relation 1640. Up to 683 conditions per place. [2024-01-29 22:59:47,663 INFO L140 encePairwiseOnDemand]: 298/319 looper letters, 68 selfloop transitions, 13 changer transitions 0/185 dead transitions. [2024-01-29 22:59:47,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 185 transitions, 560 flow [2024-01-29 22:59:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 22:59:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 22:59:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1085 transitions. [2024-01-29 22:59:47,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5668756530825496 [2024-01-29 22:59:47,666 INFO L175 Difference]: Start difference. First operand has 196 places, 193 transitions, 414 flow. Second operand 6 states and 1085 transitions. [2024-01-29 22:59:47,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 185 transitions, 560 flow [2024-01-29 22:59:47,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 185 transitions, 536 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:59:47,670 INFO L231 Difference]: Finished difference. Result has 189 places, 185 transitions, 400 flow [2024-01-29 22:59:47,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=189, PETRI_TRANSITIONS=185} [2024-01-29 22:59:47,671 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -130 predicate places. [2024-01-29 22:59:47,671 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 185 transitions, 400 flow [2024-01-29 22:59:47,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.6) internal successors, (848), 5 states have internal predecessors, (848), 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 22:59:47,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:47,672 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] [2024-01-29 22:59:47,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-01-29 22:59:47,672 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:47,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash 444087002, now seen corresponding path program 1 times [2024-01-29 22:59:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:47,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431167857] [2024-01-29 22:59:47,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:47,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:47,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:47,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431167857] [2024-01-29 22:59:47,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431167857] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:47,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:47,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:59:47,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115126897] [2024-01-29 22:59:47,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:47,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:59:47,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:47,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:59:47,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:59:48,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 319 [2024-01-29 22:59:48,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 185 transitions, 400 flow. Second operand has 5 states, 5 states have (on average 183.2) internal successors, (916), 5 states have internal predecessors, (916), 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 22:59:48,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:48,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 319 [2024-01-29 22:59:48,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:48,458 INFO L124 PetriNetUnfolderBase]: 448/1077 cut-off events. [2024-01-29 22:59:48,458 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-01-29 22:59:48,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 1077 events. 448/1077 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6369 event pairs, 294 based on Foata normal form. 2/695 useless extension candidates. Maximal degree in co-relation 1638. Up to 681 conditions per place. [2024-01-29 22:59:48,463 INFO L140 encePairwiseOnDemand]: 305/319 looper letters, 78 selfloop transitions, 12 changer transitions 0/183 dead transitions. [2024-01-29 22:59:48,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 183 transitions, 572 flow [2024-01-29 22:59:48,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:59:48,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:59:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 982 transitions. [2024-01-29 22:59:48,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6156739811912225 [2024-01-29 22:59:48,466 INFO L175 Difference]: Start difference. First operand has 189 places, 185 transitions, 400 flow. Second operand 5 states and 982 transitions. [2024-01-29 22:59:48,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 183 transitions, 572 flow [2024-01-29 22:59:48,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 183 transitions, 550 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:59:48,469 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 394 flow [2024-01-29 22:59:48,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=394, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2024-01-29 22:59:48,472 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -133 predicate places. [2024-01-29 22:59:48,472 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 394 flow [2024-01-29 22:59:48,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 183.2) internal successors, (916), 5 states have internal predecessors, (916), 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 22:59:48,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:48,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:48,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-01-29 22:59:48,473 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:48,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1737671043, now seen corresponding path program 1 times [2024-01-29 22:59:48,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:48,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810344071] [2024-01-29 22:59:48,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:48,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:48,804 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 22:59:48,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:48,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810344071] [2024-01-29 22:59:48,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810344071] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:48,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:48,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 22:59:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633341592] [2024-01-29 22:59:48,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:48,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-29 22:59:48,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:48,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-29 22:59:48,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-01-29 22:59:49,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 319 [2024-01-29 22:59:49,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 183 transitions, 394 flow. Second operand has 7 states, 7 states have (on average 182.42857142857142) internal successors, (1277), 7 states have internal predecessors, (1277), 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 22:59:49,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:49,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 319 [2024-01-29 22:59:49,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:49,694 INFO L124 PetriNetUnfolderBase]: 446/1073 cut-off events. [2024-01-29 22:59:49,694 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 22:59:49,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 1073 events. 446/1073 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6389 event pairs, 294 based on Foata normal form. 2/691 useless extension candidates. Maximal degree in co-relation 1638. Up to 681 conditions per place. [2024-01-29 22:59:49,709 INFO L140 encePairwiseOnDemand]: 302/319 looper letters, 73 selfloop transitions, 13 changer transitions 0/179 dead transitions. [2024-01-29 22:59:49,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 179 transitions, 554 flow [2024-01-29 22:59:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-29 22:59:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-29 22:59:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1336 transitions. [2024-01-29 22:59:49,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5982982534706672 [2024-01-29 22:59:49,715 INFO L175 Difference]: Start difference. First operand has 186 places, 183 transitions, 394 flow. Second operand 7 states and 1336 transitions. [2024-01-29 22:59:49,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 179 transitions, 554 flow [2024-01-29 22:59:49,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 179 transitions, 534 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:59:49,718 INFO L231 Difference]: Finished difference. Result has 186 places, 179 transitions, 388 flow [2024-01-29 22:59:49,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=186, PETRI_TRANSITIONS=179} [2024-01-29 22:59:49,719 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -133 predicate places. [2024-01-29 22:59:49,719 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 179 transitions, 388 flow [2024-01-29 22:59:49,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 182.42857142857142) internal successors, (1277), 7 states have internal predecessors, (1277), 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 22:59:49,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:49,720 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] [2024-01-29 22:59:49,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-01-29 22:59:49,721 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-29 22:59:49,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash -840370441, now seen corresponding path program 1 times [2024-01-29 22:59:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:49,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341994231] [2024-01-29 22:59:49,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:59:49,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:59:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:59:49,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:59:49,812 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:59:49,813 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 200 remaining) [2024-01-29 22:59:49,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 200 remaining) [2024-01-29 22:59:49,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 200 remaining) [2024-01-29 22:59:49,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 200 remaining) [2024-01-29 22:59:49,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 200 remaining) [2024-01-29 22:59:49,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 200 remaining) [2024-01-29 22:59:49,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 200 remaining) [2024-01-29 22:59:49,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 200 remaining) [2024-01-29 22:59:49,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 200 remaining) [2024-01-29 22:59:49,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 200 remaining) [2024-01-29 22:59:49,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 200 remaining) [2024-01-29 22:59:49,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 200 remaining) [2024-01-29 22:59:49,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 200 remaining) [2024-01-29 22:59:49,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 200 remaining) [2024-01-29 22:59:49,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 200 remaining) [2024-01-29 22:59:49,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 200 remaining) [2024-01-29 22:59:49,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 200 remaining) [2024-01-29 22:59:49,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 200 remaining) [2024-01-29 22:59:49,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 200 remaining) [2024-01-29 22:59:49,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 200 remaining) [2024-01-29 22:59:49,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 200 remaining) [2024-01-29 22:59:49,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 200 remaining) [2024-01-29 22:59:49,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 200 remaining) [2024-01-29 22:59:49,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 200 remaining) [2024-01-29 22:59:49,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 200 remaining) [2024-01-29 22:59:49,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 200 remaining) [2024-01-29 22:59:49,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 200 remaining) [2024-01-29 22:59:49,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 200 remaining) [2024-01-29 22:59:49,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 200 remaining) [2024-01-29 22:59:49,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 200 remaining) [2024-01-29 22:59:49,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 200 remaining) [2024-01-29 22:59:49,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 200 remaining) [2024-01-29 22:59:49,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 200 remaining) [2024-01-29 22:59:49,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 200 remaining) [2024-01-29 22:59:49,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 200 remaining) [2024-01-29 22:59:49,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 200 remaining) [2024-01-29 22:59:49,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 200 remaining) [2024-01-29 22:59:49,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 200 remaining) [2024-01-29 22:59:49,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 200 remaining) [2024-01-29 22:59:49,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 200 remaining) [2024-01-29 22:59:49,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 200 remaining) [2024-01-29 22:59:49,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 200 remaining) [2024-01-29 22:59:49,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 200 remaining) [2024-01-29 22:59:49,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 200 remaining) [2024-01-29 22:59:49,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 200 remaining) [2024-01-29 22:59:49,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 200 remaining) [2024-01-29 22:59:49,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 200 remaining) [2024-01-29 22:59:49,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 200 remaining) [2024-01-29 22:59:49,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 200 remaining) [2024-01-29 22:59:49,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 200 remaining) [2024-01-29 22:59:49,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 200 remaining) [2024-01-29 22:59:49,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 200 remaining) [2024-01-29 22:59:49,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 200 remaining) [2024-01-29 22:59:49,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 200 remaining) [2024-01-29 22:59:49,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 200 remaining) [2024-01-29 22:59:49,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 200 remaining) [2024-01-29 22:59:49,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 200 remaining) [2024-01-29 22:59:49,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 200 remaining) [2024-01-29 22:59:49,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 200 remaining) [2024-01-29 22:59:49,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 200 remaining) [2024-01-29 22:59:49,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 200 remaining) [2024-01-29 22:59:49,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 200 remaining) [2024-01-29 22:59:49,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 200 remaining) [2024-01-29 22:59:49,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 200 remaining) [2024-01-29 22:59:49,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 200 remaining) [2024-01-29 22:59:49,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 200 remaining) [2024-01-29 22:59:49,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 200 remaining) [2024-01-29 22:59:49,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 200 remaining) [2024-01-29 22:59:49,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 200 remaining) [2024-01-29 22:59:49,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 200 remaining) [2024-01-29 22:59:49,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 200 remaining) [2024-01-29 22:59:49,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 200 remaining) [2024-01-29 22:59:49,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 200 remaining) [2024-01-29 22:59:49,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 200 remaining) [2024-01-29 22:59:49,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 200 remaining) [2024-01-29 22:59:49,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 200 remaining) [2024-01-29 22:59:49,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 200 remaining) [2024-01-29 22:59:49,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 200 remaining) [2024-01-29 22:59:49,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 200 remaining) [2024-01-29 22:59:49,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 200 remaining) [2024-01-29 22:59:49,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 200 remaining) [2024-01-29 22:59:49,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 200 remaining) [2024-01-29 22:59:49,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 200 remaining) [2024-01-29 22:59:49,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 200 remaining) [2024-01-29 22:59:49,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 200 remaining) [2024-01-29 22:59:49,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 200 remaining) [2024-01-29 22:59:49,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 200 remaining) [2024-01-29 22:59:49,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 200 remaining) [2024-01-29 22:59:49,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 200 remaining) [2024-01-29 22:59:49,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 200 remaining) [2024-01-29 22:59:49,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 200 remaining) [2024-01-29 22:59:49,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 200 remaining) [2024-01-29 22:59:49,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 200 remaining) [2024-01-29 22:59:49,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 200 remaining) [2024-01-29 22:59:49,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 200 remaining) [2024-01-29 22:59:49,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 200 remaining) [2024-01-29 22:59:49,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 200 remaining) [2024-01-29 22:59:49,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 200 remaining) [2024-01-29 22:59:49,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 200 remaining) [2024-01-29 22:59:49,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 200 remaining) [2024-01-29 22:59:49,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 200 remaining) [2024-01-29 22:59:49,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 200 remaining) [2024-01-29 22:59:49,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 200 remaining) [2024-01-29 22:59:49,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 200 remaining) [2024-01-29 22:59:49,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 200 remaining) [2024-01-29 22:59:49,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 200 remaining) [2024-01-29 22:59:49,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 200 remaining) [2024-01-29 22:59:49,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 200 remaining) [2024-01-29 22:59:49,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 200 remaining) [2024-01-29 22:59:49,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 200 remaining) [2024-01-29 22:59:49,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 200 remaining) [2024-01-29 22:59:49,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 200 remaining) [2024-01-29 22:59:49,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 200 remaining) [2024-01-29 22:59:49,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 200 remaining) [2024-01-29 22:59:49,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 200 remaining) [2024-01-29 22:59:49,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 200 remaining) [2024-01-29 22:59:49,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 200 remaining) [2024-01-29 22:59:49,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 200 remaining) [2024-01-29 22:59:49,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 200 remaining) [2024-01-29 22:59:49,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 200 remaining) [2024-01-29 22:59:49,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 200 remaining) [2024-01-29 22:59:49,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 200 remaining) [2024-01-29 22:59:49,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 200 remaining) [2024-01-29 22:59:49,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 200 remaining) [2024-01-29 22:59:49,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 200 remaining) [2024-01-29 22:59:49,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 200 remaining) [2024-01-29 22:59:49,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 200 remaining) [2024-01-29 22:59:49,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 200 remaining) [2024-01-29 22:59:49,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 200 remaining) [2024-01-29 22:59:49,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 200 remaining) [2024-01-29 22:59:49,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 200 remaining) [2024-01-29 22:59:49,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 200 remaining) [2024-01-29 22:59:49,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 200 remaining) [2024-01-29 22:59:49,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 200 remaining) [2024-01-29 22:59:49,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 200 remaining) [2024-01-29 22:59:49,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 200 remaining) [2024-01-29 22:59:49,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 200 remaining) [2024-01-29 22:59:49,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 200 remaining) [2024-01-29 22:59:49,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 200 remaining) [2024-01-29 22:59:49,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 200 remaining) [2024-01-29 22:59:49,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 200 remaining) [2024-01-29 22:59:49,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 200 remaining) [2024-01-29 22:59:49,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 200 remaining) [2024-01-29 22:59:49,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 200 remaining) [2024-01-29 22:59:49,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 200 remaining) [2024-01-29 22:59:49,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 200 remaining) [2024-01-29 22:59:49,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 200 remaining) [2024-01-29 22:59:49,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 200 remaining) [2024-01-29 22:59:49,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 200 remaining) [2024-01-29 22:59:49,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 200 remaining) [2024-01-29 22:59:49,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 200 remaining) [2024-01-29 22:59:49,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 200 remaining) [2024-01-29 22:59:49,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 200 remaining) [2024-01-29 22:59:49,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 200 remaining) [2024-01-29 22:59:49,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 200 remaining) [2024-01-29 22:59:49,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 200 remaining) [2024-01-29 22:59:49,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 200 remaining) [2024-01-29 22:59:49,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 200 remaining) [2024-01-29 22:59:49,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 200 remaining) [2024-01-29 22:59:49,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONERROR_FUNCTION (40 of 200 remaining) [2024-01-29 22:59:49,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 200 remaining) [2024-01-29 22:59:49,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 200 remaining) [2024-01-29 22:59:49,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 200 remaining) [2024-01-29 22:59:49,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 200 remaining) [2024-01-29 22:59:49,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 200 remaining) [2024-01-29 22:59:49,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 200 remaining) [2024-01-29 22:59:49,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 200 remaining) [2024-01-29 22:59:49,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 200 remaining) [2024-01-29 22:59:49,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 200 remaining) [2024-01-29 22:59:49,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 200 remaining) [2024-01-29 22:59:49,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 200 remaining) [2024-01-29 22:59:49,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 200 remaining) [2024-01-29 22:59:49,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 200 remaining) [2024-01-29 22:59:49,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 200 remaining) [2024-01-29 22:59:49,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 200 remaining) [2024-01-29 22:59:49,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 200 remaining) [2024-01-29 22:59:49,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 200 remaining) [2024-01-29 22:59:49,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 200 remaining) [2024-01-29 22:59:49,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 200 remaining) [2024-01-29 22:59:49,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 200 remaining) [2024-01-29 22:59:49,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 200 remaining) [2024-01-29 22:59:49,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 200 remaining) [2024-01-29 22:59:49,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 200 remaining) [2024-01-29 22:59:49,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 200 remaining) [2024-01-29 22:59:49,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 200 remaining) [2024-01-29 22:59:49,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 200 remaining) [2024-01-29 22:59:49,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 200 remaining) [2024-01-29 22:59:49,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 200 remaining) [2024-01-29 22:59:49,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 200 remaining) [2024-01-29 22:59:49,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 200 remaining) [2024-01-29 22:59:49,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 200 remaining) [2024-01-29 22:59:49,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 200 remaining) [2024-01-29 22:59:49,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 200 remaining) [2024-01-29 22:59:49,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 200 remaining) [2024-01-29 22:59:49,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 200 remaining) [2024-01-29 22:59:49,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 200 remaining) [2024-01-29 22:59:49,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 200 remaining) [2024-01-29 22:59:49,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 200 remaining) [2024-01-29 22:59:49,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 200 remaining) [2024-01-29 22:59:49,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 200 remaining) [2024-01-29 22:59:49,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-01-29 22:59:49,851 INFO L445 BasicCegarLoop]: Path program 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] [2024-01-29 22:59:49,860 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:59:49,861 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:59:49,968 INFO L503 ceAbstractionStarter]: Automizer considered 159 witness invariants [2024-01-29 22:59:49,969 INFO L504 ceAbstractionStarter]: WitnessConsidered=159 [2024-01-29 22:59:49,971 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:59:49 BasicIcfg [2024-01-29 22:59:49,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:59:49,972 INFO L158 Benchmark]: Toolchain (without parser) took 20661.49ms. Allocated memory was 161.5MB in the beginning and 411.0MB in the end (delta: 249.6MB). Free memory was 127.2MB in the beginning and 153.2MB in the end (delta: -26.0MB). Peak memory consumption was 224.5MB. Max. memory is 16.1GB. [2024-01-29 22:59:49,972 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 119.5MB. Free memory was 70.2MB in the beginning and 70.1MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:59:49,972 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:59:49,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.06ms. Allocated memory is still 161.5MB. Free memory was 127.2MB in the beginning and 100.2MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-29 22:59:49,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.09ms. Allocated memory is still 161.5MB. Free memory was 100.2MB in the beginning and 96.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:59:49,973 INFO L158 Benchmark]: Boogie Preprocessor took 114.42ms. Allocated memory is still 161.5MB. Free memory was 96.0MB in the beginning and 91.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:59:49,973 INFO L158 Benchmark]: RCFGBuilder took 1368.59ms. Allocated memory is still 161.5MB. Free memory was 91.8MB in the beginning and 77.4MB in the end (delta: 14.5MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-01-29 22:59:49,973 INFO L158 Benchmark]: TraceAbstraction took 18588.30ms. Allocated memory was 161.5MB in the beginning and 411.0MB in the end (delta: 249.6MB). Free memory was 77.4MB in the beginning and 153.2MB in the end (delta: -75.8MB). Peak memory consumption was 173.7MB. Max. memory is 16.1GB. [2024-01-29 22:59:49,975 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.21ms. Allocated memory is still 119.5MB. Free memory was 70.2MB in the beginning and 70.1MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.06ms. Allocated memory is still 161.5MB. Free memory was 127.2MB in the beginning and 100.2MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.09ms. Allocated memory is still 161.5MB. Free memory was 100.2MB in the beginning and 96.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.42ms. Allocated memory is still 161.5MB. Free memory was 96.0MB in the beginning and 91.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1368.59ms. Allocated memory is still 161.5MB. Free memory was 91.8MB in the beginning and 77.4MB in the end (delta: 14.5MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18588.30ms. Allocated memory was 161.5MB in the beginning and 411.0MB in the end (delta: 249.6MB). Free memory was 77.4MB in the beginning and 153.2MB in the end (delta: -75.8MB). Peak memory consumption was 173.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 112]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] int *q1, *q2; [L42] int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N; [L83] pthread_t t1, t2; VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L85] N = __VERIFIER_nondet_int() [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L86] n1 = __VERIFIER_nondet_int() [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]]] [L87] n2 = __VERIFIER_nondet_int() [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]]] [L88] q1_front = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]]] [L89] q1_back = q1_front VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]]] [L90] q2_front = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]]] [L91] q2_back = q2_front VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] [L92] CALL create_fresh_int_array(n1) [L108] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L108] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L108] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L108] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L108] RET assume_abort_if_not(size >= 0) [L109] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L109] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] [L109] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE !(!cond) [L109] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L111] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L111] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L111] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] [L111] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L112] int i = 0; VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[14LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[12LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[10LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[8LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[6LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[4LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[2LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[16LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] COND TRUE i < size VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[15LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[13LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[11LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[9LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[7LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[5LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[3LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IntegerLiteral[9],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2147483646]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[17LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] [L113] arr[i] = __VERIFIER_nondet_int() [L112] i++ VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[14LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[12LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[10LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[8LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[6LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[4LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[2LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[16LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 102]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 378 locations, 200 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.3s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15431 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6148 mSDsluCounter, 1504 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 1146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14623 IncrementalHoareTripleChecker+Invalid, 15769 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1146 mSolverCounterUnsat, 1468 mSDtfsCounter, 14623 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=644occurred in iteration=0, InterpolantAutomatonStates: 102, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1147 NumberOfCodeBlocks, 1147 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1032 ConstructedInterpolants, 0 QuantifiedInterpolants, 13598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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 22:59:50,052 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