./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.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-more-inc-subseq.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cb09d658 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-cb09d65-m [2024-01-27 23:10:06,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:10:06,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:10:06,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:10:06,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:10:06,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:10:06,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:10:06,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:10:06,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:10:06,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:10:06,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:10:06,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:10:06,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:10:06,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:10:06,166 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:10:06,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:10:06,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:10:06,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:10:06,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:10:06,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:10:06,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:10:06,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:10:06,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:10:06,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:10:06,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:10:06,168 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:10:06,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:10:06,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:10:06,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:10:06,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:10:06,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:10:06,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:10:06,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:10:06,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:10:06,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:10:06,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:10:06,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:10:06,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:10:06,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:10:06,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:10:06,172 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:10:06,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:10:06,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:10:06,173 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-27 23:10:06,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:10:06,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:10:06,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:10:06,408 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:10:06,408 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:10:06,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-27 23:10:07,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:10:07,599 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:10:07,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-27 23:10:07,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf67e0f3/518b1bb9393b491584a26b8e2379aca9/FLAG9b836b7ac [2024-01-27 23:10:07,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf67e0f3/518b1bb9393b491584a26b8e2379aca9 [2024-01-27 23:10:07,622 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:10:07,623 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:10:07,624 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-more-inc-subseq.wvr.yml/witness.yml [2024-01-27 23:10:07,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:10:07,792 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:10:07,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:10:07,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:10:07,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:10:07,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:10:07" (1/2) ... [2024-01-27 23:10:07,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4049a4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:07, skipping insertion in model container [2024-01-27 23:10:07,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:10:07" (1/2) ... [2024-01-27 23:10:07,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@644d8718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:07, skipping insertion in model container [2024-01-27 23:10:07,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:10:07" (2/2) ... [2024-01-27 23:10:07,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4049a4e5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:07, skipping insertion in model container [2024-01-27 23:10:07,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:10:07" (2/2) ... [2024-01-27 23:10:07,816 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:10:07,868 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:10:07,869 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,869 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] 0 <= i [2024-01-27 23:10:07,869 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,869 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] -2147483647 <= end [2024-01-27 23:10:07,869 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] 0 <= i [2024-01-27 23:10:07,870 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,870 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] last == 0 [2024-01-27 23:10:07,870 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] v_old == 0 [2024-01-27 23:10:07,870 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] new == 0 [2024-01-27 23:10:07,870 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] ok == (_Bool)1 [2024-01-27 23:10:07,870 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] i == 0 [2024-01-27 23:10:07,870 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] A == 0 [2024-01-27 23:10:07,870 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] ok == (_Bool)1 [2024-01-27 23:10:07,871 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] 0 <= i [2024-01-27 23:10:07,871 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] i == 0 [2024-01-27 23:10:07,871 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] v_old == 0 [2024-01-27 23:10:07,871 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (long long )i - (long long )size >= 0LL [2024-01-27 23:10:07,871 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] new == 0 [2024-01-27 23:10:07,871 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] A == 0 [2024-01-27 23:10:07,871 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] last == 0 [2024-01-27 23:10:07,871 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] new == 0 [2024-01-27 23:10:07,872 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] last == 0 [2024-01-27 23:10:07,872 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] i == 0 [2024-01-27 23:10:07,872 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ok == (_Bool)1 [2024-01-27 23:10:07,872 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] A == 0 [2024-01-27 23:10:07,872 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] v_old == 0 [2024-01-27 23:10:07,872 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,872 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] i == 0 [2024-01-27 23:10:07,873 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] new == 0 [2024-01-27 23:10:07,873 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] ok == (_Bool)1 [2024-01-27 23:10:07,873 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] last == 0 [2024-01-27 23:10:07,873 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,873 INFO L98 nessWitnessExtractor]: Loop invariant at [L69-L80] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,873 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] i == 0 [2024-01-27 23:10:07,873 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-27 23:10:07,873 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (((((((((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)) || ((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) [2024-01-27 23:10:07,874 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] A == 0 [2024-01-27 23:10:07,874 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] size != 0 [2024-01-27 23:10:07,874 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] last == 0 [2024-01-27 23:10:07,874 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] new == 0 [2024-01-27 23:10:07,874 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] v_old == 0 [2024-01-27 23:10:07,874 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] ok == (_Bool)1 [2024-01-27 23:10:07,874 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,874 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,875 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,875 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] 0 <= i [2024-01-27 23:10:07,875 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,875 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] i == 0 [2024-01-27 23:10:07,875 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] new == 0 [2024-01-27 23:10:07,875 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] last == 0 [2024-01-27 23:10:07,875 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] ok == (_Bool)1 [2024-01-27 23:10:07,876 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] v_old == 0 [2024-01-27 23:10:07,876 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] A == 0 [2024-01-27 23:10:07,876 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] 0 <= i [2024-01-27 23:10:07,876 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,876 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,876 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] 0 <= i [2024-01-27 23:10:07,876 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ok == (_Bool)1 [2024-01-27 23:10:07,876 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-01-27 23:10:07,877 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] last == 0 [2024-01-27 23:10:07,877 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] i == 0 [2024-01-27 23:10:07,877 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] v_old == 0 [2024-01-27 23:10:07,877 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] new == 0 [2024-01-27 23:10:07,877 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] v_old == 0 [2024-01-27 23:10:07,877 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ok == (_Bool)1 [2024-01-27 23:10:07,877 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] queue == 0 [2024-01-27 23:10:07,878 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] new == 0 [2024-01-27 23:10:07,878 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] last == 0 [2024-01-27 23:10:07,878 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] A == 0 [2024-01-27 23:10:07,878 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] i == 0 [2024-01-27 23:10:07,878 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,878 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] 0 <= i [2024-01-27 23:10:07,878 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,878 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] 0 <= i [2024-01-27 23:10:07,879 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] 0 <= end [2024-01-27 23:10:07,879 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,879 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] last == 0 [2024-01-27 23:10:07,879 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] i == 0 [2024-01-27 23:10:07,879 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] new == 0 [2024-01-27 23:10:07,879 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ok == (_Bool)1 [2024-01-27 23:10:07,879 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] v_old == 0 [2024-01-27 23:10:07,879 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] A == 0 [2024-01-27 23:10:07,880 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,880 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] 0 <= i [2024-01-27 23:10:07,880 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,880 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] 0 <= i [2024-01-27 23:10:07,880 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,880 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] i == 0 [2024-01-27 23:10:07,880 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] end == 0 [2024-01-27 23:10:07,881 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] last == 0 [2024-01-27 23:10:07,881 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-01-27 23:10:07,881 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] queue == 0 [2024-01-27 23:10:07,881 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] v_old == 0 [2024-01-27 23:10:07,881 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ok == (_Bool)1 [2024-01-27 23:10:07,881 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] new == 0 [2024-01-27 23:10:07,881 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] start <= 2147483646 [2024-01-27 23:10:07,882 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] 0 <= i [2024-01-27 23:10:07,882 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,882 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] -2147483647 <= end [2024-01-27 23:10:07,882 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,882 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] 1 <= i [2024-01-27 23:10:07,882 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] v_old == 0 [2024-01-27 23:10:07,882 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-27 23:10:07,882 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ok == (_Bool)1 [2024-01-27 23:10:07,883 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] i == 0 [2024-01-27 23:10:07,883 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] N == 0 [2024-01-27 23:10:07,883 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] end == 0 [2024-01-27 23:10:07,883 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (long long )end + (long long )start >= 0LL [2024-01-27 23:10:07,883 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] A == 0 [2024-01-27 23:10:07,883 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (long long )end - (long long )start >= 0LL [2024-01-27 23:10:07,883 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] last == 0 [2024-01-27 23:10:07,884 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] queue == 0 [2024-01-27 23:10:07,884 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] n == 0 [2024-01-27 23:10:07,884 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] new == 0 [2024-01-27 23:10:07,884 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] start == 0 [2024-01-27 23:10:07,884 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-27 23:10:07,884 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] new == 0 [2024-01-27 23:10:07,884 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] ok == (_Bool)1 [2024-01-27 23:10:07,884 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] last == 0 [2024-01-27 23:10:07,885 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] v_old == 0 [2024-01-27 23:10:07,885 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] i == 0 [2024-01-27 23:10:07,885 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] A == 0 [2024-01-27 23:10:07,885 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] v_old == 0 [2024-01-27 23:10:07,885 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] ok == (_Bool)1 [2024-01-27 23:10:07,885 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] (((((((0LL - (long long )i) + (long long )size >= 0LL && size != 0) && (((((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)) || ((((7 <= size && (-14LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && i == 7) && size != 0)) || ((((6 <= size && (-12LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && i == 6) && size != 0)) || ((((5 <= size && (-10LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && i == 5) && size != 0) [2024-01-27 23:10:07,885 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] new == 0 [2024-01-27 23:10:07,886 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] last == 0 [2024-01-27 23:10:07,886 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] i == 0 [2024-01-27 23:10:07,886 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] 0 <= i [2024-01-27 23:10:07,886 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,886 INFO L98 nessWitnessExtractor]: Loop invariant at [L48-L60] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,886 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] new == 0 [2024-01-27 23:10:07,886 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] i == 0 [2024-01-27 23:10:07,886 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] ok == (_Bool)1 [2024-01-27 23:10:07,887 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] -2147483647 <= start [2024-01-27 23:10:07,887 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] 0 <= i [2024-01-27 23:10:07,887 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,887 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] v_old == 0 [2024-01-27 23:10:07,887 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] last == 0 [2024-01-27 23:10:07,887 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] i == 0 [2024-01-27 23:10:07,887 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] ok == (_Bool)1 [2024-01-27 23:10:07,887 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] new == 0 [2024-01-27 23:10:07,888 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-27 23:10:07,888 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] start == 0 [2024-01-27 23:10:07,888 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] last == 0 [2024-01-27 23:10:07,888 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ok == (_Bool)1 [2024-01-27 23:10:07,888 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (long long )end + (long long )start >= 0LL [2024-01-27 23:10:07,888 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] v_old == 0 [2024-01-27 23:10:07,888 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-27 23:10:07,888 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] i == 0 [2024-01-27 23:10:07,889 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] new == 0 [2024-01-27 23:10:07,889 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] end == 0 [2024-01-27 23:10:07,889 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (long long )end - (long long )start >= 0LL [2024-01-27 23:10:07,889 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] queue == 0 [2024-01-27 23:10:07,889 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] A == 0 [2024-01-27 23:10:07,889 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,889 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] i == 0 [2024-01-27 23:10:07,889 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] v_old == 0 [2024-01-27 23:10:07,890 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] last == 0 [2024-01-27 23:10:07,890 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] start == 0 [2024-01-27 23:10:07,890 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (long long )end + (long long )start >= 0LL [2024-01-27 23:10:07,890 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] N == 0 [2024-01-27 23:10:07,890 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ok == (_Bool)0 [2024-01-27 23:10:07,890 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-27 23:10:07,890 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (long long )end - (long long )start >= 0LL [2024-01-27 23:10:07,890 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] new == 0 [2024-01-27 23:10:07,890 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] end == 0 [2024-01-27 23:10:07,891 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-27 23:10:07,891 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] A == 0 [2024-01-27 23:10:07,891 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] queue == 0 [2024-01-27 23:10:07,891 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] n == 0 [2024-01-27 23:10:07,891 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] 0 <= i [2024-01-27 23:10:07,891 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,891 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ok == (_Bool)1 [2024-01-27 23:10:07,891 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-27 23:10:07,892 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] queue == 0 [2024-01-27 23:10:07,892 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] last == 0 [2024-01-27 23:10:07,892 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] start == 0 [2024-01-27 23:10:07,892 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-27 23:10:07,892 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (long long )end - (long long )start >= 0LL [2024-01-27 23:10:07,892 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] end == 0 [2024-01-27 23:10:07,892 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] A == 0 [2024-01-27 23:10:07,892 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] n == 0 [2024-01-27 23:10:07,893 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (long long )end + (long long )start >= 0LL [2024-01-27 23:10:07,893 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] i == 0 [2024-01-27 23:10:07,893 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] new == 0 [2024-01-27 23:10:07,893 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] v_old == 0 [2024-01-27 23:10:07,893 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,893 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L56] (unsigned long )_argptr == 0UL [2024-01-27 23:10:07,908 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:10:08,104 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-more-inc-subseq.wvr.c[2950,2963] [2024-01-27 23:10:08,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:10:08,126 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 23:10:08,134 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:10:08,195 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-more-inc-subseq.wvr.c[2950,2963] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:10:08,216 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:10:08,227 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:10:08,227 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08 WrapperNode [2024-01-27 23:10:08,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:10:08,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:10:08,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:10:08,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:10:08,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,292 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 440 [2024-01-27 23:10:08,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:10:08,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:10:08,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:10:08,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:10:08,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,339 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 2, 8]. 57 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-27 23:10:08,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:10:08,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:10:08,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:10:08,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:10:08,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (1/1) ... [2024-01-27 23:10:08,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:10:08,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:10:08,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 23:10:08,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 23:10:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:10:08,479 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 23:10:08,479 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 23:10:08,479 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 23:10:08,479 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 23:10:08,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:10:08,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:10:08,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:10:08,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 23:10:08,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:10:08,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:10:08,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:10:08,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:10:08,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 23:10:08,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 23:10:08,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 23:10:08,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 23:10:08,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:10:08,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:10:08,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 23:10:08,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 23:10:08,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 23:10:08,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 23:10:08,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:10:08,483 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 23:10:08,594 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:10:08,596 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:10:09,272 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:10:09,273 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:10:09,554 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:10:09,554 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 23:10:09,556 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:10:09 BoogieIcfgContainer [2024-01-27 23:10:09,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:10:09,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:10:09,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:10:09,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:10:09,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:10:07" (1/4) ... [2024-01-27 23:10:09,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7fe32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:10:09, skipping insertion in model container [2024-01-27 23:10:09,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:10:07" (2/4) ... [2024-01-27 23:10:09,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7fe32 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:10:09, skipping insertion in model container [2024-01-27 23:10:09,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:08" (3/4) ... [2024-01-27 23:10:09,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7fe32 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:10:09, skipping insertion in model container [2024-01-27 23:10:09,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:10:09" (4/4) ... [2024-01-27 23:10:09,564 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-01-27 23:10:09,578 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:10:09,578 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 242 error locations. [2024-01-27 23:10:09,578 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:10:09,657 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 23:10:09,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 481 places, 479 transitions, 972 flow [2024-01-27 23:10:09,820 INFO L124 PetriNetUnfolderBase]: 5/477 cut-off events. [2024-01-27 23:10:09,820 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 23:10:09,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 477 events. 5/477 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 792 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 430. Up to 2 conditions per place. [2024-01-27 23:10:09,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 481 places, 479 transitions, 972 flow [2024-01-27 23:10:09,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 478 places, 476 transitions, 964 flow [2024-01-27 23:10:09,843 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:10:09,850 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;@6b11dee4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:10:09,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 292 error locations. [2024-01-27 23:10:09,851 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:10:09,851 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:10:09,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:10:09,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:09,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:10:09,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:09,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash 41820, now seen corresponding path program 1 times [2024-01-27 23:10:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988157792] [2024-01-27 23:10:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:10,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:10,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988157792] [2024-01-27 23:10:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988157792] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:10,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:10,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:10,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845490392] [2024-01-27 23:10:10,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:10,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:10,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:10,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:10,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 392 out of 479 [2024-01-27 23:10:10,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 476 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:10,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:10,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 392 of 479 [2024-01-27 23:10:10,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:10,679 INFO L124 PetriNetUnfolderBase]: 877/2183 cut-off events. [2024-01-27 23:10:10,679 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-27 23:10:10,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3606 conditions, 2183 events. 877/2183 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13188 event pairs, 621 based on Foata normal form. 0/1293 useless extension candidates. Maximal degree in co-relation 2997. Up to 1369 conditions per place. [2024-01-27 23:10:10,690 INFO L140 encePairwiseOnDemand]: 454/479 looper letters, 61 selfloop transitions, 2 changer transitions 0/453 dead transitions. [2024-01-27 23:10:10,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 453 transitions, 1044 flow [2024-01-27 23:10:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-01-27 23:10:10,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8782185107863605 [2024-01-27 23:10:10,705 INFO L175 Difference]: Start difference. First operand has 478 places, 476 transitions, 964 flow. Second operand 3 states and 1262 transitions. [2024-01-27 23:10:10,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 453 transitions, 1044 flow [2024-01-27 23:10:10,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 453 transitions, 1036 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 23:10:10,722 INFO L231 Difference]: Finished difference. Result has 453 places, 453 transitions, 914 flow [2024-01-27 23:10:10,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=914, PETRI_PLACES=453, PETRI_TRANSITIONS=453} [2024-01-27 23:10:10,727 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -25 predicate places. [2024-01-27 23:10:10,727 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 453 transitions, 914 flow [2024-01-27 23:10:10,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:10,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:10,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 23:10:10,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:10:10,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:10,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1297661, now seen corresponding path program 1 times [2024-01-27 23:10:10,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:10,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464187062] [2024-01-27 23:10:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:10,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:10,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464187062] [2024-01-27 23:10:10,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464187062] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:10,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:10,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:10,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946905665] [2024-01-27 23:10:10,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:10,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:10,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:10,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 479 [2024-01-27 23:10:10,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 453 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 386.6666666666667) internal successors, (1160), 3 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:10,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:10,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 479 [2024-01-27 23:10:10,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:11,220 INFO L124 PetriNetUnfolderBase]: 877/2177 cut-off events. [2024-01-27 23:10:11,220 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-27 23:10:11,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 2177 events. 877/2177 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13132 event pairs, 621 based on Foata normal form. 0/1293 useless extension candidates. Maximal degree in co-relation 3478. Up to 1360 conditions per place. [2024-01-27 23:10:11,230 INFO L140 encePairwiseOnDemand]: 471/479 looper letters, 64 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2024-01-27 23:10:11,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 447 transitions, 1034 flow [2024-01-27 23:10:11,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2024-01-27 23:10:11,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8559498956158664 [2024-01-27 23:10:11,233 INFO L175 Difference]: Start difference. First operand has 453 places, 453 transitions, 914 flow. Second operand 3 states and 1230 transitions. [2024-01-27 23:10:11,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 447 transitions, 1034 flow [2024-01-27 23:10:11,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 447 transitions, 1030 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:11,238 INFO L231 Difference]: Finished difference. Result has 447 places, 447 transitions, 902 flow [2024-01-27 23:10:11,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=447, PETRI_TRANSITIONS=447} [2024-01-27 23:10:11,240 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -31 predicate places. [2024-01-27 23:10:11,240 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 447 transitions, 902 flow [2024-01-27 23:10:11,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.6666666666667) internal successors, (1160), 3 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:11,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:11,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 23:10:11,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:10:11,241 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:11,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 40228762, now seen corresponding path program 1 times [2024-01-27 23:10:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:11,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762228926] [2024-01-27 23:10:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:11,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:11,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:11,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762228926] [2024-01-27 23:10:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762228926] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:11,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:11,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:11,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434217572] [2024-01-27 23:10:11,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:11,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:11,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:11,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:11,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:11,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 479 [2024-01-27 23:10:11,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 447 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 356.6666666666667) internal successors, (1070), 3 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:11,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:11,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 479 [2024-01-27 23:10:11,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:11,651 INFO L124 PetriNetUnfolderBase]: 877/2156 cut-off events. [2024-01-27 23:10:11,651 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-27 23:10:11,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3567 conditions, 2156 events. 877/2156 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13098 event pairs, 621 based on Foata normal form. 0/1293 useless extension candidates. Maximal degree in co-relation 3313. Up to 1353 conditions per place. [2024-01-27 23:10:11,659 INFO L140 encePairwiseOnDemand]: 456/479 looper letters, 79 selfloop transitions, 2 changer transitions 0/426 dead transitions. [2024-01-27 23:10:11,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 426 transitions, 1022 flow [2024-01-27 23:10:11,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1170 transitions. [2024-01-27 23:10:11,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.81419624217119 [2024-01-27 23:10:11,662 INFO L175 Difference]: Start difference. First operand has 447 places, 447 transitions, 902 flow. Second operand 3 states and 1170 transitions. [2024-01-27 23:10:11,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 426 transitions, 1022 flow [2024-01-27 23:10:11,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 426 transitions, 1018 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:11,667 INFO L231 Difference]: Finished difference. Result has 426 places, 426 transitions, 860 flow [2024-01-27 23:10:11,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=426, PETRI_TRANSITIONS=426} [2024-01-27 23:10:11,669 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -52 predicate places. [2024-01-27 23:10:11,669 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 426 transitions, 860 flow [2024-01-27 23:10:11,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 356.6666666666667) internal successors, (1070), 3 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:11,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:11,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 23:10:11,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:10:11,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:11,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:11,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1247093008, now seen corresponding path program 1 times [2024-01-27 23:10:11,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:11,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424645738] [2024-01-27 23:10:11,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:11,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:11,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:11,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424645738] [2024-01-27 23:10:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424645738] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:11,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:11,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173282948] [2024-01-27 23:10:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:11,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:11,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:11,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:11,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:11,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 479 [2024-01-27 23:10:11,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 426 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:11,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:11,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 479 [2024-01-27 23:10:11,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:12,043 INFO L124 PetriNetUnfolderBase]: 877/2132 cut-off events. [2024-01-27 23:10:12,043 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-27 23:10:12,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3523 conditions, 2132 events. 877/2132 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13075 event pairs, 621 based on Foata normal form. 23/1316 useless extension candidates. Maximal degree in co-relation 3194. Up to 1369 conditions per place. [2024-01-27 23:10:12,052 INFO L140 encePairwiseOnDemand]: 453/479 looper letters, 59 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-01-27 23:10:12,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 402 transitions, 934 flow [2024-01-27 23:10:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2024-01-27 23:10:12,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.83785664578984 [2024-01-27 23:10:12,055 INFO L175 Difference]: Start difference. First operand has 426 places, 426 transitions, 860 flow. Second operand 3 states and 1204 transitions. [2024-01-27 23:10:12,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 402 transitions, 934 flow [2024-01-27 23:10:12,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 402 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:12,060 INFO L231 Difference]: Finished difference. Result has 402 places, 402 transitions, 812 flow [2024-01-27 23:10:12,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=402, PETRI_TRANSITIONS=402} [2024-01-27 23:10:12,061 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -76 predicate places. [2024-01-27 23:10:12,061 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 402 transitions, 812 flow [2024-01-27 23:10:12,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:12,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:12,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:12,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:10:12,062 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:12,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash 160554789, now seen corresponding path program 1 times [2024-01-27 23:10:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:12,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833032441] [2024-01-27 23:10:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:12,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:12,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833032441] [2024-01-27 23:10:12,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833032441] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:12,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:12,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:12,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83477721] [2024-01-27 23:10:12,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:12,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:12,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:12,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 479 [2024-01-27 23:10:12,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 402 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 352.6666666666667) internal successors, (1058), 3 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:12,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:12,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 479 [2024-01-27 23:10:12,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:12,372 INFO L124 PetriNetUnfolderBase]: 1022/2470 cut-off events. [2024-01-27 23:10:12,372 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-27 23:10:12,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4199 conditions, 2470 events. 1022/2470 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16424 event pairs, 387 based on Foata normal form. 0/1572 useless extension candidates. Maximal degree in co-relation 4109. Up to 907 conditions per place. [2024-01-27 23:10:12,382 INFO L140 encePairwiseOnDemand]: 452/479 looper letters, 104 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2024-01-27 23:10:12,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 402 transitions, 1026 flow [2024-01-27 23:10:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2024-01-27 23:10:12,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.826026443980515 [2024-01-27 23:10:12,385 INFO L175 Difference]: Start difference. First operand has 402 places, 402 transitions, 812 flow. Second operand 3 states and 1187 transitions. [2024-01-27 23:10:12,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 402 transitions, 1026 flow [2024-01-27 23:10:12,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 402 transitions, 1022 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:12,390 INFO L231 Difference]: Finished difference. Result has 378 places, 378 transitions, 768 flow [2024-01-27 23:10:12,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=378, PETRI_TRANSITIONS=378} [2024-01-27 23:10:12,391 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -100 predicate places. [2024-01-27 23:10:12,391 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 378 transitions, 768 flow [2024-01-27 23:10:12,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.6666666666667) internal successors, (1058), 3 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:12,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:12,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:12,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:10:12,392 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:12,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:12,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1504508897, now seen corresponding path program 1 times [2024-01-27 23:10:12,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:12,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917303702] [2024-01-27 23:10:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:12,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:12,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:12,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917303702] [2024-01-27 23:10:12,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917303702] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:12,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:12,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:12,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913286781] [2024-01-27 23:10:12,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:12,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:12,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:12,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:12,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:12,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 479 [2024-01-27 23:10:12,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 378 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:12,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:12,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 479 [2024-01-27 23:10:12,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:12,744 INFO L124 PetriNetUnfolderBase]: 1022/2462 cut-off events. [2024-01-27 23:10:12,745 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-01-27 23:10:12,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4275 conditions, 2462 events. 1022/2462 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16450 event pairs, 855 based on Foata normal form. 1/1618 useless extension candidates. Maximal degree in co-relation 2098. Up to 1710 conditions per place. [2024-01-27 23:10:12,759 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 80 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-01-27 23:10:12,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 377 transitions, 930 flow [2024-01-27 23:10:12,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1210 transitions. [2024-01-27 23:10:12,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8420320111343076 [2024-01-27 23:10:12,762 INFO L175 Difference]: Start difference. First operand has 378 places, 378 transitions, 768 flow. Second operand 3 states and 1210 transitions. [2024-01-27 23:10:12,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 377 transitions, 930 flow [2024-01-27 23:10:12,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 377 transitions, 928 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:10:12,768 INFO L231 Difference]: Finished difference. Result has 378 places, 377 transitions, 768 flow [2024-01-27 23:10:12,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=378, PETRI_TRANSITIONS=377} [2024-01-27 23:10:12,770 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -100 predicate places. [2024-01-27 23:10:12,771 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 377 transitions, 768 flow [2024-01-27 23:10:12,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:12,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:12,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:12,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:10:12,772 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:12,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:12,772 INFO L85 PathProgramCache]: Analyzing trace with hash 604865678, now seen corresponding path program 1 times [2024-01-27 23:10:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:12,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921675019] [2024-01-27 23:10:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921675019] [2024-01-27 23:10:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921675019] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191912560] [2024-01-27 23:10:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:12,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:12,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:12,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 479 [2024-01-27 23:10:12,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 377 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:12,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:12,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 479 [2024-01-27 23:10:12,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:13,087 INFO L124 PetriNetUnfolderBase]: 1022/2460 cut-off events. [2024-01-27 23:10:13,088 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-01-27 23:10:13,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4228 conditions, 2460 events. 1022/2460 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16461 event pairs, 855 based on Foata normal form. 0/1596 useless extension candidates. Maximal degree in co-relation 4199. Up to 1688 conditions per place. [2024-01-27 23:10:13,098 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 61 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2024-01-27 23:10:13,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 375 transitions, 890 flow [2024-01-27 23:10:13,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2024-01-27 23:10:13,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8670842032011135 [2024-01-27 23:10:13,102 INFO L175 Difference]: Start difference. First operand has 378 places, 377 transitions, 768 flow. Second operand 3 states and 1246 transitions. [2024-01-27 23:10:13,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 375 transitions, 890 flow [2024-01-27 23:10:13,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 375 transitions, 886 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:13,106 INFO L231 Difference]: Finished difference. Result has 376 places, 375 transitions, 764 flow [2024-01-27 23:10:13,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=376, PETRI_TRANSITIONS=375} [2024-01-27 23:10:13,107 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -102 predicate places. [2024-01-27 23:10:13,108 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 375 transitions, 764 flow [2024-01-27 23:10:13,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:13,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:13,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:13,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 23:10:13,109 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:13,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:13,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2127784079, now seen corresponding path program 1 times [2024-01-27 23:10:13,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:13,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125653912] [2024-01-27 23:10:13,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:13,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:13,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:13,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125653912] [2024-01-27 23:10:13,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125653912] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:13,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:13,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:13,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473652818] [2024-01-27 23:10:13,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:13,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:13,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:13,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:13,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:13,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2024-01-27 23:10:13,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 375 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:13,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:13,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2024-01-27 23:10:13,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:13,462 INFO L124 PetriNetUnfolderBase]: 1022/2436 cut-off events. [2024-01-27 23:10:13,462 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-01-27 23:10:13,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4222 conditions, 2436 events. 1022/2436 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16352 event pairs, 855 based on Foata normal form. 0/1592 useless extension candidates. Maximal degree in co-relation 4174. Up to 1668 conditions per place. [2024-01-27 23:10:13,474 INFO L140 encePairwiseOnDemand]: 453/479 looper letters, 79 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2024-01-27 23:10:13,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 351 transitions, 878 flow [2024-01-27 23:10:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2024-01-27 23:10:13,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8114126652748782 [2024-01-27 23:10:13,477 INFO L175 Difference]: Start difference. First operand has 376 places, 375 transitions, 764 flow. Second operand 3 states and 1166 transitions. [2024-01-27 23:10:13,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 351 transitions, 878 flow [2024-01-27 23:10:13,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 351 transitions, 874 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:13,482 INFO L231 Difference]: Finished difference. Result has 352 places, 351 transitions, 716 flow [2024-01-27 23:10:13,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=352, PETRI_TRANSITIONS=351} [2024-01-27 23:10:13,484 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -126 predicate places. [2024-01-27 23:10:13,485 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 351 transitions, 716 flow [2024-01-27 23:10:13,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:13,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:13,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:13,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 23:10:13,486 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:13,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:13,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1536795396, now seen corresponding path program 1 times [2024-01-27 23:10:13,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:13,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598163283] [2024-01-27 23:10:13,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:13,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:13,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598163283] [2024-01-27 23:10:13,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598163283] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:13,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:13,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128241163] [2024-01-27 23:10:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:13,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:13,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:13,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:13,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 479 [2024-01-27 23:10:13,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 351 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 355.6666666666667) internal successors, (1067), 3 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:13,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:13,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 479 [2024-01-27 23:10:13,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:13,772 INFO L124 PetriNetUnfolderBase]: 1022/2413 cut-off events. [2024-01-27 23:10:13,772 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-01-27 23:10:13,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4199 conditions, 2413 events. 1022/2413 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16307 event pairs, 855 based on Foata normal form. 0/1589 useless extension candidates. Maximal degree in co-relation 3892. Up to 1669 conditions per place. [2024-01-27 23:10:13,782 INFO L140 encePairwiseOnDemand]: 454/479 looper letters, 79 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2024-01-27 23:10:13,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 328 transitions, 832 flow [2024-01-27 23:10:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1168 transitions. [2024-01-27 23:10:13,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8128044537230341 [2024-01-27 23:10:13,785 INFO L175 Difference]: Start difference. First operand has 352 places, 351 transitions, 716 flow. Second operand 3 states and 1168 transitions. [2024-01-27 23:10:13,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 328 transitions, 832 flow [2024-01-27 23:10:13,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 328 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:13,789 INFO L231 Difference]: Finished difference. Result has 329 places, 328 transitions, 670 flow [2024-01-27 23:10:13,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=329, PETRI_TRANSITIONS=328} [2024-01-27 23:10:13,791 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -149 predicate places. [2024-01-27 23:10:13,791 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 328 transitions, 670 flow [2024-01-27 23:10:13,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.6666666666667) internal successors, (1067), 3 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:13,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:13,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:13,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 23:10:13,792 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:13,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:13,792 INFO L85 PathProgramCache]: Analyzing trace with hash -396015443, now seen corresponding path program 1 times [2024-01-27 23:10:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429881016] [2024-01-27 23:10:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:13,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429881016] [2024-01-27 23:10:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429881016] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363408415] [2024-01-27 23:10:13,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:13,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:13,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:13,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 479 [2024-01-27 23:10:13,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 328 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:13,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:13,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 479 [2024-01-27 23:10:13,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:14,217 INFO L124 PetriNetUnfolderBase]: 1543/3522 cut-off events. [2024-01-27 23:10:14,217 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-01-27 23:10:14,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6248 conditions, 3522 events. 1543/3522 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 26675 event pairs, 633 based on Foata normal form. 2/2393 useless extension candidates. Maximal degree in co-relation 5973. Up to 1545 conditions per place. [2024-01-27 23:10:14,228 INFO L140 encePairwiseOnDemand]: 451/479 looper letters, 105 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2024-01-27 23:10:14,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 338 transitions, 911 flow [2024-01-27 23:10:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-01-27 23:10:14,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8469032707028532 [2024-01-27 23:10:14,231 INFO L175 Difference]: Start difference. First operand has 329 places, 328 transitions, 670 flow. Second operand 3 states and 1217 transitions. [2024-01-27 23:10:14,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 338 transitions, 911 flow [2024-01-27 23:10:14,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 338 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:14,236 INFO L231 Difference]: Finished difference. Result has 309 places, 308 transitions, 644 flow [2024-01-27 23:10:14,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=309, PETRI_TRANSITIONS=308} [2024-01-27 23:10:14,238 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -169 predicate places. [2024-01-27 23:10:14,239 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 308 transitions, 644 flow [2024-01-27 23:10:14,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:14,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:14,240 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-27 23:10:14,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 23:10:14,240 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:14,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1441642382, now seen corresponding path program 1 times [2024-01-27 23:10:14,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:14,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413371304] [2024-01-27 23:10:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:14,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:14,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413371304] [2024-01-27 23:10:14,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413371304] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:14,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:14,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:10:14,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356288500] [2024-01-27 23:10:14,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:14,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:14,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:14,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:14,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:14,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 479 [2024-01-27 23:10:14,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 308 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:14,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:14,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 479 [2024-01-27 23:10:14,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:14,716 INFO L124 PetriNetUnfolderBase]: 1617/3686 cut-off events. [2024-01-27 23:10:14,716 INFO L125 PetriNetUnfolderBase]: For 335/345 co-relation queries the response was YES. [2024-01-27 23:10:14,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6846 conditions, 3686 events. 1617/3686 cut-off events. For 335/345 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 28017 event pairs, 679 based on Foata normal form. 23/2801 useless extension candidates. Maximal degree in co-relation 3000. Up to 1407 conditions per place. [2024-01-27 23:10:14,728 INFO L140 encePairwiseOnDemand]: 452/479 looper letters, 85 selfloop transitions, 2 changer transitions 1/309 dead transitions. [2024-01-27 23:10:14,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 309 transitions, 835 flow [2024-01-27 23:10:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2024-01-27 23:10:14,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8559498956158664 [2024-01-27 23:10:14,731 INFO L175 Difference]: Start difference. First operand has 309 places, 308 transitions, 644 flow. Second operand 3 states and 1230 transitions. [2024-01-27 23:10:14,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 309 transitions, 835 flow [2024-01-27 23:10:14,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 309 transitions, 832 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:10:14,737 INFO L231 Difference]: Finished difference. Result has 287 places, 285 transitions, 606 flow [2024-01-27 23:10:14,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=287, PETRI_TRANSITIONS=285} [2024-01-27 23:10:14,738 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -191 predicate places. [2024-01-27 23:10:14,738 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 285 transitions, 606 flow [2024-01-27 23:10:14,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:14,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:14,739 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] [2024-01-27 23:10:14,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 23:10:14,739 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:14,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash -937016489, now seen corresponding path program 1 times [2024-01-27 23:10:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:14,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202410308] [2024-01-27 23:10:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:14,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202410308] [2024-01-27 23:10:14,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202410308] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:14,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:14,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:14,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994010651] [2024-01-27 23:10:14,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:14,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:14,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:14,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:14,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:14,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 479 [2024-01-27 23:10:14,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 285 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:14,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:14,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 479 [2024-01-27 23:10:14,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:15,209 INFO L124 PetriNetUnfolderBase]: 1617/3685 cut-off events. [2024-01-27 23:10:15,209 INFO L125 PetriNetUnfolderBase]: For 383/393 co-relation queries the response was YES. [2024-01-27 23:10:15,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6957 conditions, 3685 events. 1617/3685 cut-off events. For 383/393 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 27986 event pairs, 1431 based on Foata normal form. 0/2776 useless extension candidates. Maximal degree in co-relation 3301. Up to 2701 conditions per place. [2024-01-27 23:10:15,228 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 66 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2024-01-27 23:10:15,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 740 flow [2024-01-27 23:10:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2024-01-27 23:10:15,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8559498956158664 [2024-01-27 23:10:15,231 INFO L175 Difference]: Start difference. First operand has 287 places, 285 transitions, 606 flow. Second operand 3 states and 1230 transitions. [2024-01-27 23:10:15,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 740 flow [2024-01-27 23:10:15,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 738 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:10:15,235 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 606 flow [2024-01-27 23:10:15,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2024-01-27 23:10:15,236 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -191 predicate places. [2024-01-27 23:10:15,236 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 606 flow [2024-01-27 23:10:15,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:15,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:15,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:15,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 23:10:15,237 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:15,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1410869316, now seen corresponding path program 1 times [2024-01-27 23:10:15,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:15,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831014292] [2024-01-27 23:10:15,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:15,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:15,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:15,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831014292] [2024-01-27 23:10:15,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831014292] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:15,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:15,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:10:15,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917125230] [2024-01-27 23:10:15,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:15,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:15,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:15,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:15,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:15,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 479 [2024-01-27 23:10:15,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 387.6666666666667) internal successors, (1163), 3 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:15,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:15,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 479 [2024-01-27 23:10:15,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:15,850 INFO L124 PetriNetUnfolderBase]: 1617/3679 cut-off events. [2024-01-27 23:10:15,851 INFO L125 PetriNetUnfolderBase]: For 382/392 co-relation queries the response was YES. [2024-01-27 23:10:15,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6908 conditions, 3679 events. 1617/3679 cut-off events. For 382/392 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 28015 event pairs, 1431 based on Foata normal form. 2/2778 useless extension candidates. Maximal degree in co-relation 6825. Up to 2708 conditions per place. [2024-01-27 23:10:15,861 INFO L140 encePairwiseOnDemand]: 465/479 looper letters, 63 selfloop transitions, 8 changer transitions 0/278 dead transitions. [2024-01-27 23:10:15,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 278 transitions, 736 flow [2024-01-27 23:10:15,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1226 transitions. [2024-01-27 23:10:15,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8531663187195546 [2024-01-27 23:10:15,864 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 606 flow. Second operand 3 states and 1226 transitions. [2024-01-27 23:10:15,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 278 transitions, 736 flow [2024-01-27 23:10:15,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 278 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:15,868 INFO L231 Difference]: Finished difference. Result has 281 places, 278 transitions, 606 flow [2024-01-27 23:10:15,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=281, PETRI_TRANSITIONS=278} [2024-01-27 23:10:15,869 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -197 predicate places. [2024-01-27 23:10:15,869 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 278 transitions, 606 flow [2024-01-27 23:10:15,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.6666666666667) internal successors, (1163), 3 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:15,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:15,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:15,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 23:10:15,870 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:15,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash 120305596, now seen corresponding path program 1 times [2024-01-27 23:10:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:15,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273573542] [2024-01-27 23:10:15,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:15,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:16,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273573542] [2024-01-27 23:10:16,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273573542] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:16,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:16,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:10:16,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442716847] [2024-01-27 23:10:16,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:16,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 23:10:16,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:16,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 23:10:16,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 23:10:16,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 479 [2024-01-27 23:10:16,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 278 transitions, 606 flow. Second operand has 5 states, 5 states have (on average 336.2) internal successors, (1681), 5 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:16,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:16,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 479 [2024-01-27 23:10:16,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:16,729 INFO L124 PetriNetUnfolderBase]: 1617/3649 cut-off events. [2024-01-27 23:10:16,729 INFO L125 PetriNetUnfolderBase]: For 394/406 co-relation queries the response was YES. [2024-01-27 23:10:16,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6913 conditions, 3649 events. 1617/3649 cut-off events. For 394/406 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 28118 event pairs, 663 based on Foata normal form. 3/2769 useless extension candidates. Maximal degree in co-relation 6662. Up to 1612 conditions per place. [2024-01-27 23:10:16,739 INFO L140 encePairwiseOnDemand]: 459/479 looper letters, 113 selfloop transitions, 18 changer transitions 0/307 dead transitions. [2024-01-27 23:10:16,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 307 transitions, 939 flow [2024-01-27 23:10:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 23:10:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 23:10:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2121 transitions. [2024-01-27 23:10:16,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7379958246346555 [2024-01-27 23:10:16,743 INFO L175 Difference]: Start difference. First operand has 281 places, 278 transitions, 606 flow. Second operand 6 states and 2121 transitions. [2024-01-27 23:10:16,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 307 transitions, 939 flow [2024-01-27 23:10:16,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 307 transitions, 923 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:16,748 INFO L231 Difference]: Finished difference. Result has 282 places, 276 transitions, 622 flow [2024-01-27 23:10:16,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=282, PETRI_TRANSITIONS=276} [2024-01-27 23:10:16,749 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -196 predicate places. [2024-01-27 23:10:16,749 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 276 transitions, 622 flow [2024-01-27 23:10:16,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 336.2) internal successors, (1681), 5 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:16,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:16,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:16,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 23:10:16,750 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:16,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash -772235035, now seen corresponding path program 1 times [2024-01-27 23:10:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576209484] [2024-01-27 23:10:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576209484] [2024-01-27 23:10:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576209484] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:16,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:16,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:10:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000980997] [2024-01-27 23:10:16,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:16,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:10:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:16,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:10:16,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:10:16,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 479 [2024-01-27 23:10:16,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 276 transitions, 622 flow. Second operand has 4 states, 4 states have (on average 379.25) internal successors, (1517), 4 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:16,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:16,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 479 [2024-01-27 23:10:16,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:17,237 INFO L124 PetriNetUnfolderBase]: 1617/3677 cut-off events. [2024-01-27 23:10:17,237 INFO L125 PetriNetUnfolderBase]: For 469/479 co-relation queries the response was YES. [2024-01-27 23:10:17,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6967 conditions, 3677 events. 1617/3677 cut-off events. For 469/479 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 27976 event pairs, 1431 based on Foata normal form. 4/2788 useless extension candidates. Maximal degree in co-relation 3339. Up to 2702 conditions per place. [2024-01-27 23:10:17,249 INFO L140 encePairwiseOnDemand]: 467/479 looper letters, 69 selfloop transitions, 10 changer transitions 0/276 dead transitions. [2024-01-27 23:10:17,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 276 transitions, 776 flow [2024-01-27 23:10:17,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 23:10:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 23:10:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1960 transitions. [2024-01-27 23:10:17,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8183716075156576 [2024-01-27 23:10:17,253 INFO L175 Difference]: Start difference. First operand has 282 places, 276 transitions, 622 flow. Second operand 5 states and 1960 transitions. [2024-01-27 23:10:17,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 276 transitions, 776 flow [2024-01-27 23:10:17,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 276 transitions, 756 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 23:10:17,256 INFO L231 Difference]: Finished difference. Result has 281 places, 276 transitions, 628 flow [2024-01-27 23:10:17,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=628, PETRI_PLACES=281, PETRI_TRANSITIONS=276} [2024-01-27 23:10:17,258 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -197 predicate places. [2024-01-27 23:10:17,258 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 276 transitions, 628 flow [2024-01-27 23:10:17,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 379.25) internal successors, (1517), 4 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:17,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:17,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:17,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-27 23:10:17,259 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:17,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:17,260 INFO L85 PathProgramCache]: Analyzing trace with hash 911518265, now seen corresponding path program 1 times [2024-01-27 23:10:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:17,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280643147] [2024-01-27 23:10:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:17,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:17,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:17,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280643147] [2024-01-27 23:10:17,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280643147] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:17,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:17,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 23:10:17,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183970780] [2024-01-27 23:10:17,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:17,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 23:10:17,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:17,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 23:10:17,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-27 23:10:17,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 479 [2024-01-27 23:10:17,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 276 transitions, 628 flow. Second operand has 5 states, 5 states have (on average 372.8) internal successors, (1864), 5 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:17,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:17,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 479 [2024-01-27 23:10:17,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:17,785 INFO L124 PetriNetUnfolderBase]: 1617/3673 cut-off events. [2024-01-27 23:10:17,786 INFO L125 PetriNetUnfolderBase]: For 399/409 co-relation queries the response was YES. [2024-01-27 23:10:17,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6931 conditions, 3673 events. 1617/3673 cut-off events. For 399/409 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 28005 event pairs, 1431 based on Foata normal form. 0/2778 useless extension candidates. Maximal degree in co-relation 6686. Up to 2696 conditions per place. [2024-01-27 23:10:17,799 INFO L140 encePairwiseOnDemand]: 461/479 looper letters, 65 selfloop transitions, 16 changer transitions 0/272 dead transitions. [2024-01-27 23:10:17,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 272 transitions, 778 flow [2024-01-27 23:10:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 23:10:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 23:10:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1930 transitions. [2024-01-27 23:10:17,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8058455114822547 [2024-01-27 23:10:17,802 INFO L175 Difference]: Start difference. First operand has 281 places, 276 transitions, 628 flow. Second operand 5 states and 1930 transitions. [2024-01-27 23:10:17,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 272 transitions, 778 flow [2024-01-27 23:10:17,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 272 transitions, 764 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 23:10:17,806 INFO L231 Difference]: Finished difference. Result has 277 places, 272 transitions, 634 flow [2024-01-27 23:10:17,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=634, PETRI_PLACES=277, PETRI_TRANSITIONS=272} [2024-01-27 23:10:17,807 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -201 predicate places. [2024-01-27 23:10:17,807 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 272 transitions, 634 flow [2024-01-27 23:10:17,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 372.8) internal successors, (1864), 5 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:17,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:17,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:17,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-27 23:10:17,808 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:17,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:17,809 INFO L85 PathProgramCache]: Analyzing trace with hash 599221910, now seen corresponding path program 1 times [2024-01-27 23:10:17,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:17,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172025160] [2024-01-27 23:10:17,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:17,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:18,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172025160] [2024-01-27 23:10:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172025160] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:18,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:18,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 23:10:18,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848715166] [2024-01-27 23:10:18,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:18,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 23:10:18,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:18,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 23:10:18,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 23:10:18,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 479 [2024-01-27 23:10:18,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 272 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 372.8333333333333) internal successors, (2237), 6 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:18,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:18,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 479 [2024-01-27 23:10:18,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:18,686 INFO L124 PetriNetUnfolderBase]: 1615/3667 cut-off events. [2024-01-27 23:10:18,687 INFO L125 PetriNetUnfolderBase]: For 405/415 co-relation queries the response was YES. [2024-01-27 23:10:18,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6921 conditions, 3667 events. 1615/3667 cut-off events. For 405/415 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 27918 event pairs, 1431 based on Foata normal form. 4/2776 useless extension candidates. Maximal degree in co-relation 6687. Up to 2696 conditions per place. [2024-01-27 23:10:18,702 INFO L140 encePairwiseOnDemand]: 463/479 looper letters, 63 selfloop transitions, 12 changer transitions 0/266 dead transitions. [2024-01-27 23:10:18,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 266 transitions, 758 flow [2024-01-27 23:10:18,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 23:10:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 23:10:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2296 transitions. [2024-01-27 23:10:18,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7988865692414753 [2024-01-27 23:10:18,707 INFO L175 Difference]: Start difference. First operand has 277 places, 272 transitions, 634 flow. Second operand 6 states and 2296 transitions. [2024-01-27 23:10:18,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 266 transitions, 758 flow [2024-01-27 23:10:18,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 266 transitions, 722 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 23:10:18,712 INFO L231 Difference]: Finished difference. Result has 274 places, 266 transitions, 596 flow [2024-01-27 23:10:18,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=596, PETRI_PLACES=274, PETRI_TRANSITIONS=266} [2024-01-27 23:10:18,713 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -204 predicate places. [2024-01-27 23:10:18,713 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 266 transitions, 596 flow [2024-01-27 23:10:18,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.8333333333333) internal successors, (2237), 6 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:18,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:18,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:18,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-27 23:10:18,715 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-27 23:10:18,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1537048840, now seen corresponding path program 1 times [2024-01-27 23:10:18,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:18,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949147152] [2024-01-27 23:10:18,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:10:18,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:10:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:10:18,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:10:18,788 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:10:18,788 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (291 of 292 remaining) [2024-01-27 23:10:18,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (290 of 292 remaining) [2024-01-27 23:10:18,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (289 of 292 remaining) [2024-01-27 23:10:18,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (288 of 292 remaining) [2024-01-27 23:10:18,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (287 of 292 remaining) [2024-01-27 23:10:18,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (286 of 292 remaining) [2024-01-27 23:10:18,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (285 of 292 remaining) [2024-01-27 23:10:18,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (284 of 292 remaining) [2024-01-27 23:10:18,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (283 of 292 remaining) [2024-01-27 23:10:18,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (282 of 292 remaining) [2024-01-27 23:10:18,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (281 of 292 remaining) [2024-01-27 23:10:18,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (280 of 292 remaining) [2024-01-27 23:10:18,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (279 of 292 remaining) [2024-01-27 23:10:18,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (278 of 292 remaining) [2024-01-27 23:10:18,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (277 of 292 remaining) [2024-01-27 23:10:18,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (276 of 292 remaining) [2024-01-27 23:10:18,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (275 of 292 remaining) [2024-01-27 23:10:18,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (274 of 292 remaining) [2024-01-27 23:10:18,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (273 of 292 remaining) [2024-01-27 23:10:18,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (272 of 292 remaining) [2024-01-27 23:10:18,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (271 of 292 remaining) [2024-01-27 23:10:18,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (270 of 292 remaining) [2024-01-27 23:10:18,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (269 of 292 remaining) [2024-01-27 23:10:18,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (268 of 292 remaining) [2024-01-27 23:10:18,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (267 of 292 remaining) [2024-01-27 23:10:18,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (266 of 292 remaining) [2024-01-27 23:10:18,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (265 of 292 remaining) [2024-01-27 23:10:18,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (264 of 292 remaining) [2024-01-27 23:10:18,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (263 of 292 remaining) [2024-01-27 23:10:18,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (262 of 292 remaining) [2024-01-27 23:10:18,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (261 of 292 remaining) [2024-01-27 23:10:18,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (260 of 292 remaining) [2024-01-27 23:10:18,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (259 of 292 remaining) [2024-01-27 23:10:18,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (258 of 292 remaining) [2024-01-27 23:10:18,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (257 of 292 remaining) [2024-01-27 23:10:18,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (256 of 292 remaining) [2024-01-27 23:10:18,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (255 of 292 remaining) [2024-01-27 23:10:18,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (254 of 292 remaining) [2024-01-27 23:10:18,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (253 of 292 remaining) [2024-01-27 23:10:18,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (252 of 292 remaining) [2024-01-27 23:10:18,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (251 of 292 remaining) [2024-01-27 23:10:18,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (250 of 292 remaining) [2024-01-27 23:10:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (249 of 292 remaining) [2024-01-27 23:10:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (248 of 292 remaining) [2024-01-27 23:10:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (247 of 292 remaining) [2024-01-27 23:10:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (246 of 292 remaining) [2024-01-27 23:10:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (245 of 292 remaining) [2024-01-27 23:10:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (244 of 292 remaining) [2024-01-27 23:10:18,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (243 of 292 remaining) [2024-01-27 23:10:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (242 of 292 remaining) [2024-01-27 23:10:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (241 of 292 remaining) [2024-01-27 23:10:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (240 of 292 remaining) [2024-01-27 23:10:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (239 of 292 remaining) [2024-01-27 23:10:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (238 of 292 remaining) [2024-01-27 23:10:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (237 of 292 remaining) [2024-01-27 23:10:18,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (236 of 292 remaining) [2024-01-27 23:10:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (235 of 292 remaining) [2024-01-27 23:10:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (234 of 292 remaining) [2024-01-27 23:10:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (233 of 292 remaining) [2024-01-27 23:10:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (232 of 292 remaining) [2024-01-27 23:10:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (231 of 292 remaining) [2024-01-27 23:10:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (230 of 292 remaining) [2024-01-27 23:10:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (229 of 292 remaining) [2024-01-27 23:10:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (228 of 292 remaining) [2024-01-27 23:10:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (227 of 292 remaining) [2024-01-27 23:10:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (226 of 292 remaining) [2024-01-27 23:10:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (225 of 292 remaining) [2024-01-27 23:10:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (224 of 292 remaining) [2024-01-27 23:10:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (223 of 292 remaining) [2024-01-27 23:10:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 292 remaining) [2024-01-27 23:10:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 292 remaining) [2024-01-27 23:10:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 292 remaining) [2024-01-27 23:10:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 292 remaining) [2024-01-27 23:10:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 292 remaining) [2024-01-27 23:10:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 292 remaining) [2024-01-27 23:10:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 292 remaining) [2024-01-27 23:10:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 292 remaining) [2024-01-27 23:10:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 292 remaining) [2024-01-27 23:10:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 292 remaining) [2024-01-27 23:10:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 292 remaining) [2024-01-27 23:10:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 292 remaining) [2024-01-27 23:10:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 292 remaining) [2024-01-27 23:10:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 292 remaining) [2024-01-27 23:10:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 292 remaining) [2024-01-27 23:10:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 292 remaining) [2024-01-27 23:10:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 292 remaining) [2024-01-27 23:10:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 292 remaining) [2024-01-27 23:10:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (204 of 292 remaining) [2024-01-27 23:10:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (203 of 292 remaining) [2024-01-27 23:10:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 292 remaining) [2024-01-27 23:10:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 292 remaining) [2024-01-27 23:10:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 292 remaining) [2024-01-27 23:10:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 292 remaining) [2024-01-27 23:10:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 292 remaining) [2024-01-27 23:10:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 292 remaining) [2024-01-27 23:10:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 292 remaining) [2024-01-27 23:10:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 292 remaining) [2024-01-27 23:10:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 292 remaining) [2024-01-27 23:10:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 292 remaining) [2024-01-27 23:10:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 292 remaining) [2024-01-27 23:10:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 292 remaining) [2024-01-27 23:10:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 292 remaining) [2024-01-27 23:10:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 292 remaining) [2024-01-27 23:10:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 292 remaining) [2024-01-27 23:10:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 292 remaining) [2024-01-27 23:10:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 292 remaining) [2024-01-27 23:10:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 292 remaining) [2024-01-27 23:10:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 292 remaining) [2024-01-27 23:10:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 292 remaining) [2024-01-27 23:10:18,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 292 remaining) [2024-01-27 23:10:18,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 292 remaining) [2024-01-27 23:10:18,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 292 remaining) [2024-01-27 23:10:18,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 292 remaining) [2024-01-27 23:10:18,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 292 remaining) [2024-01-27 23:10:18,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 292 remaining) [2024-01-27 23:10:18,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 292 remaining) [2024-01-27 23:10:18,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 292 remaining) [2024-01-27 23:10:18,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 292 remaining) [2024-01-27 23:10:18,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 292 remaining) [2024-01-27 23:10:18,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 292 remaining) [2024-01-27 23:10:18,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 292 remaining) [2024-01-27 23:10:18,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 292 remaining) [2024-01-27 23:10:18,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 292 remaining) [2024-01-27 23:10:18,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 292 remaining) [2024-01-27 23:10:18,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 292 remaining) [2024-01-27 23:10:18,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 292 remaining) [2024-01-27 23:10:18,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 292 remaining) [2024-01-27 23:10:18,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 292 remaining) [2024-01-27 23:10:18,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 292 remaining) [2024-01-27 23:10:18,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 292 remaining) [2024-01-27 23:10:18,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 292 remaining) [2024-01-27 23:10:18,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 292 remaining) [2024-01-27 23:10:18,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 292 remaining) [2024-01-27 23:10:18,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 292 remaining) [2024-01-27 23:10:18,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 292 remaining) [2024-01-27 23:10:18,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 292 remaining) [2024-01-27 23:10:18,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 292 remaining) [2024-01-27 23:10:18,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 292 remaining) [2024-01-27 23:10:18,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 292 remaining) [2024-01-27 23:10:18,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 292 remaining) [2024-01-27 23:10:18,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 292 remaining) [2024-01-27 23:10:18,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 292 remaining) [2024-01-27 23:10:18,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 292 remaining) [2024-01-27 23:10:18,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 292 remaining) [2024-01-27 23:10:18,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 292 remaining) [2024-01-27 23:10:18,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 292 remaining) [2024-01-27 23:10:18,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 292 remaining) [2024-01-27 23:10:18,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 292 remaining) [2024-01-27 23:10:18,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 292 remaining) [2024-01-27 23:10:18,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 292 remaining) [2024-01-27 23:10:18,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 292 remaining) [2024-01-27 23:10:18,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 292 remaining) [2024-01-27 23:10:18,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 292 remaining) [2024-01-27 23:10:18,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 292 remaining) [2024-01-27 23:10:18,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 292 remaining) [2024-01-27 23:10:18,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 292 remaining) [2024-01-27 23:10:18,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 292 remaining) [2024-01-27 23:10:18,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 292 remaining) [2024-01-27 23:10:18,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 292 remaining) [2024-01-27 23:10:18,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 292 remaining) [2024-01-27 23:10:18,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 292 remaining) [2024-01-27 23:10:18,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 292 remaining) [2024-01-27 23:10:18,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 292 remaining) [2024-01-27 23:10:18,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 292 remaining) [2024-01-27 23:10:18,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 292 remaining) [2024-01-27 23:10:18,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 292 remaining) [2024-01-27 23:10:18,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 292 remaining) [2024-01-27 23:10:18,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 292 remaining) [2024-01-27 23:10:18,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 292 remaining) [2024-01-27 23:10:18,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 292 remaining) [2024-01-27 23:10:18,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 292 remaining) [2024-01-27 23:10:18,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 292 remaining) [2024-01-27 23:10:18,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 292 remaining) [2024-01-27 23:10:18,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 292 remaining) [2024-01-27 23:10:18,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 292 remaining) [2024-01-27 23:10:18,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 292 remaining) [2024-01-27 23:10:18,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 292 remaining) [2024-01-27 23:10:18,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 292 remaining) [2024-01-27 23:10:18,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 292 remaining) [2024-01-27 23:10:18,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 292 remaining) [2024-01-27 23:10:18,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 292 remaining) [2024-01-27 23:10:18,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 292 remaining) [2024-01-27 23:10:18,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 292 remaining) [2024-01-27 23:10:18,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 292 remaining) [2024-01-27 23:10:18,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 292 remaining) [2024-01-27 23:10:18,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 292 remaining) [2024-01-27 23:10:18,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 292 remaining) [2024-01-27 23:10:18,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 292 remaining) [2024-01-27 23:10:18,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 292 remaining) [2024-01-27 23:10:18,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 292 remaining) [2024-01-27 23:10:18,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 292 remaining) [2024-01-27 23:10:18,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 292 remaining) [2024-01-27 23:10:18,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 292 remaining) [2024-01-27 23:10:18,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 292 remaining) [2024-01-27 23:10:18,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 292 remaining) [2024-01-27 23:10:18,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 292 remaining) [2024-01-27 23:10:18,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 292 remaining) [2024-01-27 23:10:18,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 292 remaining) [2024-01-27 23:10:18,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 292 remaining) [2024-01-27 23:10:18,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 292 remaining) [2024-01-27 23:10:18,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 292 remaining) [2024-01-27 23:10:18,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 292 remaining) [2024-01-27 23:10:18,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 292 remaining) [2024-01-27 23:10:18,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 292 remaining) [2024-01-27 23:10:18,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 292 remaining) [2024-01-27 23:10:18,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 292 remaining) [2024-01-27 23:10:18,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 292 remaining) [2024-01-27 23:10:18,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 292 remaining) [2024-01-27 23:10:18,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 292 remaining) [2024-01-27 23:10:18,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 292 remaining) [2024-01-27 23:10:18,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 292 remaining) [2024-01-27 23:10:18,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 292 remaining) [2024-01-27 23:10:18,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 292 remaining) [2024-01-27 23:10:18,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 292 remaining) [2024-01-27 23:10:18,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 292 remaining) [2024-01-27 23:10:18,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 292 remaining) [2024-01-27 23:10:18,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 292 remaining) [2024-01-27 23:10:18,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 292 remaining) [2024-01-27 23:10:18,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 292 remaining) [2024-01-27 23:10:18,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 292 remaining) [2024-01-27 23:10:18,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 292 remaining) [2024-01-27 23:10:18,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 292 remaining) [2024-01-27 23:10:18,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 292 remaining) [2024-01-27 23:10:18,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 292 remaining) [2024-01-27 23:10:18,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 292 remaining) [2024-01-27 23:10:18,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 292 remaining) [2024-01-27 23:10:18,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 292 remaining) [2024-01-27 23:10:18,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 292 remaining) [2024-01-27 23:10:18,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 292 remaining) [2024-01-27 23:10:18,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 292 remaining) [2024-01-27 23:10:18,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 292 remaining) [2024-01-27 23:10:18,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 292 remaining) [2024-01-27 23:10:18,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 292 remaining) [2024-01-27 23:10:18,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 292 remaining) [2024-01-27 23:10:18,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 292 remaining) [2024-01-27 23:10:18,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 292 remaining) [2024-01-27 23:10:18,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 292 remaining) [2024-01-27 23:10:18,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 292 remaining) [2024-01-27 23:10:18,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 292 remaining) [2024-01-27 23:10:18,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 292 remaining) [2024-01-27 23:10:18,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 292 remaining) [2024-01-27 23:10:18,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193ASSERT_VIOLATIONERROR_FUNCTION (50 of 292 remaining) [2024-01-27 23:10:18,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 292 remaining) [2024-01-27 23:10:18,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 292 remaining) [2024-01-27 23:10:18,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 292 remaining) [2024-01-27 23:10:18,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 292 remaining) [2024-01-27 23:10:18,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 292 remaining) [2024-01-27 23:10:18,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 292 remaining) [2024-01-27 23:10:18,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 292 remaining) [2024-01-27 23:10:18,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 292 remaining) [2024-01-27 23:10:18,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 292 remaining) [2024-01-27 23:10:18,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 292 remaining) [2024-01-27 23:10:18,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 292 remaining) [2024-01-27 23:10:18,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 292 remaining) [2024-01-27 23:10:18,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 292 remaining) [2024-01-27 23:10:18,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 292 remaining) [2024-01-27 23:10:18,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 292 remaining) [2024-01-27 23:10:18,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 292 remaining) [2024-01-27 23:10:18,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 292 remaining) [2024-01-27 23:10:18,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 292 remaining) [2024-01-27 23:10:18,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 292 remaining) [2024-01-27 23:10:18,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 292 remaining) [2024-01-27 23:10:18,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 292 remaining) [2024-01-27 23:10:18,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 292 remaining) [2024-01-27 23:10:18,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 292 remaining) [2024-01-27 23:10:18,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 292 remaining) [2024-01-27 23:10:18,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 292 remaining) [2024-01-27 23:10:18,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 292 remaining) [2024-01-27 23:10:18,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 292 remaining) [2024-01-27 23:10:18,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 292 remaining) [2024-01-27 23:10:18,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 292 remaining) [2024-01-27 23:10:18,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 292 remaining) [2024-01-27 23:10:18,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 292 remaining) [2024-01-27 23:10:18,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 292 remaining) [2024-01-27 23:10:18,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 292 remaining) [2024-01-27 23:10:18,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 292 remaining) [2024-01-27 23:10:18,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 292 remaining) [2024-01-27 23:10:18,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 292 remaining) [2024-01-27 23:10:18,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 292 remaining) [2024-01-27 23:10:18,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 292 remaining) [2024-01-27 23:10:18,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 292 remaining) [2024-01-27 23:10:18,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 292 remaining) [2024-01-27 23:10:18,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 292 remaining) [2024-01-27 23:10:18,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 292 remaining) [2024-01-27 23:10:18,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 292 remaining) [2024-01-27 23:10:18,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 292 remaining) [2024-01-27 23:10:18,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 292 remaining) [2024-01-27 23:10:18,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 292 remaining) [2024-01-27 23:10:18,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 292 remaining) [2024-01-27 23:10:18,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 292 remaining) [2024-01-27 23:10:18,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 292 remaining) [2024-01-27 23:10:18,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 292 remaining) [2024-01-27 23:10:18,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-27 23:10:18,838 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:18,850 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:10:18,850 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:10:18,952 INFO L503 ceAbstractionStarter]: Automizer considered 241 witness invariants [2024-01-27 23:10:18,952 INFO L504 ceAbstractionStarter]: WitnessConsidered=241 [2024-01-27 23:10:18,953 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:10:18 BasicIcfg [2024-01-27 23:10:18,953 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:10:18,953 INFO L158 Benchmark]: Toolchain (without parser) took 11162.07ms. Allocated memory was 148.9MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 67.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 469.6MB. Max. memory is 16.1GB. [2024-01-27 23:10:18,954 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:10:18,954 INFO L158 Benchmark]: Witness Parser took 4.43ms. Allocated memory is still 148.9MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:10:18,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.09ms. Allocated memory was 148.9MB in the beginning and 211.8MB in the end (delta: 62.9MB). Free memory was 67.3MB in the beginning and 165.1MB in the end (delta: -97.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-01-27 23:10:18,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.81ms. Allocated memory is still 211.8MB. Free memory was 165.1MB in the beginning and 162.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:10:18,954 INFO L158 Benchmark]: Boogie Preprocessor took 82.37ms. Allocated memory is still 211.8MB. Free memory was 162.0MB in the beginning and 157.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 23:10:18,955 INFO L158 Benchmark]: RCFGBuilder took 1177.50ms. Allocated memory is still 211.8MB. Free memory was 157.8MB in the beginning and 154.9MB in the end (delta: 2.9MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2024-01-27 23:10:18,955 INFO L158 Benchmark]: TraceAbstraction took 9395.28ms. Allocated memory was 211.8MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 153.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 492.6MB. Max. memory is 16.1GB. [2024-01-27 23:10:18,956 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 4.43ms. Allocated memory is still 148.9MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.09ms. Allocated memory was 148.9MB in the beginning and 211.8MB in the end (delta: 62.9MB). Free memory was 67.3MB in the beginning and 165.1MB in the end (delta: -97.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.81ms. Allocated memory is still 211.8MB. Free memory was 165.1MB in the beginning and 162.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.37ms. Allocated memory is still 211.8MB. Free memory was 162.0MB in the beginning and 157.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1177.50ms. Allocated memory is still 211.8MB. Free memory was 157.8MB in the beginning and 154.9MB in the end (delta: 2.9MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9395.28ms. Allocated memory was 211.8MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 153.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 492.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 117]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] int *queue, *A; [L42] int i, N, n, last, start, end, new, v_old; [L43] _Bool ok; [L86] pthread_t t1, t2; VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] [L88] ok = 1 VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] [L89] N = __VERIFIER_nondet_int() [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] [L90] n = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] [L91] start = __VERIFIER_nondet_int() [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] [L92] end = start VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] [L93] CALL create_fresh_int_array(n) [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] [L113] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L113] RET assume_abort_if_not(size >= 0) [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] [L114] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE !(!cond) [L114] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] [L116] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L117] int i = 0; VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,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[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]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] COND TRUE i < size VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[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]]]],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]]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] 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 [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] [L118] arr[i] = __VERIFIER_nondet_int() [L117] i++ VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,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[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]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] - 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: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: 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: 57]: 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: 51]: 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: 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: 58]: 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: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: 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: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: 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: 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: 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: 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: 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: 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: 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: 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: 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: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: 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: 113]: 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: 113]: 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: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: 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: 113]: 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: 113]: 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: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: 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: 117]: 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: 117]: 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: 117]: 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: 117]: 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: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: 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: 102]: 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: 101]: 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, 552 locations, 292 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: 9.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1867 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 976 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3166 IncrementalHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 486 mSolverCounterUnsat, 219 mSDtfsCounter, 3166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=964occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 816 NumberOfCodeBlocks, 816 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 1658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 23:10:19,051 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