./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-dec-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-dec-subseq.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ab2e0ac4 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-dec-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-ab2e0ac-m [2024-01-29 14:19:46,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:19:46,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:19:46,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:19:46,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:19:46,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:19:46,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:19:46,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:19:46,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:19:46,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:19:46,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:19:46,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:19:46,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:19:46,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:19:46,134 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:19:46,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:19:46,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:19:46,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:19:46,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:19:46,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:19:46,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:19:46,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:19:46,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:19:46,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:19:46,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:19:46,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:19:46,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:19:46,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:19:46,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:19:46,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:19:46,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:19:46,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:19:46,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:19:46,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:19:46,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:19:46,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:19:46,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:19:46,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:19:46,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:19:46,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:19:46,139 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:19:46,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:19:46,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:19:46,140 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 14:19:46,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:19:46,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:19:46,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:19:46,344 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:19:46,345 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:19:46,346 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-dec-subseq.wvr.yml/witness.yml [2024-01-29 14:19:46,558 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:19:46,559 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:19:46,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-01-29 14:19:47,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:19:47,754 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:19:47,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-01-29 14:19:47,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c0c7e63/52f443c694ff40f08b4ac1c6710e31a6/FLAGd293a84d0 [2024-01-29 14:19:47,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c0c7e63/52f443c694ff40f08b4ac1c6710e31a6 [2024-01-29 14:19:47,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:19:47,772 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:19:47,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:19:47,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:19:47,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:19:47,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:19:46" (1/2) ... [2024-01-29 14:19:47,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f19d0d8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:47, skipping insertion in model container [2024-01-29 14:19:47,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:19:46" (1/2) ... [2024-01-29 14:19:47,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@14ae8244 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:19:47, skipping insertion in model container [2024-01-29 14:19:47,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:19:47" (2/2) ... [2024-01-29 14:19:47,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f19d0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:47, skipping insertion in model container [2024-01-29 14:19:47,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:19:47" (2/2) ... [2024-01-29 14:19:47,780 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:19:47,820 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:19:47,821 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] start == 0 [2024-01-29 14:19:47,821 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] end == 0 [2024-01-29 14:19:47,821 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ok == (_Bool)1 [2024-01-29 14:19:47,821 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (long long )end - (long long )start >= 0LL [2024-01-29 14:19:47,821 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] last == 0 [2024-01-29 14:19:47,821 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] i == 0 [2024-01-29 14:19:47,822 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] new == 0 [2024-01-29 14:19:47,822 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] A == 0 [2024-01-29 14:19:47,822 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] v_old == 0 [2024-01-29 14:19:47,822 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (long long )end + (long long )start >= 0LL [2024-01-29 14:19:47,822 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] queue == 0 [2024-01-29 14:19:47,822 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 14:19:47,822 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-29 14:19:47,822 INFO L98 nessWitnessExtractor]: Loop invariant at [L48-L60] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,823 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] i == 0 [2024-01-29 14:19:47,823 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] last == 0 [2024-01-29 14:19:47,823 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] new == 0 [2024-01-29 14:19:47,823 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] ok == (_Bool)1 [2024-01-29 14:19:47,823 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,823 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] -2147483647 <= start [2024-01-29 14:19:47,823 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,823 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] 0 <= i [2024-01-29 14:19:47,824 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] 0 <= i [2024-01-29 14:19:47,824 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,824 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] 0 <= end [2024-01-29 14:19:47,824 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] last == 0 [2024-01-29 14:19:47,824 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (long long )i - (long long )size >= 0LL [2024-01-29 14:19:47,824 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] i == 0 [2024-01-29 14:19:47,824 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] new == 0 [2024-01-29 14:19:47,824 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] ok == (_Bool)1 [2024-01-29 14:19:47,825 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] 0 <= i [2024-01-29 14:19:47,825 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] A == 0 [2024-01-29 14:19:47,825 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] v_old == 0 [2024-01-29 14:19:47,825 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,825 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,825 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] queue == 0 [2024-01-29 14:19:47,825 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] i == 0 [2024-01-29 14:19:47,825 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] new == 0 [2024-01-29 14:19:47,826 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] last == 0 [2024-01-29 14:19:47,826 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ok == (_Bool)1 [2024-01-29 14:19:47,826 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] v_old == 0 [2024-01-29 14:19:47,826 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] A == 0 [2024-01-29 14:19:47,826 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,826 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 14:19:47,826 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] A == 0 [2024-01-29 14:19:47,826 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] last == 0 [2024-01-29 14:19:47,827 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] n == 0 [2024-01-29 14:19:47,827 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] v_old == 0 [2024-01-29 14:19:47,827 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-29 14:19:47,827 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] end == 0 [2024-01-29 14:19:47,827 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (long long )end + (long long )start >= 0LL [2024-01-29 14:19:47,827 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] i == 0 [2024-01-29 14:19:47,827 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] new == 0 [2024-01-29 14:19:47,827 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] queue == 0 [2024-01-29 14:19:47,828 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] start == 0 [2024-01-29 14:19:47,828 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ok == (_Bool)1 [2024-01-29 14:19:47,828 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (long long )end - (long long )start >= 0LL [2024-01-29 14:19:47,828 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,828 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] 0 <= i [2024-01-29 14:19:47,828 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] i == 0 [2024-01-29 14:19:47,828 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] last == 0 [2024-01-29 14:19:47,829 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] new == 0 [2024-01-29 14:19:47,829 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] v_old == 0 [2024-01-29 14:19:47,829 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] ok == (_Bool)1 [2024-01-29 14:19:47,829 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] ok == (_Bool)1 [2024-01-29 14:19:47,829 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] i == 0 [2024-01-29 14:19:47,829 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] A == 0 [2024-01-29 14:19:47,829 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] new == 0 [2024-01-29 14:19:47,829 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] last == 0 [2024-01-29 14:19:47,830 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] v_old == 0 [2024-01-29 14:19:47,830 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] v_old == 0 [2024-01-29 14:19:47,830 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] i == 0 [2024-01-29 14:19:47,830 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] ok == (_Bool)1 [2024-01-29 14:19:47,830 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] new == 0 [2024-01-29 14:19:47,830 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] last == 0 [2024-01-29 14:19:47,830 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] A == 0 [2024-01-29 14:19:47,830 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,831 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] v_old == 0 [2024-01-29 14:19:47,831 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] new == 0 [2024-01-29 14:19:47,831 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] A == 0 [2024-01-29 14:19:47,831 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ok == (_Bool)1 [2024-01-29 14:19:47,831 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] i == 0 [2024-01-29 14:19:47,831 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] last == 0 [2024-01-29 14:19:47,831 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 14:19:47,832 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] queue == 0 [2024-01-29 14:19:47,832 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] A == 0 [2024-01-29 14:19:47,832 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (long long )end - (long long )start >= 0LL [2024-01-29 14:19:47,832 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] last == 0 [2024-01-29 14:19:47,832 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] v_old == 0 [2024-01-29 14:19:47,832 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-29 14:19:47,832 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ok == (_Bool)1 [2024-01-29 14:19:47,832 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] n == 0 [2024-01-29 14:19:47,832 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] new == 0 [2024-01-29 14:19:47,833 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (long long )end + (long long )start >= 0LL [2024-01-29 14:19:47,833 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] start == 0 [2024-01-29 14:19:47,833 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] i == 0 [2024-01-29 14:19:47,833 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] N == 0 [2024-01-29 14:19:47,833 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] end == 0 [2024-01-29 14:19:47,833 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] -2147483647 <= end [2024-01-29 14:19:47,833 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] 0 <= i [2024-01-29 14:19:47,833 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,834 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] v_old == 0 [2024-01-29 14:19:47,834 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ok == (_Bool)1 [2024-01-29 14:19:47,834 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] A == 0 [2024-01-29 14:19:47,834 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] i == 0 [2024-01-29 14:19:47,834 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] last == 0 [2024-01-29 14:19:47,834 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] new == 0 [2024-01-29 14:19:47,834 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,835 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L56] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,835 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] 0 <= i [2024-01-29 14:19:47,835 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,835 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-29 14:19:47,835 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-29 14:19:47,835 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] i == 0 [2024-01-29 14:19:47,835 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] last == 0 [2024-01-29 14:19:47,835 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] ok == (_Bool)1 [2024-01-29 14:19:47,836 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] A == 0 [2024-01-29 14:19:47,836 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] size != 0 [2024-01-29 14:19:47,836 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] new == 0 [2024-01-29 14:19:47,836 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] v_old == 0 [2024-01-29 14:19:47,836 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] 0 <= i [2024-01-29 14:19:47,836 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,836 INFO L98 nessWitnessExtractor]: Loop invariant at [L69-L80] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,836 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] v_old == 0 [2024-01-29 14:19:47,837 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] last == 0 [2024-01-29 14:19:47,837 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] i == 0 [2024-01-29 14:19:47,837 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] new == 0 [2024-01-29 14:19:47,837 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] ok == (_Bool)1 [2024-01-29 14:19:47,837 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-01-29 14:19:47,837 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ok == (_Bool)1 [2024-01-29 14:19:47,837 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] new == 0 [2024-01-29 14:19:47,837 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] queue == 0 [2024-01-29 14:19:47,838 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] i == 0 [2024-01-29 14:19:47,838 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] last == 0 [2024-01-29 14:19:47,838 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] end == 0 [2024-01-29 14:19:47,838 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] v_old == 0 [2024-01-29 14:19:47,838 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,838 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] 0 <= i [2024-01-29 14:19:47,838 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,838 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] 0 <= i [2024-01-29 14:19:47,838 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,839 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,839 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] 0 <= i [2024-01-29 14:19:47,839 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] i == 0 [2024-01-29 14:19:47,839 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 14:19:47,839 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] n == 0 [2024-01-29 14:19:47,839 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (0LL - (long long )end) - (long long )start >= 0LL [2024-01-29 14:19:47,839 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] last == 0 [2024-01-29 14:19:47,839 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] start == 0 [2024-01-29 14:19:47,840 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (long long )end - (long long )start >= 0LL [2024-01-29 14:19:47,840 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (long long )end + (long long )start >= 0LL [2024-01-29 14:19:47,840 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] queue == 0 [2024-01-29 14:19:47,840 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] N == 0 [2024-01-29 14:19:47,840 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ok == (_Bool)0 [2024-01-29 14:19:47,840 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] new == 0 [2024-01-29 14:19:47,840 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] A == 0 [2024-01-29 14:19:47,840 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] v_old == 0 [2024-01-29 14:19:47,840 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] end == 0 [2024-01-29 14:19:47,841 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,841 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,841 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] new == 0 [2024-01-29 14:19:47,841 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ok == (_Bool)1 [2024-01-29 14:19:47,841 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-01-29 14:19:47,841 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] last == 0 [2024-01-29 14:19:47,841 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] i == 0 [2024-01-29 14:19:47,841 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] v_old == 0 [2024-01-29 14:19:47,841 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] start <= 2147483646 [2024-01-29 14:19:47,842 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] -2147483647 <= end [2024-01-29 14:19:47,842 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] 0 <= i [2024-01-29 14:19:47,842 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,842 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] 0 <= i [2024-01-29 14:19:47,842 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,842 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] 0 <= i [2024-01-29 14:19:47,842 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,842 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] ok == (_Bool)1 [2024-01-29 14:19:47,842 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] i == 0 [2024-01-29 14:19:47,843 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] new == 0 [2024-01-29 14:19:47,843 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] 1 <= i [2024-01-29 14:19:47,843 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,843 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] 0 <= i [2024-01-29 14:19:47,843 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,843 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] A == 0 [2024-01-29 14:19:47,843 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] i == 0 [2024-01-29 14:19:47,843 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] ok == (_Bool)1 [2024-01-29 14:19:47,844 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-29 14:19:47,844 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] v_old == 0 [2024-01-29 14:19:47,844 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] last == 0 [2024-01-29 14:19:47,844 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] new == 0 [2024-01-29 14:19:47,844 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (unsigned long )_argptr == 0UL [2024-01-29 14:19:47,863 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:19:48,001 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-dec-subseq.wvr.c[2950,2963] [2024-01-29 14:19:48,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:19:48,017 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 14:19:48,027 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-29 14:19:48,127 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-dec-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-29 14:19:48,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:19:48,173 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:19:48,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48 WrapperNode [2024-01-29 14:19:48,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:19:48,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:19:48,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:19:48,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:19:48,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,238 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 440 [2024-01-29 14:19:48,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:19:48,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:19:48,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:19:48,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:19:48,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,300 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 8, 2]. 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, 2, 1]. [2024-01-29 14:19:48,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:19:48,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:19:48,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:19:48,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:19:48,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (1/1) ... [2024-01-29 14:19:48,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:19:48,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:19:48,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 14:19:48,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 14:19:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:19:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:19:48,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:19:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:19:48,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:19:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:19:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:19:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:19:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 14:19:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:19:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:19:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:19:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:19:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 14:19:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 14:19:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 14:19:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-29 14:19:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:19:48,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:19:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:19:48,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:19:48,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:19:48,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 14:19:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:19:48,412 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 14:19:48,495 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:19:48,497 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:19:49,147 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:19:49,147 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:19:49,355 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:19:49,356 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-29 14:19:49,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:19:49 BoogieIcfgContainer [2024-01-29 14:19:49,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:19:49,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:19:49,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:19:49,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:19:49,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:19:46" (1/4) ... [2024-01-29 14:19:49,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431e4fb3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:19:49, skipping insertion in model container [2024-01-29 14:19:49,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:19:47" (2/4) ... [2024-01-29 14:19:49,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431e4fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:19:49, skipping insertion in model container [2024-01-29 14:19:49,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:19:48" (3/4) ... [2024-01-29 14:19:49,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431e4fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:19:49, skipping insertion in model container [2024-01-29 14:19:49,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:19:49" (4/4) ... [2024-01-29 14:19:49,366 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-01-29 14:19:49,381 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:19:49,382 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 242 error locations. [2024-01-29 14:19:49,382 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:19:49,458 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 14:19:49,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 481 places, 479 transitions, 972 flow [2024-01-29 14:19:49,569 INFO L124 PetriNetUnfolderBase]: 5/477 cut-off events. [2024-01-29 14:19:49,569 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:19:49,574 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-29 14:19:49,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 481 places, 479 transitions, 972 flow [2024-01-29 14:19:49,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 478 places, 476 transitions, 964 flow [2024-01-29 14:19:49,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:19:49,605 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;@2622d719, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:19:49,606 INFO L358 AbstractCegarLoop]: Starting to check reachability of 292 error locations. [2024-01-29 14:19:49,608 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:19:49,608 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:19:49,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:19:49,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:49,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:19:49,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:49,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash 41820, now seen corresponding path program 1 times [2024-01-29 14:19:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:49,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955658813] [2024-01-29 14:19:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:49,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:49,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:49,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955658813] [2024-01-29 14:19:49,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955658813] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:49,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114271745] [2024-01-29 14:19:49,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:49,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:49,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:49,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:49,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 479 [2024-01-29 14:19:49,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 476 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:49,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:49,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 479 [2024-01-29 14:19:49,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:50,433 INFO L124 PetriNetUnfolderBase]: 877/2181 cut-off events. [2024-01-29 14:19:50,435 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-29 14:19:50,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3606 conditions, 2181 events. 877/2181 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 1367 conditions per place. [2024-01-29 14:19:50,446 INFO L140 encePairwiseOnDemand]: 452/479 looper letters, 63 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2024-01-29 14:19:50,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 451 transitions, 1044 flow [2024-01-29 14:19:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2024-01-29 14:19:50,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.872651356993737 [2024-01-29 14:19:50,460 INFO L175 Difference]: Start difference. First operand has 478 places, 476 transitions, 964 flow. Second operand 3 states and 1254 transitions. [2024-01-29 14:19:50,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 451 transitions, 1044 flow [2024-01-29 14:19:50,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 451 transitions, 1036 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:19:50,472 INFO L231 Difference]: Finished difference. Result has 451 places, 451 transitions, 910 flow [2024-01-29 14:19:50,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=451, PETRI_TRANSITIONS=451} [2024-01-29 14:19:50,477 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -27 predicate places. [2024-01-29 14:19:50,478 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 451 transitions, 910 flow [2024-01-29 14:19:50,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:50,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:50,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:19:50,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:19:50,479 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:50,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1297661, now seen corresponding path program 1 times [2024-01-29 14:19:50,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:50,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204378258] [2024-01-29 14:19:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:50,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:50,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204378258] [2024-01-29 14:19:50,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204378258] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:50,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:50,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:50,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42946219] [2024-01-29 14:19:50,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:50,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:50,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:50,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:50,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 479 [2024-01-29 14:19:50,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 451 transitions, 910 flow. Second operand has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:50,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:50,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 479 [2024-01-29 14:19:50,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:50,946 INFO L124 PetriNetUnfolderBase]: 877/2158 cut-off events. [2024-01-29 14:19:50,946 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 14:19:50,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3564 conditions, 2158 events. 877/2158 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13093 event pairs, 621 based on Foata normal form. 0/1286 useless extension candidates. Maximal degree in co-relation 3427. Up to 1351 conditions per place. [2024-01-29 14:19:50,956 INFO L140 encePairwiseOnDemand]: 454/479 looper letters, 74 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2024-01-29 14:19:50,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 428 transitions, 1016 flow [2024-01-29 14:19:50,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2024-01-29 14:19:50,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8183716075156576 [2024-01-29 14:19:50,959 INFO L175 Difference]: Start difference. First operand has 451 places, 451 transitions, 910 flow. Second operand 3 states and 1176 transitions. [2024-01-29 14:19:50,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 428 transitions, 1016 flow [2024-01-29 14:19:50,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 428 transitions, 1012 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:50,965 INFO L231 Difference]: Finished difference. Result has 428 places, 428 transitions, 864 flow [2024-01-29 14:19:50,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=428, PETRI_TRANSITIONS=428} [2024-01-29 14:19:50,966 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -50 predicate places. [2024-01-29 14:19:50,966 INFO L495 AbstractCegarLoop]: Abstraction has has 428 places, 428 transitions, 864 flow [2024-01-29 14:19:50,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:50,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:50,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 14:19:50,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:19:50,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:50,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:50,968 INFO L85 PathProgramCache]: Analyzing trace with hash 40228762, now seen corresponding path program 1 times [2024-01-29 14:19:50,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:50,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902975138] [2024-01-29 14:19:50,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:50,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:51,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:51,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902975138] [2024-01-29 14:19:51,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902975138] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:51,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:51,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:51,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573472937] [2024-01-29 14:19:51,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:51,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:51,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:51,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:51,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:51,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2024-01-29 14:19:51,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 428 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:51,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:51,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2024-01-29 14:19:51,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:51,416 INFO L124 PetriNetUnfolderBase]: 877/2137 cut-off events. [2024-01-29 14:19:51,416 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 14:19:51,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3547 conditions, 2137 events. 877/2137 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13081 event pairs, 621 based on Foata normal form. 0/1285 useless extension candidates. Maximal degree in co-relation 3172. Up to 1353 conditions per place. [2024-01-29 14:19:51,425 INFO L140 encePairwiseOnDemand]: 456/479 looper letters, 78 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2024-01-29 14:19:51,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 407 transitions, 982 flow [2024-01-29 14:19:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-01-29 14:19:51,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8155880306193458 [2024-01-29 14:19:51,428 INFO L175 Difference]: Start difference. First operand has 428 places, 428 transitions, 864 flow. Second operand 3 states and 1172 transitions. [2024-01-29 14:19:51,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 407 transitions, 982 flow [2024-01-29 14:19:51,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 407 transitions, 978 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:51,433 INFO L231 Difference]: Finished difference. Result has 407 places, 407 transitions, 822 flow [2024-01-29 14:19:51,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=407, PETRI_TRANSITIONS=407} [2024-01-29 14:19:51,434 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -71 predicate places. [2024-01-29 14:19:51,434 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 407 transitions, 822 flow [2024-01-29 14:19:51,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:51,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:51,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 14:19:51,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:19:51,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:51,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1247093008, now seen corresponding path program 1 times [2024-01-29 14:19:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:51,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891856268] [2024-01-29 14:19:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:51,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:51,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891856268] [2024-01-29 14:19:51,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891856268] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:51,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:51,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:51,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19211482] [2024-01-29 14:19:51,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:51,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:51,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:51,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:51,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 479 [2024-01-29 14:19:51,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 407 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 348.6666666666667) internal successors, (1046), 3 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:51,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:51,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 479 [2024-01-29 14:19:51,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:51,873 INFO L124 PetriNetUnfolderBase]: 1022/2475 cut-off events. [2024-01-29 14:19:51,873 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-29 14:19:51,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4208 conditions, 2475 events. 1022/2475 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16373 event pairs, 387 based on Foata normal form. 0/1569 useless extension candidates. Maximal degree in co-relation 3873. Up to 907 conditions per place. [2024-01-29 14:19:51,883 INFO L140 encePairwiseOnDemand]: 452/479 looper letters, 108 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2024-01-29 14:19:51,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 407 transitions, 1044 flow [2024-01-29 14:19:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1179 transitions. [2024-01-29 14:19:51,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8204592901878914 [2024-01-29 14:19:51,886 INFO L175 Difference]: Start difference. First operand has 407 places, 407 transitions, 822 flow. Second operand 3 states and 1179 transitions. [2024-01-29 14:19:51,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 407 transitions, 1044 flow [2024-01-29 14:19:51,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 407 transitions, 1040 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:51,891 INFO L231 Difference]: Finished difference. Result has 383 places, 383 transitions, 778 flow [2024-01-29 14:19:51,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=383, PETRI_TRANSITIONS=383} [2024-01-29 14:19:51,893 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -95 predicate places. [2024-01-29 14:19:51,893 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 383 transitions, 778 flow [2024-01-29 14:19:51,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.6666666666667) internal successors, (1046), 3 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:51,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:51,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:19:51,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:19:51,894 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:51,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash 5179134, now seen corresponding path program 1 times [2024-01-29 14:19:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:51,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347044051] [2024-01-29 14:19:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:51,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:51,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:51,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347044051] [2024-01-29 14:19:51,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347044051] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:51,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:51,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:51,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388980359] [2024-01-29 14:19:51,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:51,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:51,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:51,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:51,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:51,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 479 [2024-01-29 14:19:51,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 383 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:51,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:51,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 479 [2024-01-29 14:19:51,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:52,386 INFO L124 PetriNetUnfolderBase]: 1022/2467 cut-off events. [2024-01-29 14:19:52,387 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-01-29 14:19:52,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4281 conditions, 2467 events. 1022/2467 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16402 event pairs, 855 based on Foata normal form. 1/1616 useless extension candidates. Maximal degree in co-relation 2104. Up to 1711 conditions per place. [2024-01-29 14:19:52,396 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 81 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2024-01-29 14:19:52,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 382 transitions, 942 flow [2024-01-29 14:19:52,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2024-01-29 14:19:52,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8406402226861517 [2024-01-29 14:19:52,399 INFO L175 Difference]: Start difference. First operand has 383 places, 383 transitions, 778 flow. Second operand 3 states and 1208 transitions. [2024-01-29 14:19:52,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 382 transitions, 942 flow [2024-01-29 14:19:52,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 382 transitions, 940 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:19:52,404 INFO L231 Difference]: Finished difference. Result has 383 places, 382 transitions, 778 flow [2024-01-29 14:19:52,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=383, PETRI_TRANSITIONS=382} [2024-01-29 14:19:52,406 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -95 predicate places. [2024-01-29 14:19:52,406 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 382 transitions, 778 flow [2024-01-29 14:19:52,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:52,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:52,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:52,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:19:52,407 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:52,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash 160554789, now seen corresponding path program 1 times [2024-01-29 14:19:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968898282] [2024-01-29 14:19:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:52,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:52,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968898282] [2024-01-29 14:19:52,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968898282] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:52,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:52,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925540204] [2024-01-29 14:19:52,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:52,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:52,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:52,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:52,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:52,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 479 [2024-01-29 14:19:52,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 382 transitions, 778 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-29 14:19:52,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:52,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 479 [2024-01-29 14:19:52,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:52,770 INFO L124 PetriNetUnfolderBase]: 1022/2465 cut-off events. [2024-01-29 14:19:52,770 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-01-29 14:19:52,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4233 conditions, 2465 events. 1022/2465 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16413 event pairs, 855 based on Foata normal form. 0/1593 useless extension candidates. Maximal degree in co-relation 4198. Up to 1688 conditions per place. [2024-01-29 14:19:52,783 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 61 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2024-01-29 14:19:52,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 380 transitions, 900 flow [2024-01-29 14:19:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2024-01-29 14:19:52,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8670842032011135 [2024-01-29 14:19:52,786 INFO L175 Difference]: Start difference. First operand has 383 places, 382 transitions, 778 flow. Second operand 3 states and 1246 transitions. [2024-01-29 14:19:52,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 380 transitions, 900 flow [2024-01-29 14:19:52,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 380 transitions, 896 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:52,791 INFO L231 Difference]: Finished difference. Result has 381 places, 380 transitions, 774 flow [2024-01-29 14:19:52,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=381, PETRI_TRANSITIONS=380} [2024-01-29 14:19:52,792 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -97 predicate places. [2024-01-29 14:19:52,793 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 380 transitions, 774 flow [2024-01-29 14:19:52,793 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-29 14:19:52,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:52,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:52,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:19:52,794 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:52,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash 682232509, now seen corresponding path program 1 times [2024-01-29 14:19:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:52,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471925875] [2024-01-29 14:19:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:52,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471925875] [2024-01-29 14:19:52,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471925875] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:52,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:52,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:52,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197471582] [2024-01-29 14:19:52,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:52,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:52,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:52,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:52,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:52,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 479 [2024-01-29 14:19:52,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 380 transitions, 774 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-29 14:19:52,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:52,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 479 [2024-01-29 14:19:52,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:53,109 INFO L124 PetriNetUnfolderBase]: 1022/2459 cut-off events. [2024-01-29 14:19:53,110 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-01-29 14:19:53,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4230 conditions, 2459 events. 1022/2459 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16430 event pairs, 855 based on Foata normal form. 0/1592 useless extension candidates. Maximal degree in co-relation 4170. Up to 1678 conditions per place. [2024-01-29 14:19:53,122 INFO L140 encePairwiseOnDemand]: 471/479 looper letters, 64 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2024-01-29 14:19:53,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 374 transitions, 894 flow [2024-01-29 14:19:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1232 transitions. [2024-01-29 14:19:53,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8573416840640222 [2024-01-29 14:19:53,124 INFO L175 Difference]: Start difference. First operand has 381 places, 380 transitions, 774 flow. Second operand 3 states and 1232 transitions. [2024-01-29 14:19:53,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 374 transitions, 894 flow [2024-01-29 14:19:53,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 374 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:53,129 INFO L231 Difference]: Finished difference. Result has 375 places, 374 transitions, 762 flow [2024-01-29 14:19:53,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=375, PETRI_TRANSITIONS=374} [2024-01-29 14:19:53,130 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -103 predicate places. [2024-01-29 14:19:53,130 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 374 transitions, 762 flow [2024-01-29 14:19:53,131 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-29 14:19:53,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:53,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:53,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:19:53,132 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:53,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:53,132 INFO L85 PathProgramCache]: Analyzing trace with hash -325627256, now seen corresponding path program 1 times [2024-01-29 14:19:53,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:53,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145557179] [2024-01-29 14:19:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:53,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:53,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145557179] [2024-01-29 14:19:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145557179] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:53,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:53,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337890973] [2024-01-29 14:19:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:53,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:53,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 479 [2024-01-29 14:19:53,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 374 transitions, 762 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-29 14:19:53,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:53,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 479 [2024-01-29 14:19:53,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:53,513 INFO L124 PetriNetUnfolderBase]: 1022/2439 cut-off events. [2024-01-29 14:19:53,514 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-01-29 14:19:53,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4205 conditions, 2439 events. 1022/2439 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16364 event pairs, 855 based on Foata normal form. 17/1606 useless extension candidates. Maximal degree in co-relation 4013. Up to 1686 conditions per place. [2024-01-29 14:19:53,522 INFO L140 encePairwiseOnDemand]: 457/479 looper letters, 59 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2024-01-29 14:19:53,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 354 transitions, 844 flow [2024-01-29 14:19:53,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions. [2024-01-29 14:19:53,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8343771746694503 [2024-01-29 14:19:53,525 INFO L175 Difference]: Start difference. First operand has 375 places, 374 transitions, 762 flow. Second operand 3 states and 1199 transitions. [2024-01-29 14:19:53,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 354 transitions, 844 flow [2024-01-29 14:19:53,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 354 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:53,529 INFO L231 Difference]: Finished difference. Result has 355 places, 354 transitions, 722 flow [2024-01-29 14:19:53,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=355, PETRI_TRANSITIONS=354} [2024-01-29 14:19:53,530 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -123 predicate places. [2024-01-29 14:19:53,530 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 354 transitions, 722 flow [2024-01-29 14:19:53,531 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-29 14:19:53,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:53,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:53,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:19:53,532 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:53,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1570968431, now seen corresponding path program 1 times [2024-01-29 14:19:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:53,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498360577] [2024-01-29 14:19:53,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:53,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:53,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498360577] [2024-01-29 14:19:53,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498360577] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:53,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:53,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:53,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282141783] [2024-01-29 14:19:53,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:53,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:53,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:53,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:53,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:53,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 479 [2024-01-29 14:19:53,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 354 transitions, 722 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-29 14:19:53,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:53,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 479 [2024-01-29 14:19:53,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:53,824 INFO L124 PetriNetUnfolderBase]: 1022/2415 cut-off events. [2024-01-29 14:19:53,824 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-01-29 14:19:53,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4203 conditions, 2415 events. 1022/2415 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16248 event pairs, 855 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 4119. Up to 1668 conditions per place. [2024-01-29 14:19:53,835 INFO L140 encePairwiseOnDemand]: 453/479 looper letters, 81 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2024-01-29 14:19:53,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 330 transitions, 840 flow [2024-01-29 14:19:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1162 transitions. [2024-01-29 14:19:53,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8086290883785665 [2024-01-29 14:19:53,838 INFO L175 Difference]: Start difference. First operand has 355 places, 354 transitions, 722 flow. Second operand 3 states and 1162 transitions. [2024-01-29 14:19:53,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 330 transitions, 840 flow [2024-01-29 14:19:53,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 330 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:53,842 INFO L231 Difference]: Finished difference. Result has 331 places, 330 transitions, 674 flow [2024-01-29 14:19:53,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=331, PETRI_TRANSITIONS=330} [2024-01-29 14:19:53,843 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -147 predicate places. [2024-01-29 14:19:53,843 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 330 transitions, 674 flow [2024-01-29 14:19:53,844 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-29 14:19:53,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:53,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:53,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:19:53,845 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:53,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash -2127784079, now seen corresponding path program 1 times [2024-01-29 14:19:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:53,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856578782] [2024-01-29 14:19:53,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:53,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:53,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:53,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856578782] [2024-01-29 14:19:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856578782] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:53,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:53,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:53,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668001099] [2024-01-29 14:19:53,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:53,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:53,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:53,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:53,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 392 out of 479 [2024-01-29 14:19:53,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 330 transitions, 674 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-29 14:19:53,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:53,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 392 of 479 [2024-01-29 14:19:53,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:54,150 INFO L124 PetriNetUnfolderBase]: 1022/2412 cut-off events. [2024-01-29 14:19:54,150 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-01-29 14:19:54,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4181 conditions, 2412 events. 1022/2412 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16298 event pairs, 855 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 3892. Up to 1687 conditions per place. [2024-01-29 14:19:54,159 INFO L140 encePairwiseOnDemand]: 474/479 looper letters, 62 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2024-01-29 14:19:54,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 327 transitions, 796 flow [2024-01-29 14:19:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-01-29 14:19:54,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8643006263048016 [2024-01-29 14:19:54,162 INFO L175 Difference]: Start difference. First operand has 331 places, 330 transitions, 674 flow. Second operand 3 states and 1242 transitions. [2024-01-29 14:19:54,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 327 transitions, 796 flow [2024-01-29 14:19:54,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 327 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:54,166 INFO L231 Difference]: Finished difference. Result has 328 places, 327 transitions, 668 flow [2024-01-29 14:19:54,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=328, PETRI_TRANSITIONS=327} [2024-01-29 14:19:54,168 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -150 predicate places. [2024-01-29 14:19:54,169 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 327 transitions, 668 flow [2024-01-29 14:19:54,169 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-29 14:19:54,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:54,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:54,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:19:54,170 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:54,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash -396015443, now seen corresponding path program 1 times [2024-01-29 14:19:54,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:54,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087842706] [2024-01-29 14:19:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:54,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:54,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:54,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087842706] [2024-01-29 14:19:54,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087842706] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:54,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:54,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:19:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605011114] [2024-01-29 14:19:54,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:54,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:54,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:54,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:54,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:54,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 479 [2024-01-29 14:19:54,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 327 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:54,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:54,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 479 [2024-01-29 14:19:54,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:54,588 INFO L124 PetriNetUnfolderBase]: 1543/3521 cut-off events. [2024-01-29 14:19:54,589 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-01-29 14:19:54,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6248 conditions, 3521 events. 1543/3521 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 26727 event pairs, 633 based on Foata normal form. 2/2392 useless extension candidates. Maximal degree in co-relation 6188. Up to 1545 conditions per place. [2024-01-29 14:19:54,603 INFO L140 encePairwiseOnDemand]: 451/479 looper letters, 106 selfloop transitions, 2 changer transitions 0/337 dead transitions. [2024-01-29 14:19:54,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 337 transitions, 911 flow [2024-01-29 14:19:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1215 transitions. [2024-01-29 14:19:54,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8455114822546973 [2024-01-29 14:19:54,606 INFO L175 Difference]: Start difference. First operand has 328 places, 327 transitions, 668 flow. Second operand 3 states and 1215 transitions. [2024-01-29 14:19:54,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 337 transitions, 911 flow [2024-01-29 14:19:54,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 337 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:54,610 INFO L231 Difference]: Finished difference. Result has 308 places, 307 transitions, 642 flow [2024-01-29 14:19:54,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=308, PETRI_TRANSITIONS=307} [2024-01-29 14:19:54,611 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -170 predicate places. [2024-01-29 14:19:54,611 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 307 transitions, 642 flow [2024-01-29 14:19:54,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:54,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:54,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:54,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 14:19:54,612 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:54,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:54,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1625073099, now seen corresponding path program 1 times [2024-01-29 14:19:54,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:54,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273697240] [2024-01-29 14:19:54,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:54,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:54,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:54,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273697240] [2024-01-29 14:19:54,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273697240] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:54,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:54,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:19:54,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817609599] [2024-01-29 14:19:54,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:54,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:54,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:54,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:54,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:54,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 479 [2024-01-29 14:19:54,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 307 transitions, 642 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-29 14:19:54,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:54,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 479 [2024-01-29 14:19:54,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:55,091 INFO L124 PetriNetUnfolderBase]: 1617/3685 cut-off events. [2024-01-29 14:19:55,092 INFO L125 PetriNetUnfolderBase]: For 335/345 co-relation queries the response was YES. [2024-01-29 14:19:55,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6845 conditions, 3685 events. 1617/3685 cut-off events. For 335/345 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 27993 event pairs, 679 based on Foata normal form. 24/2802 useless extension candidates. Maximal degree in co-relation 2999. Up to 1407 conditions per place. [2024-01-29 14:19:55,105 INFO L140 encePairwiseOnDemand]: 452/479 looper letters, 85 selfloop transitions, 2 changer transitions 1/308 dead transitions. [2024-01-29 14:19:55,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 308 transitions, 833 flow [2024-01-29 14:19:55,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2024-01-29 14:19:55,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8559498956158664 [2024-01-29 14:19:55,108 INFO L175 Difference]: Start difference. First operand has 308 places, 307 transitions, 642 flow. Second operand 3 states and 1230 transitions. [2024-01-29 14:19:55,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 308 transitions, 833 flow [2024-01-29 14:19:55,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 308 transitions, 830 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:19:55,113 INFO L231 Difference]: Finished difference. Result has 286 places, 284 transitions, 604 flow [2024-01-29 14:19:55,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=286, PETRI_TRANSITIONS=284} [2024-01-29 14:19:55,114 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -192 predicate places. [2024-01-29 14:19:55,114 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 284 transitions, 604 flow [2024-01-29 14:19:55,114 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-29 14:19:55,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:55,115 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] [2024-01-29 14:19:55,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 14:19:55,115 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:55,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:55,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1486798331, now seen corresponding path program 1 times [2024-01-29 14:19:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:55,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999945566] [2024-01-29 14:19:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:55,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:55,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:55,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999945566] [2024-01-29 14:19:55,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999945566] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:55,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:55,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:19:55,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629498428] [2024-01-29 14:19:55,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:55,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:19:55,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:55,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:19:55,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:19:55,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 479 [2024-01-29 14:19:55,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 284 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:55,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:55,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 479 [2024-01-29 14:19:55,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:55,613 INFO L124 PetriNetUnfolderBase]: 1617/3677 cut-off events. [2024-01-29 14:19:55,613 INFO L125 PetriNetUnfolderBase]: For 383/393 co-relation queries the response was YES. [2024-01-29 14:19:55,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6952 conditions, 3677 events. 1617/3677 cut-off events. For 383/393 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 28030 event pairs, 1431 based on Foata normal form. 4/2780 useless extension candidates. Maximal degree in co-relation 3297. Up to 2706 conditions per place. [2024-01-29 14:19:55,630 INFO L140 encePairwiseOnDemand]: 463/479 looper letters, 63 selfloop transitions, 8 changer transitions 0/276 dead transitions. [2024-01-29 14:19:55,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 276 transitions, 730 flow [2024-01-29 14:19:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:19:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:19:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2024-01-29 14:19:55,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8503827418232429 [2024-01-29 14:19:55,633 INFO L175 Difference]: Start difference. First operand has 286 places, 284 transitions, 604 flow. Second operand 3 states and 1222 transitions. [2024-01-29 14:19:55,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 276 transitions, 730 flow [2024-01-29 14:19:55,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 276 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:19:55,638 INFO L231 Difference]: Finished difference. Result has 279 places, 276 transitions, 602 flow [2024-01-29 14:19:55,638 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=279, PETRI_TRANSITIONS=276} [2024-01-29 14:19:55,639 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -199 predicate places. [2024-01-29 14:19:55,639 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 276 transitions, 602 flow [2024-01-29 14:19:55,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:55,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:55,640 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] [2024-01-29 14:19:55,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 14:19:55,640 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:55,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1797449672, now seen corresponding path program 1 times [2024-01-29 14:19:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:55,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323623306] [2024-01-29 14:19:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:55,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:55,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:55,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323623306] [2024-01-29 14:19:55,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323623306] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:55,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:55,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:19:55,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406425714] [2024-01-29 14:19:55,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:55,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:19:55,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:55,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:19:55,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:19:55,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 479 [2024-01-29 14:19:55,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 276 transitions, 602 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-29 14:19:55,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:55,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 479 [2024-01-29 14:19:55,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:56,220 INFO L124 PetriNetUnfolderBase]: 1617/3677 cut-off events. [2024-01-29 14:19:56,221 INFO L125 PetriNetUnfolderBase]: For 389/399 co-relation queries the response was YES. [2024-01-29 14:19:56,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6918 conditions, 3677 events. 1617/3677 cut-off events. For 389/399 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 28023 event pairs, 1431 based on Foata normal form. 4/2786 useless extension candidates. Maximal degree in co-relation 6686. Up to 2702 conditions per place. [2024-01-29 14:19:56,238 INFO L140 encePairwiseOnDemand]: 467/479 looper letters, 67 selfloop transitions, 10 changer transitions 0/276 dead transitions. [2024-01-29 14:19:56,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 276 transitions, 756 flow [2024-01-29 14:19:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:19:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:19:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1958 transitions. [2024-01-29 14:19:56,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8175365344467641 [2024-01-29 14:19:56,242 INFO L175 Difference]: Start difference. First operand has 279 places, 276 transitions, 602 flow. Second operand 5 states and 1958 transitions. [2024-01-29 14:19:56,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 276 transitions, 756 flow [2024-01-29 14:19:56,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 276 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:19:56,247 INFO L231 Difference]: Finished difference. Result has 280 places, 276 transitions, 616 flow [2024-01-29 14:19:56,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=275, 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=616, PETRI_PLACES=280, PETRI_TRANSITIONS=276} [2024-01-29 14:19:56,247 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -198 predicate places. [2024-01-29 14:19:56,248 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 276 transitions, 616 flow [2024-01-29 14:19:56,249 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-29 14:19:56,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:56,249 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-29 14:19:56,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 14:19:56,249 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:56,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:56,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2022470425, now seen corresponding path program 1 times [2024-01-29 14:19:56,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:56,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578105723] [2024-01-29 14:19:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:56,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:56,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:56,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578105723] [2024-01-29 14:19:56,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578105723] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:56,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:56,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:19:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737447725] [2024-01-29 14:19:56,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:56,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 14:19:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 14:19:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 14:19:56,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 479 [2024-01-29 14:19:56,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 276 transitions, 616 flow. Second operand has 5 states, 5 states have (on average 333.6) internal successors, (1668), 5 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:56,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:56,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 479 [2024-01-29 14:19:56,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:56,849 INFO L124 PetriNetUnfolderBase]: 1617/3647 cut-off events. [2024-01-29 14:19:56,849 INFO L125 PetriNetUnfolderBase]: For 394/406 co-relation queries the response was YES. [2024-01-29 14:19:56,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6919 conditions, 3647 events. 1617/3647 cut-off events. For 394/406 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 28166 event pairs, 663 based on Foata normal form. 3/2769 useless extension candidates. Maximal degree in co-relation 6661. Up to 1612 conditions per place. [2024-01-29 14:19:56,862 INFO L140 encePairwiseOnDemand]: 461/479 looper letters, 114 selfloop transitions, 16 changer transitions 0/305 dead transitions. [2024-01-29 14:19:56,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 305 transitions, 947 flow [2024-01-29 14:19:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 14:19:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 14:19:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2102 transitions. [2024-01-29 14:19:56,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313848295059151 [2024-01-29 14:19:56,866 INFO L175 Difference]: Start difference. First operand has 280 places, 276 transitions, 616 flow. Second operand 6 states and 2102 transitions. [2024-01-29 14:19:56,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 305 transitions, 947 flow [2024-01-29 14:19:56,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 305 transitions, 933 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 14:19:56,870 INFO L231 Difference]: Finished difference. Result has 280 places, 274 transitions, 630 flow [2024-01-29 14:19:56,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=280, PETRI_TRANSITIONS=274} [2024-01-29 14:19:56,871 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -198 predicate places. [2024-01-29 14:19:56,871 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 274 transitions, 630 flow [2024-01-29 14:19:56,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 333.6) internal successors, (1668), 5 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:56,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:56,873 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] [2024-01-29 14:19:56,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 14:19:56,873 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:56,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1807703348, now seen corresponding path program 1 times [2024-01-29 14:19:56,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:56,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115165969] [2024-01-29 14:19:56,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:56,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:19:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:56,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:19:56,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115165969] [2024-01-29 14:19:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115165969] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:19:56,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:19:56,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:19:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182306106] [2024-01-29 14:19:56,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:19:56,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 14:19:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 14:19:56,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 14:19:57,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 479 [2024-01-29 14:19:57,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 274 transitions, 630 flow. Second operand has 5 states, 5 states have (on average 373.0) internal successors, (1865), 5 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:57,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:19:57,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 479 [2024-01-29 14:19:57,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:19:57,394 INFO L124 PetriNetUnfolderBase]: 1617/3671 cut-off events. [2024-01-29 14:19:57,394 INFO L125 PetriNetUnfolderBase]: For 481/491 co-relation queries the response was YES. [2024-01-29 14:19:57,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6966 conditions, 3671 events. 1617/3671 cut-off events. For 481/491 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 27938 event pairs, 1431 based on Foata normal form. 2/2780 useless extension candidates. Maximal degree in co-relation 6726. Up to 2696 conditions per place. [2024-01-29 14:19:57,408 INFO L140 encePairwiseOnDemand]: 461/479 looper letters, 63 selfloop transitions, 16 changer transitions 0/270 dead transitions. [2024-01-29 14:19:57,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 270 transitions, 772 flow [2024-01-29 14:19:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:19:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:19:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1928 transitions. [2024-01-29 14:19:57,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8050104384133612 [2024-01-29 14:19:57,412 INFO L175 Difference]: Start difference. First operand has 280 places, 274 transitions, 630 flow. Second operand 5 states and 1928 transitions. [2024-01-29 14:19:57,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 270 transitions, 772 flow [2024-01-29 14:19:57,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 270 transitions, 756 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:19:57,416 INFO L231 Difference]: Finished difference. Result has 275 places, 270 transitions, 630 flow [2024-01-29 14:19:57,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=630, PETRI_PLACES=275, PETRI_TRANSITIONS=270} [2024-01-29 14:19:57,417 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -203 predicate places. [2024-01-29 14:19:57,417 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 270 transitions, 630 flow [2024-01-29 14:19:57,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 373.0) internal successors, (1865), 5 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:19:57,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:19:57,418 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] [2024-01-29 14:19:57,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 14:19:57,418 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 14:19:57,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:19:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1305649977, now seen corresponding path program 1 times [2024-01-29 14:19:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:19:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107064257] [2024-01-29 14:19:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:19:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:19:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:19:57,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:19:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:19:57,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:19:57,467 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:19:57,468 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (291 of 292 remaining) [2024-01-29 14:19:57,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (290 of 292 remaining) [2024-01-29 14:19:57,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (289 of 292 remaining) [2024-01-29 14:19:57,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (288 of 292 remaining) [2024-01-29 14:19:57,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (287 of 292 remaining) [2024-01-29 14:19:57,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (286 of 292 remaining) [2024-01-29 14:19:57,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (285 of 292 remaining) [2024-01-29 14:19:57,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (284 of 292 remaining) [2024-01-29 14:19:57,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (283 of 292 remaining) [2024-01-29 14:19:57,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (282 of 292 remaining) [2024-01-29 14:19:57,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (281 of 292 remaining) [2024-01-29 14:19:57,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (280 of 292 remaining) [2024-01-29 14:19:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (279 of 292 remaining) [2024-01-29 14:19:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (278 of 292 remaining) [2024-01-29 14:19:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (277 of 292 remaining) [2024-01-29 14:19:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (276 of 292 remaining) [2024-01-29 14:19:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (275 of 292 remaining) [2024-01-29 14:19:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (274 of 292 remaining) [2024-01-29 14:19:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (273 of 292 remaining) [2024-01-29 14:19:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (272 of 292 remaining) [2024-01-29 14:19:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (271 of 292 remaining) [2024-01-29 14:19:57,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (270 of 292 remaining) [2024-01-29 14:19:57,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (269 of 292 remaining) [2024-01-29 14:19:57,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (268 of 292 remaining) [2024-01-29 14:19:57,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (267 of 292 remaining) [2024-01-29 14:19:57,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (266 of 292 remaining) [2024-01-29 14:19:57,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (265 of 292 remaining) [2024-01-29 14:19:57,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (264 of 292 remaining) [2024-01-29 14:19:57,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (263 of 292 remaining) [2024-01-29 14:19:57,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (262 of 292 remaining) [2024-01-29 14:19:57,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (261 of 292 remaining) [2024-01-29 14:19:57,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (260 of 292 remaining) [2024-01-29 14:19:57,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (259 of 292 remaining) [2024-01-29 14:19:57,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (258 of 292 remaining) [2024-01-29 14:19:57,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (257 of 292 remaining) [2024-01-29 14:19:57,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (256 of 292 remaining) [2024-01-29 14:19:57,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (255 of 292 remaining) [2024-01-29 14:19:57,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (254 of 292 remaining) [2024-01-29 14:19:57,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (253 of 292 remaining) [2024-01-29 14:19:57,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (252 of 292 remaining) [2024-01-29 14:19:57,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (251 of 292 remaining) [2024-01-29 14:19:57,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (250 of 292 remaining) [2024-01-29 14:19:57,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (249 of 292 remaining) [2024-01-29 14:19:57,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (248 of 292 remaining) [2024-01-29 14:19:57,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (247 of 292 remaining) [2024-01-29 14:19:57,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (246 of 292 remaining) [2024-01-29 14:19:57,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (245 of 292 remaining) [2024-01-29 14:19:57,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (244 of 292 remaining) [2024-01-29 14:19:57,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (243 of 292 remaining) [2024-01-29 14:19:57,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (242 of 292 remaining) [2024-01-29 14:19:57,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (241 of 292 remaining) [2024-01-29 14:19:57,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (240 of 292 remaining) [2024-01-29 14:19:57,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (239 of 292 remaining) [2024-01-29 14:19:57,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (238 of 292 remaining) [2024-01-29 14:19:57,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (237 of 292 remaining) [2024-01-29 14:19:57,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (236 of 292 remaining) [2024-01-29 14:19:57,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (235 of 292 remaining) [2024-01-29 14:19:57,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (234 of 292 remaining) [2024-01-29 14:19:57,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (233 of 292 remaining) [2024-01-29 14:19:57,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (232 of 292 remaining) [2024-01-29 14:19:57,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (231 of 292 remaining) [2024-01-29 14:19:57,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (230 of 292 remaining) [2024-01-29 14:19:57,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (229 of 292 remaining) [2024-01-29 14:19:57,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (228 of 292 remaining) [2024-01-29 14:19:57,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (227 of 292 remaining) [2024-01-29 14:19:57,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (226 of 292 remaining) [2024-01-29 14:19:57,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (225 of 292 remaining) [2024-01-29 14:19:57,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (224 of 292 remaining) [2024-01-29 14:19:57,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (223 of 292 remaining) [2024-01-29 14:19:57,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 292 remaining) [2024-01-29 14:19:57,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 292 remaining) [2024-01-29 14:19:57,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 292 remaining) [2024-01-29 14:19:57,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 292 remaining) [2024-01-29 14:19:57,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 292 remaining) [2024-01-29 14:19:57,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 292 remaining) [2024-01-29 14:19:57,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 292 remaining) [2024-01-29 14:19:57,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 292 remaining) [2024-01-29 14:19:57,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 292 remaining) [2024-01-29 14:19:57,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 292 remaining) [2024-01-29 14:19:57,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 292 remaining) [2024-01-29 14:19:57,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 292 remaining) [2024-01-29 14:19:57,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 292 remaining) [2024-01-29 14:19:57,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 292 remaining) [2024-01-29 14:19:57,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 292 remaining) [2024-01-29 14:19:57,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 292 remaining) [2024-01-29 14:19:57,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 292 remaining) [2024-01-29 14:19:57,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 292 remaining) [2024-01-29 14:19:57,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (204 of 292 remaining) [2024-01-29 14:19:57,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (203 of 292 remaining) [2024-01-29 14:19:57,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 292 remaining) [2024-01-29 14:19:57,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 292 remaining) [2024-01-29 14:19:57,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 292 remaining) [2024-01-29 14:19:57,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 292 remaining) [2024-01-29 14:19:57,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 292 remaining) [2024-01-29 14:19:57,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 292 remaining) [2024-01-29 14:19:57,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 292 remaining) [2024-01-29 14:19:57,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 292 remaining) [2024-01-29 14:19:57,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 292 remaining) [2024-01-29 14:19:57,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 292 remaining) [2024-01-29 14:19:57,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 292 remaining) [2024-01-29 14:19:57,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 292 remaining) [2024-01-29 14:19:57,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 292 remaining) [2024-01-29 14:19:57,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 292 remaining) [2024-01-29 14:19:57,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 292 remaining) [2024-01-29 14:19:57,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 292 remaining) [2024-01-29 14:19:57,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 292 remaining) [2024-01-29 14:19:57,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 292 remaining) [2024-01-29 14:19:57,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 292 remaining) [2024-01-29 14:19:57,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 292 remaining) [2024-01-29 14:19:57,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 292 remaining) [2024-01-29 14:19:57,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 292 remaining) [2024-01-29 14:19:57,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 292 remaining) [2024-01-29 14:19:57,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 292 remaining) [2024-01-29 14:19:57,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 292 remaining) [2024-01-29 14:19:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 292 remaining) [2024-01-29 14:19:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 292 remaining) [2024-01-29 14:19:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 292 remaining) [2024-01-29 14:19:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 292 remaining) [2024-01-29 14:19:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 292 remaining) [2024-01-29 14:19:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 292 remaining) [2024-01-29 14:19:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 292 remaining) [2024-01-29 14:19:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 292 remaining) [2024-01-29 14:19:57,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 292 remaining) [2024-01-29 14:19:57,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 292 remaining) [2024-01-29 14:19:57,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 292 remaining) [2024-01-29 14:19:57,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 292 remaining) [2024-01-29 14:19:57,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 292 remaining) [2024-01-29 14:19:57,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 292 remaining) [2024-01-29 14:19:57,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 292 remaining) [2024-01-29 14:19:57,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 292 remaining) [2024-01-29 14:19:57,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 292 remaining) [2024-01-29 14:19:57,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 292 remaining) [2024-01-29 14:19:57,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 292 remaining) [2024-01-29 14:19:57,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 292 remaining) [2024-01-29 14:19:57,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 292 remaining) [2024-01-29 14:19:57,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 292 remaining) [2024-01-29 14:19:57,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 292 remaining) [2024-01-29 14:19:57,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 292 remaining) [2024-01-29 14:19:57,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 292 remaining) [2024-01-29 14:19:57,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 292 remaining) [2024-01-29 14:19:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 292 remaining) [2024-01-29 14:19:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 292 remaining) [2024-01-29 14:19:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 292 remaining) [2024-01-29 14:19:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 292 remaining) [2024-01-29 14:19:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 292 remaining) [2024-01-29 14:19:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 292 remaining) [2024-01-29 14:19:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 292 remaining) [2024-01-29 14:19:57,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 292 remaining) [2024-01-29 14:19:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 292 remaining) [2024-01-29 14:19:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 292 remaining) [2024-01-29 14:19:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 292 remaining) [2024-01-29 14:19:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 292 remaining) [2024-01-29 14:19:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 292 remaining) [2024-01-29 14:19:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 292 remaining) [2024-01-29 14:19:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 292 remaining) [2024-01-29 14:19:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 292 remaining) [2024-01-29 14:19:57,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 292 remaining) [2024-01-29 14:19:57,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 292 remaining) [2024-01-29 14:19:57,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 292 remaining) [2024-01-29 14:19:57,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 292 remaining) [2024-01-29 14:19:57,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 292 remaining) [2024-01-29 14:19:57,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 292 remaining) [2024-01-29 14:19:57,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 292 remaining) [2024-01-29 14:19:57,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 292 remaining) [2024-01-29 14:19:57,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 292 remaining) [2024-01-29 14:19:57,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 292 remaining) [2024-01-29 14:19:57,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 292 remaining) [2024-01-29 14:19:57,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 292 remaining) [2024-01-29 14:19:57,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 292 remaining) [2024-01-29 14:19:57,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 292 remaining) [2024-01-29 14:19:57,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 292 remaining) [2024-01-29 14:19:57,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 292 remaining) [2024-01-29 14:19:57,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 292 remaining) [2024-01-29 14:19:57,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 292 remaining) [2024-01-29 14:19:57,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 292 remaining) [2024-01-29 14:19:57,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 292 remaining) [2024-01-29 14:19:57,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 292 remaining) [2024-01-29 14:19:57,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 292 remaining) [2024-01-29 14:19:57,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 292 remaining) [2024-01-29 14:19:57,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 292 remaining) [2024-01-29 14:19:57,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 292 remaining) [2024-01-29 14:19:57,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 292 remaining) [2024-01-29 14:19:57,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 292 remaining) [2024-01-29 14:19:57,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 292 remaining) [2024-01-29 14:19:57,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 292 remaining) [2024-01-29 14:19:57,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 292 remaining) [2024-01-29 14:19:57,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 292 remaining) [2024-01-29 14:19:57,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 292 remaining) [2024-01-29 14:19:57,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 292 remaining) [2024-01-29 14:19:57,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 292 remaining) [2024-01-29 14:19:57,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 292 remaining) [2024-01-29 14:19:57,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 292 remaining) [2024-01-29 14:19:57,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 292 remaining) [2024-01-29 14:19:57,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 292 remaining) [2024-01-29 14:19:57,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 292 remaining) [2024-01-29 14:19:57,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 292 remaining) [2024-01-29 14:19:57,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 292 remaining) [2024-01-29 14:19:57,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 292 remaining) [2024-01-29 14:19:57,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 292 remaining) [2024-01-29 14:19:57,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 292 remaining) [2024-01-29 14:19:57,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 292 remaining) [2024-01-29 14:19:57,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 292 remaining) [2024-01-29 14:19:57,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 292 remaining) [2024-01-29 14:19:57,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 292 remaining) [2024-01-29 14:19:57,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 292 remaining) [2024-01-29 14:19:57,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 292 remaining) [2024-01-29 14:19:57,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 292 remaining) [2024-01-29 14:19:57,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 292 remaining) [2024-01-29 14:19:57,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 292 remaining) [2024-01-29 14:19:57,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 292 remaining) [2024-01-29 14:19:57,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 292 remaining) [2024-01-29 14:19:57,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 292 remaining) [2024-01-29 14:19:57,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 292 remaining) [2024-01-29 14:19:57,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 292 remaining) [2024-01-29 14:19:57,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 292 remaining) [2024-01-29 14:19:57,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 292 remaining) [2024-01-29 14:19:57,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 292 remaining) [2024-01-29 14:19:57,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 292 remaining) [2024-01-29 14:19:57,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 292 remaining) [2024-01-29 14:19:57,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 292 remaining) [2024-01-29 14:19:57,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 292 remaining) [2024-01-29 14:19:57,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 292 remaining) [2024-01-29 14:19:57,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 292 remaining) [2024-01-29 14:19:57,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 292 remaining) [2024-01-29 14:19:57,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 292 remaining) [2024-01-29 14:19:57,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 292 remaining) [2024-01-29 14:19:57,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 292 remaining) [2024-01-29 14:19:57,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 292 remaining) [2024-01-29 14:19:57,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 292 remaining) [2024-01-29 14:19:57,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 292 remaining) [2024-01-29 14:19:57,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 292 remaining) [2024-01-29 14:19:57,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 292 remaining) [2024-01-29 14:19:57,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 292 remaining) [2024-01-29 14:19:57,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 292 remaining) [2024-01-29 14:19:57,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 292 remaining) [2024-01-29 14:19:57,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 292 remaining) [2024-01-29 14:19:57,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 292 remaining) [2024-01-29 14:19:57,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 292 remaining) [2024-01-29 14:19:57,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 292 remaining) [2024-01-29 14:19:57,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 292 remaining) [2024-01-29 14:19:57,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 292 remaining) [2024-01-29 14:19:57,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193ASSERT_VIOLATIONERROR_FUNCTION (50 of 292 remaining) [2024-01-29 14:19:57,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 292 remaining) [2024-01-29 14:19:57,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 292 remaining) [2024-01-29 14:19:57,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 292 remaining) [2024-01-29 14:19:57,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 292 remaining) [2024-01-29 14:19:57,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 292 remaining) [2024-01-29 14:19:57,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 292 remaining) [2024-01-29 14:19:57,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 292 remaining) [2024-01-29 14:19:57,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 292 remaining) [2024-01-29 14:19:57,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 292 remaining) [2024-01-29 14:19:57,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 292 remaining) [2024-01-29 14:19:57,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 292 remaining) [2024-01-29 14:19:57,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 292 remaining) [2024-01-29 14:19:57,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 292 remaining) [2024-01-29 14:19:57,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 292 remaining) [2024-01-29 14:19:57,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 292 remaining) [2024-01-29 14:19:57,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 292 remaining) [2024-01-29 14:19:57,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 292 remaining) [2024-01-29 14:19:57,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 292 remaining) [2024-01-29 14:19:57,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 292 remaining) [2024-01-29 14:19:57,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 292 remaining) [2024-01-29 14:19:57,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 292 remaining) [2024-01-29 14:19:57,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 292 remaining) [2024-01-29 14:19:57,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 292 remaining) [2024-01-29 14:19:57,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 292 remaining) [2024-01-29 14:19:57,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 292 remaining) [2024-01-29 14:19:57,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 292 remaining) [2024-01-29 14:19:57,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 292 remaining) [2024-01-29 14:19:57,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 292 remaining) [2024-01-29 14:19:57,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 292 remaining) [2024-01-29 14:19:57,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 292 remaining) [2024-01-29 14:19:57,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 292 remaining) [2024-01-29 14:19:57,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 292 remaining) [2024-01-29 14:19:57,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 292 remaining) [2024-01-29 14:19:57,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 292 remaining) [2024-01-29 14:19:57,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 292 remaining) [2024-01-29 14:19:57,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 292 remaining) [2024-01-29 14:19:57,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 292 remaining) [2024-01-29 14:19:57,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 292 remaining) [2024-01-29 14:19:57,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 292 remaining) [2024-01-29 14:19:57,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 292 remaining) [2024-01-29 14:19:57,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 292 remaining) [2024-01-29 14:19:57,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 292 remaining) [2024-01-29 14:19:57,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 292 remaining) [2024-01-29 14:19:57,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 292 remaining) [2024-01-29 14:19:57,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 292 remaining) [2024-01-29 14:19:57,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 292 remaining) [2024-01-29 14:19:57,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 292 remaining) [2024-01-29 14:19:57,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 292 remaining) [2024-01-29 14:19:57,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 292 remaining) [2024-01-29 14:19:57,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 292 remaining) [2024-01-29 14:19:57,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 14:19:57,504 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:19:57,510 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:19:57,510 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:19:57,574 INFO L503 ceAbstractionStarter]: Automizer considered 241 witness invariants [2024-01-29 14:19:57,574 INFO L504 ceAbstractionStarter]: WitnessConsidered=241 [2024-01-29 14:19:57,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:19:57 BasicIcfg [2024-01-29 14:19:57,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:19:57,575 INFO L158 Benchmark]: Toolchain (without parser) took 9803.88ms. Allocated memory was 144.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 106.0MB in the beginning and 770.9MB in the end (delta: -664.9MB). Peak memory consumption was 581.6MB. Max. memory is 16.1GB. [2024-01-29 14:19:57,576 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:19:57,576 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 144.7MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:19:57,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.57ms. Allocated memory is still 144.7MB. Free memory was 106.0MB in the beginning and 74.9MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-01-29 14:19:57,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.69ms. Allocated memory is still 144.7MB. Free memory was 74.9MB in the beginning and 71.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:19:57,576 INFO L158 Benchmark]: Boogie Preprocessor took 101.72ms. Allocated memory is still 144.7MB. Free memory was 71.3MB in the beginning and 67.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:19:57,577 INFO L158 Benchmark]: RCFGBuilder took 1013.02ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 67.5MB in the beginning and 139.2MB in the end (delta: -71.7MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2024-01-29 14:19:57,577 INFO L158 Benchmark]: TraceAbstraction took 8215.40ms. Allocated memory was 199.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 139.2MB in the beginning and 770.9MB in the end (delta: -631.7MB). Peak memory consumption was 559.5MB. Max. memory is 16.1GB. [2024-01-29 14:19:57,578 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.07ms. Allocated memory is still 144.7MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.57ms. Allocated memory is still 144.7MB. Free memory was 106.0MB in the beginning and 74.9MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.69ms. Allocated memory is still 144.7MB. Free memory was 74.9MB in the beginning and 71.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.72ms. Allocated memory is still 144.7MB. Free memory was 71.3MB in the beginning and 67.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1013.02ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 67.5MB in the beginning and 139.2MB in the end (delta: -71.7MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8215.40ms. Allocated memory was 199.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 139.2MB in the beginning and 770.9MB in the end (delta: -631.7MB). Peak memory consumption was 559.5MB. 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[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[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[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[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[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[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[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[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[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[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[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,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[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[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[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[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[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[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]]]] 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[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[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] [L89] N = __VERIFIER_nondet_int() [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[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] [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[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[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[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,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[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[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[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[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[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] [L90] n = __VERIFIER_nondet_int() [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]]]] 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[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[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[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[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[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[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[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[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[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[start],IntegerLiteral[0]]]] [L91] start = __VERIFIER_nondet_int() [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[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[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[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] [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[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[A],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[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[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] [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[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[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[queue],IntegerLiteral[0]]]] [L93] CALL create_fresh_int_array(n) [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[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[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[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[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] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v_old],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[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[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] [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[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[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[v_old],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[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] [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[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[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[v_old],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[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] 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[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[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[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] 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[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[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[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[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[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] [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]]]] [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[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: 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: 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: 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: 8.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1683 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 893 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 463 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2712 IncrementalHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 463 mSolverCounterUnsat, 208 mSDtfsCounter, 2712 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=964occurred in iteration=0, InterpolantAutomatonStates: 55, 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.5s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 1180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 14:19:57,652 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