./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d8006e4b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-d8006e4-m [2024-02-05 10:35:26,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-05 10:35:26,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-05 10:35:26,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-05 10:35:26,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-05 10:35:26,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-05 10:35:26,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-05 10:35:26,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-05 10:35:26,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-05 10:35:26,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-05 10:35:26,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-05 10:35:26,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-05 10:35:26,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-05 10:35:26,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-05 10:35:26,226 INFO L153 SettingsManager]: * Use SBE=true [2024-02-05 10:35:26,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-05 10:35:26,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-05 10:35:26,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-05 10:35:26,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-05 10:35:26,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-05 10:35:26,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-05 10:35:26,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-05 10:35:26,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-05 10:35:26,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-05 10:35:26,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-05 10:35:26,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-05 10:35:26,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-05 10:35:26,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-05 10:35:26,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-05 10:35:26,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-05 10:35:26,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-05 10:35:26,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-05 10:35:26,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:35:26,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-05 10:35:26,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-05 10:35:26,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-05 10:35:26,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-05 10:35:26,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-05 10:35:26,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-05 10:35:26,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-05 10:35:26,233 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-05 10:35:26,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-05 10:35:26,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-05 10:35:26,233 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-02-05 10:35:26,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-05 10:35:26,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-05 10:35:26,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-05 10:35:26,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-05 10:35:26,406 INFO L274 PluginConnector]: CDTParser initialized [2024-02-05 10:35:26,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-02-05 10:35:27,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-05 10:35:27,705 INFO L384 CDTParser]: Found 1 translation units. [2024-02-05 10:35:27,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-02-05 10:35:27,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1905664/cbf288d8ee214f4e93a17081f7b86011/FLAG6d1683823 [2024-02-05 10:35:27,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1905664/cbf288d8ee214f4e93a17081f7b86011 [2024-02-05 10:35:27,725 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-05 10:35:27,726 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-05 10:35:27,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.yml/witness.yml [2024-02-05 10:35:27,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-05 10:35:27,859 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-05 10:35:27,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-05 10:35:27,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-05 10:35:27,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-05 10:35:27,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:35:27" (1/2) ... [2024-02-05 10:35:27,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5c938e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:35:27, skipping insertion in model container [2024-02-05 10:35:27,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:35:27" (1/2) ... [2024-02-05 10:35:27,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@401548e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:35:27, skipping insertion in model container [2024-02-05 10:35:27,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:35:27" (2/2) ... [2024-02-05 10:35:27,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5c938e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:27, skipping insertion in model container [2024-02-05 10:35:27,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:35:27" (2/2) ... [2024-02-05 10:35:27,867 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-05 10:35:27,923 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-05 10:35:27,927 INFO L101 nessWitnessExtractor]: Location invariant before [L51-L51] ((0 <= i) && (0 <= end)) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,927 INFO L101 nessWitnessExtractor]: Location invariant after [L67-L67] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,927 INFO L101 nessWitnessExtractor]: Location invariant before [L91-L91] (((((((((((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL)) && (queue == 0)) && (A == 0)) && (i == 0)) && (last == 0)) && (start == 0)) && (end == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,927 INFO L101 nessWitnessExtractor]: Location invariant before [L67-L67] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,928 INFO L101 nessWitnessExtractor]: Location invariant before [L72-L72] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,928 INFO L101 nessWitnessExtractor]: Location invariant before [L101-L101] ((i == 0) && (new == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,928 INFO L101 nessWitnessExtractor]: Location invariant before [L98-L98] (((i == 0) && (last == 0)) && (new == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,928 INFO L101 nessWitnessExtractor]: Loop invariant at [L69-L69] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,928 INFO L101 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,928 INFO L101 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,929 INFO L101 nessWitnessExtractor]: Location invariant before [L79-L79] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,929 INFO L101 nessWitnessExtractor]: Location invariant before [L73-L73] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,929 INFO L101 nessWitnessExtractor]: Location invariant before [L53-L53] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,929 INFO L101 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,929 INFO L101 nessWitnessExtractor]: Location invariant before [L52-L52] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,929 INFO L101 nessWitnessExtractor]: Location invariant before [L92-L92] (((((((queue == 0) && (A == 0)) && (i == 0)) && (last == 0)) && (end == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,929 INFO L101 nessWitnessExtractor]: Location invariant before [L97-L97] ((((i == 0) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,930 INFO L101 nessWitnessExtractor]: Location invariant before [L78-L78] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,930 INFO L101 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,930 INFO L101 nessWitnessExtractor]: Location invariant before [L114-L114] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,930 INFO L101 nessWitnessExtractor]: Location invariant before [L118-L118] (((((((((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0)) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1)) && (size != 0)) && ((((((((((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-02-05 10:35:27,931 INFO L101 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,931 INFO L101 nessWitnessExtractor]: Location invariant before [L90-L90] ((((((((((((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL)) && (queue == 0)) && (A == 0)) && (i == 0)) && (n == 0)) && (last == 0)) && (start == 0)) && (end == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,931 INFO L101 nessWitnessExtractor]: Loop invariant at [L117-L117] ((((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1)) && ((((((((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-02-05 10:35:27,931 INFO L101 nessWitnessExtractor]: Location invariant before [L113-L113] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,931 INFO L101 nessWitnessExtractor]: Loop invariant at [L48-L48] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,931 INFO L101 nessWitnessExtractor]: Location invariant before [L54-L54] ((-2147483647 <= end) && (0 <= i)) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,931 INFO L101 nessWitnessExtractor]: Location invariant before [L116-L116] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,932 INFO L101 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,932 INFO L101 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,932 INFO L101 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,932 INFO L101 nessWitnessExtractor]: Location invariant before [L74-L74] ((-2147483647 <= start) && (0 <= i)) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,932 INFO L101 nessWitnessExtractor]: Location invariant before [L68-L68] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,932 INFO L101 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,932 INFO L101 nessWitnessExtractor]: Location invariant before [L94-L94] (((((A == 0) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,933 INFO L101 nessWitnessExtractor]: Location invariant before [L58-L58] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,933 INFO L101 nessWitnessExtractor]: Location invariant before [L89-L89] (((((((((((((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL)) && (queue == 0)) && (A == 0)) && (i == 0)) && (N == 0)) && (n == 0)) && (last == 0)) && (start == 0)) && (end == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,933 INFO L101 nessWitnessExtractor]: Location invariant before [L71-L71] (((-2147483647 <= end) && (0 <= i)) && (start <= 2147483646)) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,934 INFO L101 nessWitnessExtractor]: Location invariant before [L82-L82] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,935 INFO L101 nessWitnessExtractor]: Location invariant before [L88-L88] (((((((((((((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL)) && (queue == 0)) && (A == 0)) && (i == 0)) && (N == 0)) && (n == 0)) && (last == 0)) && (start == 0)) && (end == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)0) [2024-02-05 10:35:27,935 INFO L101 nessWitnessExtractor]: Location invariant before [L96-L96] ((((i == 0) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,935 INFO L101 nessWitnessExtractor]: Location invariant before [L59-L59] (1 <= i) && ((unsigned long )_argptr == 0UL) [2024-02-05 10:35:27,935 INFO L101 nessWitnessExtractor]: Location invariant before [L93-L93] ((((((queue == 0) && (A == 0)) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,935 INFO L101 nessWitnessExtractor]: Location invariant before [L120-L120] (((((((0 <= i) && ((long long )i - (long long )size >= 0LL)) && (A == 0)) && (i == 0)) && (last == 0)) && (new == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-02-05 10:35:27,935 INFO L101 nessWitnessExtractor]: Location invariant before [L77-L77] (unsigned long )_argptr == 0UL [2024-02-05 10:35:27,955 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-05 10:35:28,109 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-02-05 10:35:28,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:35:28,124 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local 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-02-05 10:35:28,163 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-02-05 10:35:28,164 WARN L424 MainDispatcher]: Unable to annotate cond = i < N || start < end 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 [2024-02-05 10:35:28,218 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] Start Parsing Local Start Parsing Local [2024-02-05 10:35:28,221 WARN L424 MainDispatcher]: Unable to annotate * arr = (int*)malloc(sizeof(int) * (size_t)size) with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-05 10:35:28,239 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:35:28,258 INFO L208 MainTranslator]: Completed translation [2024-02-05 10:35:28,259 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28 WrapperNode [2024-02-05 10:35:28,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-05 10:35:28,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-05 10:35:28,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-05 10:35:28,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-05 10:35:28,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,324 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 246 [2024-02-05 10:35:28,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-05 10:35:28,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-05 10:35:28,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-05 10:35:28,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-05 10:35:28,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,362 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 8, 2, 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, 2, 1, 1]. [2024-02-05 10:35:28,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-05 10:35:28,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-05 10:35:28,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-05 10:35:28,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-05 10:35:28,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (1/1) ... [2024-02-05 10:35:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:35:28,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:35:28,452 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-02-05 10:35:28,470 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-02-05 10:35:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-05 10:35:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-05 10:35:28,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-05 10:35:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-05 10:35:28,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-05 10:35:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-05 10:35:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-05 10:35:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-05 10:35:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-05 10:35:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-05 10:35:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-05 10:35:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-05 10:35:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-05 10:35:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-05 10:35:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-05 10:35:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-05 10:35:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-05 10:35:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-05 10:35:28,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-05 10:35:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-05 10:35:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-05 10:35:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-05 10:35:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-05 10:35:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-05 10:35:28,491 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-05 10:35:28,572 INFO L244 CfgBuilder]: Building ICFG [2024-02-05 10:35:28,574 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-05 10:35:29,037 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-05 10:35:29,038 INFO L293 CfgBuilder]: Performing block encoding [2024-02-05 10:35:29,246 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-05 10:35:29,246 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-05 10:35:29,247 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:35:29 BoogieIcfgContainer [2024-02-05 10:35:29,247 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-05 10:35:29,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-05 10:35:29,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-05 10:35:29,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-05 10:35:29,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:35:27" (1/4) ... [2024-02-05 10:35:29,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22117d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:35:29, skipping insertion in model container [2024-02-05 10:35:29,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:35:27" (2/4) ... [2024-02-05 10:35:29,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22117d55 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:35:29, skipping insertion in model container [2024-02-05 10:35:29,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:35:28" (3/4) ... [2024-02-05 10:35:29,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22117d55 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:35:29, skipping insertion in model container [2024-02-05 10:35:29,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:35:29" (4/4) ... [2024-02-05 10:35:29,254 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-02-05 10:35:29,268 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-05 10:35:29,268 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-02-05 10:35:29,268 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-05 10:35:29,327 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-05 10:35:29,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 113 transitions, 240 flow [2024-02-05 10:35:29,408 INFO L124 PetriNetUnfolderBase]: 7/111 cut-off events. [2024-02-05 10:35:29,408 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-05 10:35:29,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 111 events. 7/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 223 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2024-02-05 10:35:29,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 113 transitions, 240 flow [2024-02-05 10:35:29,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 110 transitions, 232 flow [2024-02-05 10:35:29,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-05 10:35:29,434 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;@7010ba35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-05 10:35:29,435 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-02-05 10:35:29,436 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-05 10:35:29,436 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-05 10:35:29,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:35:29,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:35:29,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-05 10:35:29,438 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-02-05 10:35:29,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:35:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash 22142, now seen corresponding path program 1 times [2024-02-05 10:35:29,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:35:29,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365641054] [2024-02-05 10:35:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:35:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:35:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:35:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:29,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:35:29,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365641054] [2024-02-05 10:35:29,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365641054] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:35:29,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:35:29,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:35:29,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816662811] [2024-02-05 10:35:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:35:29,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:35:29,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:35:29,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:35:29,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:35:29,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 113 [2024-02-05 10:35:29,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-02-05 10:35:29,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:35:29,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 113 [2024-02-05 10:35:29,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:35:30,217 INFO L124 PetriNetUnfolderBase]: 349/840 cut-off events. [2024-02-05 10:35:30,218 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-02-05 10:35:30,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 840 events. 349/840 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5200 event pairs, 266 based on Foata normal form. 61/671 useless extension candidates. Maximal degree in co-relation 1295. Up to 590 conditions per place. [2024-02-05 10:35:30,228 INFO L140 encePairwiseOnDemand]: 100/113 looper letters, 49 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2024-02-05 10:35:30,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 99 transitions, 312 flow [2024-02-05 10:35:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:35:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:35:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2024-02-05 10:35:30,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6253687315634219 [2024-02-05 10:35:30,244 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 232 flow. Second operand 3 states and 212 transitions. [2024-02-05 10:35:30,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 99 transitions, 312 flow [2024-02-05 10:35:30,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 99 transitions, 304 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-05 10:35:30,255 INFO L231 Difference]: Finished difference. Result has 99 places, 99 transitions, 206 flow [2024-02-05 10:35:30,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=99, PETRI_TRANSITIONS=99} [2024-02-05 10:35:30,260 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -11 predicate places. [2024-02-05 10:35:30,260 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 99 transitions, 206 flow [2024-02-05 10:35:30,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-02-05 10:35:30,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:35:30,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-05 10:35:30,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-05 10:35:30,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-02-05 10:35:30,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:35:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash 687119, now seen corresponding path program 1 times [2024-02-05 10:35:30,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:35:30,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015953306] [2024-02-05 10:35:30,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:35:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:35:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:35:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:30,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:35:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015953306] [2024-02-05 10:35:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015953306] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:35:30,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:35:30,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:35:30,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213908738] [2024-02-05 10:35:30,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:35:30,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:35:30,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:35:30,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:35:30,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:35:30,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 113 [2024-02-05 10:35:30,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-02-05 10:35:30,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:35:30,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 113 [2024-02-05 10:35:30,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:35:30,832 INFO L124 PetriNetUnfolderBase]: 349/839 cut-off events. [2024-02-05 10:35:30,832 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-05 10:35:30,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 839 events. 349/839 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5175 event pairs, 266 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 1449. Up to 602 conditions per place. [2024-02-05 10:35:30,837 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 61 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2024-02-05 10:35:30,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 98 transitions, 332 flow [2024-02-05 10:35:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:35:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:35:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2024-02-05 10:35:30,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47123893805309736 [2024-02-05 10:35:30,843 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 206 flow. Second operand 4 states and 213 transitions. [2024-02-05 10:35:30,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 98 transitions, 332 flow [2024-02-05 10:35:30,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 98 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:35:30,846 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 206 flow [2024-02-05 10:35:30,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2024-02-05 10:35:30,847 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -11 predicate places. [2024-02-05 10:35:30,847 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 206 flow [2024-02-05 10:35:30,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-02-05 10:35:30,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:35:30,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-05 10:35:30,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-05 10:35:30,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-02-05 10:35:30,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:35:30,849 INFO L85 PathProgramCache]: Analyzing trace with hash 21301463, now seen corresponding path program 1 times [2024-02-05 10:35:30,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:35:30,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871366064] [2024-02-05 10:35:30,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:35:30,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:35:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:35:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:35:30,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871366064] [2024-02-05 10:35:30,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871366064] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:35:30,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:35:30,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:35:30,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212783672] [2024-02-05 10:35:30,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:35:30,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:35:30,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:35:30,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:35:30,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:35:31,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 113 [2024-02-05 10:35:31,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 98 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-02-05 10:35:31,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:35:31,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 113 [2024-02-05 10:35:31,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:35:31,183 INFO L124 PetriNetUnfolderBase]: 320/810 cut-off events. [2024-02-05 10:35:31,183 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-05 10:35:31,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 810 events. 320/810 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5102 event pairs, 239 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 1367. Up to 551 conditions per place. [2024-02-05 10:35:31,187 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 59 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2024-02-05 10:35:31,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 97 transitions, 328 flow [2024-02-05 10:35:31,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:35:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:35:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2024-02-05 10:35:31,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48451327433628316 [2024-02-05 10:35:31,188 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 206 flow. Second operand 4 states and 219 transitions. [2024-02-05 10:35:31,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 97 transitions, 328 flow [2024-02-05 10:35:31,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-05 10:35:31,191 INFO L231 Difference]: Finished difference. Result has 98 places, 97 transitions, 204 flow [2024-02-05 10:35:31,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=98, PETRI_TRANSITIONS=97} [2024-02-05 10:35:31,191 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -12 predicate places. [2024-02-05 10:35:31,191 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 97 transitions, 204 flow [2024-02-05 10:35:31,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-02-05 10:35:31,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:35:31,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-05 10:35:31,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-05 10:35:31,192 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-02-05 10:35:31,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:35:31,193 INFO L85 PathProgramCache]: Analyzing trace with hash 660346036, now seen corresponding path program 1 times [2024-02-05 10:35:31,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:35:31,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208985504] [2024-02-05 10:35:31,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:35:31,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:35:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:35:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:31,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:35:31,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208985504] [2024-02-05 10:35:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208985504] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:35:31,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:35:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:35:31,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325303830] [2024-02-05 10:35:31,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:35:31,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:35:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:35:31,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:35:31,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:35:31,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 113 [2024-02-05 10:35:31,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-02-05 10:35:31,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:35:31,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 113 [2024-02-05 10:35:31,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:35:31,506 INFO L124 PetriNetUnfolderBase]: 320/809 cut-off events. [2024-02-05 10:35:31,507 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-05 10:35:31,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 809 events. 320/809 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5120 event pairs, 239 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 1363. Up to 549 conditions per place. [2024-02-05 10:35:31,511 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 58 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2024-02-05 10:35:31,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 96 transitions, 324 flow [2024-02-05 10:35:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:35:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:35:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2024-02-05 10:35:31,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4911504424778761 [2024-02-05 10:35:31,513 INFO L175 Difference]: Start difference. First operand has 98 places, 97 transitions, 204 flow. Second operand 4 states and 222 transitions. [2024-02-05 10:35:31,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 96 transitions, 324 flow [2024-02-05 10:35:31,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 96 transitions, 318 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-05 10:35:31,515 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 202 flow [2024-02-05 10:35:31,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2024-02-05 10:35:31,516 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -13 predicate places. [2024-02-05 10:35:31,516 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 202 flow [2024-02-05 10:35:31,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-02-05 10:35:31,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:35:31,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-05 10:35:31,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-05 10:35:31,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-02-05 10:35:31,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:35:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1004108616, now seen corresponding path program 1 times [2024-02-05 10:35:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:35:31,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402535310] [2024-02-05 10:35:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:35:31,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:35:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:35:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:31,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:35:31,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402535310] [2024-02-05 10:35:31,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402535310] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:35:31,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:35:31,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:35:31,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836386793] [2024-02-05 10:35:31,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:35:31,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:35:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:35:31,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:35:31,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:35:31,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 113 [2024-02-05 10:35:31,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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-02-05 10:35:31,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:35:31,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 113 [2024-02-05 10:35:31,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:35:31,772 INFO L124 PetriNetUnfolderBase]: 320/808 cut-off events. [2024-02-05 10:35:31,773 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-05 10:35:31,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 808 events. 320/808 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5105 event pairs, 239 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 1359. Up to 547 conditions per place. [2024-02-05 10:35:31,776 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 57 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2024-02-05 10:35:31,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 320 flow [2024-02-05 10:35:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:35:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:35:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2024-02-05 10:35:31,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.497787610619469 [2024-02-05 10:35:31,778 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 202 flow. Second operand 4 states and 225 transitions. [2024-02-05 10:35:31,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 320 flow [2024-02-05 10:35:31,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 95 transitions, 314 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-05 10:35:31,780 INFO L231 Difference]: Finished difference. Result has 96 places, 95 transitions, 200 flow [2024-02-05 10:35:31,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=96, PETRI_TRANSITIONS=95} [2024-02-05 10:35:31,782 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -14 predicate places. [2024-02-05 10:35:31,782 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 95 transitions, 200 flow [2024-02-05 10:35:31,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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-02-05 10:35:31,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:35:31,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:35:31,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-05 10:35:31,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-02-05 10:35:31,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:35:31,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1062595331, now seen corresponding path program 1 times [2024-02-05 10:35:31,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:35:31,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392230777] [2024-02-05 10:35:31,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:35:31,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:35:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:35:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:31,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:35:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392230777] [2024-02-05 10:35:31,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392230777] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:35:31,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:35:31,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:35:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120611340] [2024-02-05 10:35:31,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:35:31,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:35:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:35:31,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:35:31,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:35:31,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2024-02-05 10:35:31,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-02-05 10:35:31,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:35:31,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2024-02-05 10:35:31,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:35:32,073 INFO L124 PetriNetUnfolderBase]: 320/805 cut-off events. [2024-02-05 10:35:32,073 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-05 10:35:32,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 805 events. 320/805 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5126 event pairs, 239 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 1351. Up to 537 conditions per place. [2024-02-05 10:35:32,077 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 54 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2024-02-05 10:35:32,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 308 flow [2024-02-05 10:35:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:35:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:35:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2024-02-05 10:35:32,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504424778761062 [2024-02-05 10:35:32,078 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 200 flow. Second operand 4 states and 228 transitions. [2024-02-05 10:35:32,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 308 flow [2024-02-05 10:35:32,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 302 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-05 10:35:32,080 INFO L231 Difference]: Finished difference. Result has 93 places, 92 transitions, 194 flow [2024-02-05 10:35:32,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=93, PETRI_TRANSITIONS=92} [2024-02-05 10:35:32,082 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, -17 predicate places. [2024-02-05 10:35:32,082 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 194 flow [2024-02-05 10:35:32,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-02-05 10:35:32,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:35:32,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:35:32,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-05 10:35:32,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-02-05 10:35:32,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:35:32,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1867787142, now seen corresponding path program 1 times [2024-02-05 10:35:32,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:35:32,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084503962] [2024-02-05 10:35:32,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:35:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:35:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:35:32,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-05 10:35:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:35:32,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-05 10:35:32,139 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-05 10:35:32,140 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 76 remaining) [2024-02-05 10:35:32,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 76 remaining) [2024-02-05 10:35:32,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 76 remaining) [2024-02-05 10:35:32,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 76 remaining) [2024-02-05 10:35:32,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 76 remaining) [2024-02-05 10:35:32,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 76 remaining) [2024-02-05 10:35:32,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 76 remaining) [2024-02-05 10:35:32,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 76 remaining) [2024-02-05 10:35:32,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 76 remaining) [2024-02-05 10:35:32,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 76 remaining) [2024-02-05 10:35:32,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 76 remaining) [2024-02-05 10:35:32,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 76 remaining) [2024-02-05 10:35:32,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 76 remaining) [2024-02-05 10:35:32,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 76 remaining) [2024-02-05 10:35:32,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 76 remaining) [2024-02-05 10:35:32,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 76 remaining) [2024-02-05 10:35:32,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 76 remaining) [2024-02-05 10:35:32,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 76 remaining) [2024-02-05 10:35:32,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 76 remaining) [2024-02-05 10:35:32,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 76 remaining) [2024-02-05 10:35:32,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 76 remaining) [2024-02-05 10:35:32,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 76 remaining) [2024-02-05 10:35:32,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 76 remaining) [2024-02-05 10:35:32,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 76 remaining) [2024-02-05 10:35:32,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 76 remaining) [2024-02-05 10:35:32,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 76 remaining) [2024-02-05 10:35:32,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 76 remaining) [2024-02-05 10:35:32,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 76 remaining) [2024-02-05 10:35:32,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 76 remaining) [2024-02-05 10:35:32,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 76 remaining) [2024-02-05 10:35:32,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 76 remaining) [2024-02-05 10:35:32,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 76 remaining) [2024-02-05 10:35:32,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 76 remaining) [2024-02-05 10:35:32,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 76 remaining) [2024-02-05 10:35:32,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 76 remaining) [2024-02-05 10:35:32,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 76 remaining) [2024-02-05 10:35:32,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 76 remaining) [2024-02-05 10:35:32,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 76 remaining) [2024-02-05 10:35:32,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 76 remaining) [2024-02-05 10:35:32,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 76 remaining) [2024-02-05 10:35:32,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 76 remaining) [2024-02-05 10:35:32,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 76 remaining) [2024-02-05 10:35:32,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 76 remaining) [2024-02-05 10:35:32,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 76 remaining) [2024-02-05 10:35:32,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 76 remaining) [2024-02-05 10:35:32,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 76 remaining) [2024-02-05 10:35:32,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 76 remaining) [2024-02-05 10:35:32,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (28 of 76 remaining) [2024-02-05 10:35:32,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 76 remaining) [2024-02-05 10:35:32,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 76 remaining) [2024-02-05 10:35:32,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 76 remaining) [2024-02-05 10:35:32,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 76 remaining) [2024-02-05 10:35:32,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 76 remaining) [2024-02-05 10:35:32,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 76 remaining) [2024-02-05 10:35:32,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 76 remaining) [2024-02-05 10:35:32,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 76 remaining) [2024-02-05 10:35:32,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 76 remaining) [2024-02-05 10:35:32,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 76 remaining) [2024-02-05 10:35:32,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 76 remaining) [2024-02-05 10:35:32,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 76 remaining) [2024-02-05 10:35:32,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 76 remaining) [2024-02-05 10:35:32,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 76 remaining) [2024-02-05 10:35:32,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 76 remaining) [2024-02-05 10:35:32,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 76 remaining) [2024-02-05 10:35:32,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 76 remaining) [2024-02-05 10:35:32,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 76 remaining) [2024-02-05 10:35:32,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 76 remaining) [2024-02-05 10:35:32,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 76 remaining) [2024-02-05 10:35:32,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 76 remaining) [2024-02-05 10:35:32,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 76 remaining) [2024-02-05 10:35:32,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 76 remaining) [2024-02-05 10:35:32,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 76 remaining) [2024-02-05 10:35:32,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 76 remaining) [2024-02-05 10:35:32,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 76 remaining) [2024-02-05 10:35:32,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 76 remaining) [2024-02-05 10:35:32,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 76 remaining) [2024-02-05 10:35:32,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-05 10:35:32,152 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:35:32,157 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-05 10:35:32,157 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-05 10:35:32,174 INFO L503 ceAbstractionStarter]: Automizer considered 47 witness invariants [2024-02-05 10:35:32,174 INFO L504 ceAbstractionStarter]: WitnessConsidered=47 [2024-02-05 10:35:32,175 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:35:32 BasicIcfg [2024-02-05 10:35:32,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-05 10:35:32,175 INFO L158 Benchmark]: Toolchain (without parser) took 4316.66ms. Allocated memory was 220.2MB in the beginning and 314.6MB in the end (delta: 94.4MB). Free memory was 181.2MB in the beginning and 201.3MB in the end (delta: -20.1MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2024-02-05 10:35:32,175 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory was 81.4MB in the beginning and 81.3MB in the end (delta: 77.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:35:32,176 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 220.2MB. Free memory is still 190.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:35:32,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.87ms. Allocated memory is still 220.2MB. Free memory was 181.2MB in the beginning and 157.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-02-05 10:35:32,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.43ms. Allocated memory is still 220.2MB. Free memory was 157.1MB in the beginning and 152.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-05 10:35:32,176 INFO L158 Benchmark]: Boogie Preprocessor took 77.97ms. Allocated memory is still 220.2MB. Free memory was 152.9MB in the beginning and 149.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-05 10:35:32,176 INFO L158 Benchmark]: RCFGBuilder took 843.48ms. Allocated memory is still 220.2MB. Free memory was 149.7MB in the beginning and 161.0MB in the end (delta: -11.2MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-02-05 10:35:32,177 INFO L158 Benchmark]: TraceAbstraction took 2926.75ms. Allocated memory was 220.2MB in the beginning and 314.6MB in the end (delta: 94.4MB). Free memory was 159.9MB in the beginning and 201.3MB in the end (delta: -41.4MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2024-02-05 10:35:32,178 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory was 81.4MB in the beginning and 81.3MB in the end (delta: 77.6kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 220.2MB. Free memory is still 190.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.87ms. Allocated memory is still 220.2MB. Free memory was 181.2MB in the beginning and 157.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.43ms. Allocated memory is still 220.2MB. Free memory was 157.1MB in the beginning and 152.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.97ms. Allocated memory is still 220.2MB. Free memory was 152.9MB in the beginning and 149.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 843.48ms. Allocated memory is still 220.2MB. Free memory was 149.7MB in the beginning and 161.0MB in the end (delta: -11.2MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2926.75ms. Allocated memory was 220.2MB in the beginning and 314.6MB in the end (delta: 94.4MB). Free memory was 159.9MB in the beginning and 201.3MB in the end (delta: -41.4MB). Peak memory consumption was 53.0MB. 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={3:0}, t2={5:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],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={3:0}, t2={5:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L89] N = __VERIFIER_nondet_int() [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L90] n = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L91] start = __VERIFIER_nondet_int() [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L92] end = start VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={3:0}, t2={5:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L93] CALL create_fresh_int_array(n) [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L113] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L113] RET assume_abort_if_not(size >= 0) [L114] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [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] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]],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)=0, arr={-1:0}, i=-1, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, size=0, 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: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 55]: 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: 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: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 79]: 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: 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: 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: 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: 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: 94]: 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: 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: 96]: 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: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 160 locations, 76 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: 2.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 441 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1096 IncrementalHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 94 mSDtfsCounter, 1096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=0, InterpolantAutomatonStates: 23, 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.9s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 723 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-02-05 10:35:32,205 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