./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/chl-poker-hand-symm.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/chl-poker-hand-symm.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-958ec4d-m [2024-02-07 14:31:42,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:31:42,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:31:42,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:31:42,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:31:42,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:31:42,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:31:42,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:31:42,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:31:42,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:31:42,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:31:42,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:31:42,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:31:42,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:31:42,179 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:31:42,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:31:42,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:31:42,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:31:42,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:31:42,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:31:42,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:31:42,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:31:42,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:31:42,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:31:42,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:31:42,181 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:31:42,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:31:42,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:31:42,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:31:42,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:31:42,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:31:42,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:31:42,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:31:42,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:31:42,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:31:42,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:31:42,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:31:42,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:31:42,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:31:42,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:31:42,185 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:31:42,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:31:42,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:31:42,185 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-07 14:31:42,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:31:42,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:31:42,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:31:42,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:31:42,404 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:31:42,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2024-02-07 14:31:43,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:31:43,733 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:31:43,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2024-02-07 14:31:43,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb4b3637/3809847cf1184120b17aa4ced45cd848/FLAG3120cdf96 [2024-02-07 14:31:43,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb4b3637/3809847cf1184120b17aa4ced45cd848 [2024-02-07 14:31:43,757 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:31:43,758 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:31:43,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/chl-poker-hand-symm.wvr.yml/witness.yml [2024-02-07 14:31:43,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:31:43,876 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:31:43,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:31:43,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:31:43,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:31:43,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:31:43" (1/2) ... [2024-02-07 14:31:43,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8a08ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:31:43, skipping insertion in model container [2024-02-07 14:31:43,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:31:43" (1/2) ... [2024-02-07 14:31:43,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4080a996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:31:43, skipping insertion in model container [2024-02-07 14:31:43,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:31:43" (2/2) ... [2024-02-07 14:31:43,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8a08ef and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:43, skipping insertion in model container [2024-02-07 14:31:43,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:31:43" (2/2) ... [2024-02-07 14:31:43,885 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:31:43,945 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:31:43,947 INFO L76 edCorrectnessWitness]: Location invariant before [L118-L118] result_8 == -1 [2024-02-07 14:31:43,947 INFO L76 edCorrectnessWitness]: Location invariant before [L88-L88] break_12 == (_Bool)0 || break_12 == (_Bool)1 [2024-02-07 14:31:43,947 INFO L76 edCorrectnessWitness]: Location invariant before [L126-L126] result_8 == 0 [2024-02-07 14:31:43,947 INFO L76 edCorrectnessWitness]: Location invariant before [L85-L85] (i2_11 == 0) && (break_12 == (_Bool)0) [2024-02-07 14:31:43,948 INFO L76 edCorrectnessWitness]: Location invariant before [L169-L169] (i2_16 == 0) && (break_17 == (_Bool)0) [2024-02-07 14:31:43,948 INFO L76 edCorrectnessWitness]: Location invariant before [L82-L82] break_12 == (_Bool)0 [2024-02-07 14:31:43,949 INFO L76 edCorrectnessWitness]: Location invariant before [L170-L170] i2_16 == 0 [2024-02-07 14:31:43,949 INFO L76 edCorrectnessWitness]: Location invariant before [L210-L210] result_13 == 0 [2024-02-07 14:31:43,949 INFO L76 edCorrectnessWitness]: Location invariant before [L54-L54] break_10 == (_Bool)0 [2024-02-07 14:31:43,949 INFO L76 edCorrectnessWitness]: Location invariant before [L172-L172] break_17 == (_Bool)0 || break_17 == (_Bool)1 [2024-02-07 14:31:43,949 INFO L76 edCorrectnessWitness]: Location invariant before [L175-L175] (i2_16 == 0) && (break_17 == (_Bool)0) [2024-02-07 14:31:43,949 INFO L76 edCorrectnessWitness]: Location invariant before [L144-L144] (0 <= i1_14) && (break_15 == (_Bool)0 || break_15 == (_Bool)1) [2024-02-07 14:31:43,949 INFO L76 edCorrectnessWitness]: Location invariant before [L253-L253] (b <= -1) && (b != 0) [2024-02-07 14:31:43,950 INFO L76 edCorrectnessWitness]: Location invariant before [L171-L171] i2_16 == 0 [2024-02-07 14:31:43,950 INFO L76 edCorrectnessWitness]: Location invariant before [L60-L60] (0 <= i1_9) && (break_10 == (_Bool)0 || break_10 == (_Bool)1) [2024-02-07 14:31:43,950 INFO L76 edCorrectnessWitness]: Location invariant before [L86-L86] i2_11 == 0 [2024-02-07 14:31:43,950 INFO L76 edCorrectnessWitness]: Location invariant before [L244-L244] (((((0 <= size) && (4 <= size)) && (size <= 13)) && (size <= 127)) && (size != 0)) && ((size == 4 || size == 5) || size == 13) [2024-02-07 14:31:43,950 INFO L76 edCorrectnessWitness]: Location invariant before [L141-L141] (0 <= i1_14) && (break_15 == (_Bool)0) [2024-02-07 14:31:43,950 INFO L76 edCorrectnessWitness]: Location invariant before [L242-L242] (((((0 <= size) && (4 <= size)) && (size <= 13)) && (size <= 127)) && (size != 0)) && ((size == 4 || size == 5) || size == 13) [2024-02-07 14:31:43,951 INFO L76 edCorrectnessWitness]: Location invariant before [L165-L165] i2_16 == 0 [2024-02-07 14:31:43,951 INFO L76 edCorrectnessWitness]: Location invariant before [L57-L57] (0 <= i1_9) && (break_10 == (_Bool)0) [2024-02-07 14:31:43,951 INFO L76 edCorrectnessWitness]: Location invariant before [L143-L143] 0 <= i1_14 [2024-02-07 14:31:43,951 INFO L76 edCorrectnessWitness]: Location invariant before [L194-L194] result_13 == 1 [2024-02-07 14:31:43,951 INFO L76 edCorrectnessWitness]: Location invariant before [L166-L166] break_17 == (_Bool)0 [2024-02-07 14:31:43,952 INFO L76 edCorrectnessWitness]: Location invariant before [L252-L252] (1 <= b) && (b != 0) [2024-02-07 14:31:43,952 INFO L76 edCorrectnessWitness]: Location invariant before [L241-L241] (((((0 <= size) && (4 <= size)) && (size <= 13)) && (size <= 127)) && (size != 0)) && ((size == 4 || size == 5) || size == 13) [2024-02-07 14:31:43,952 INFO L76 edCorrectnessWitness]: Location invariant before [L110-L110] result_8 == 1 [2024-02-07 14:31:43,952 INFO L76 edCorrectnessWitness]: Location invariant before [L87-L87] i2_11 == 0 [2024-02-07 14:31:43,952 INFO L76 edCorrectnessWitness]: Location invariant before [L145-L145] 1 <= i1_14 [2024-02-07 14:31:43,952 INFO L76 edCorrectnessWitness]: Location invariant before [L142-L142] 0 <= i1_14 [2024-02-07 14:31:43,952 INFO L76 edCorrectnessWitness]: Location invariant before [L81-L81] i2_11 == 0 [2024-02-07 14:31:43,953 INFO L76 edCorrectnessWitness]: Location invariant before [L91-L91] (i2_11 == 0) && (break_12 == (_Bool)0) [2024-02-07 14:31:43,953 INFO L76 edCorrectnessWitness]: Location invariant before [L246-L246] (((((13 == size && ((((8 <= i && i <= 12) || i == 7) || i == 6) || i == 5)) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0) [2024-02-07 14:31:43,953 INFO L76 edCorrectnessWitness]: Location invariant before [L138-L138] break_15 == (_Bool)0 [2024-02-07 14:31:43,953 INFO L76 edCorrectnessWitness]: Location invariant before [L53-L53] i1_9 == 0 [2024-02-07 14:31:43,953 INFO L76 edCorrectnessWitness]: Location invariant before [L61-L61] 1 <= i1_9 [2024-02-07 14:31:43,953 INFO L76 edCorrectnessWitness]: Location invariant before [L59-L59] 0 <= i1_9 [2024-02-07 14:31:43,953 INFO L76 edCorrectnessWitness]: Location invariant before [L148-L148] (0 <= i1_14) && (break_15 == (_Bool)0) [2024-02-07 14:31:43,955 INFO L76 edCorrectnessWitness]: Location invariant before [L137-L137] i1_14 == 0 [2024-02-07 14:31:43,955 INFO L76 edCorrectnessWitness]: Location invariant before [L64-L64] (0 <= i1_9) && (break_10 == (_Bool)0) [2024-02-07 14:31:43,955 INFO L76 edCorrectnessWitness]: Location invariant before [L202-L202] result_13 == -1 [2024-02-07 14:31:43,955 INFO L76 edCorrectnessWitness]: Location invariant before [L58-L58] 0 <= i1_9 [2024-02-07 14:31:43,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:31:44,199 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c[12847,12860] [2024-02-07 14:31:44,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:31:44,212 INFO L203 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local 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-07 14:31:44,350 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c[12847,12860] Start Parsing Local Start Parsing Local [2024-02-07 14:31:44,355 WARN L423 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-07 14:31:44,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:31:44,371 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:31:44,371 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44 WrapperNode [2024-02-07 14:31:44,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:31:44,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:31:44,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:31:44,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:31:44,380 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 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,401 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 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,475 INFO L138 Inliner]: procedures = 25, calls = 307, calls flagged for inlining = 69, calls inlined = 97, statements flattened = 1631 [2024-02-07 14:31:44,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:31:44,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:31:44,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:31:44,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:31:44,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,530 INFO L175 MemorySlicer]: Split 190 memory accesses to 4 slices as follows [2, 2, 2, 184]. 97 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 10 writes are split as follows [0, 1, 1, 8]. [2024-02-07 14:31:44,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:31:44,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:31:44,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:31:44,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:31:44,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44" (1/1) ... [2024-02-07 14:31:44,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:31:44,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:31:44,637 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-07 14:31:44,656 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-07 14:31:44,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:31:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:31:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:31:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:31:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:31:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:31:44,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 14:31:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 14:31:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 14:31:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 14:31:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 14:31:44,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 14:31:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 14:31:44,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 14:31:44,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:31:44,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:31:44,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:31:44,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:31:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:31:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:31:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-07 14:31:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:31:44,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:31:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:31:44,675 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:31:44,838 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:31:44,839 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:31:46,172 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:31:46,172 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:31:47,749 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:31:47,750 INFO L320 CfgBuilder]: Removed 12 assume(true) statements. [2024-02-07 14:31:47,750 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:31:47 BoogieIcfgContainer [2024-02-07 14:31:47,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:31:47,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:31:47,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:31:47,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:31:47,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:31:43" (1/4) ... [2024-02-07 14:31:47,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7271d74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:31:47, skipping insertion in model container [2024-02-07 14:31:47,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:31:43" (2/4) ... [2024-02-07 14:31:47,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7271d74f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:31:47, skipping insertion in model container [2024-02-07 14:31:47,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:31:44" (3/4) ... [2024-02-07 14:31:47,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7271d74f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:31:47, skipping insertion in model container [2024-02-07 14:31:47,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:31:47" (4/4) ... [2024-02-07 14:31:47,760 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-symm.wvr.c [2024-02-07 14:31:47,775 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:31:47,775 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2024-02-07 14:31:47,775 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:31:48,263 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-07 14:31:48,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 195 transitions, 404 flow [2024-02-07 14:31:48,359 INFO L124 PetriNetUnfolderBase]: 28/193 cut-off events. [2024-02-07 14:31:48,360 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-07 14:31:48,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 193 events. 28/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 719 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 128. Up to 7 conditions per place. [2024-02-07 14:31:48,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 195 transitions, 404 flow [2024-02-07 14:31:48,368 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 192 transitions, 396 flow [2024-02-07 14:31:48,436 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:31:48,449 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;@61d862b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:31:48,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 131 error locations. [2024-02-07 14:31:48,467 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:31:48,467 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 14:31:48,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:31:48,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:31:48,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 14:31:48,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:31:48,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:31:48,474 INFO L85 PathProgramCache]: Analyzing trace with hash 168221, now seen corresponding path program 1 times [2024-02-07 14:31:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:31:48,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409471230] [2024-02-07 14:31:48,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:31:48,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:31:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:31:48,922 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-07 14:31:48,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:31:48,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409471230] [2024-02-07 14:31:48,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409471230] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:31:48,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:31:48,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:31:48,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569638626] [2024-02-07 14:31:48,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:31:48,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:31:48,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:31:48,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:31:48,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:31:49,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 195 [2024-02-07 14:31:49,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 192 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-07 14:31:49,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:31:49,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 195 [2024-02-07 14:31:49,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:31:50,701 INFO L124 PetriNetUnfolderBase]: 3605/5944 cut-off events. [2024-02-07 14:31:50,701 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-02-07 14:31:50,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11867 conditions, 5944 events. 3605/5944 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 36978 event pairs, 3069 based on Foata normal form. 264/4318 useless extension candidates. Maximal degree in co-relation 11447. Up to 5813 conditions per place. [2024-02-07 14:31:50,728 INFO L140 encePairwiseOnDemand]: 145/195 looper letters, 121 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-02-07 14:31:50,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 144 transitions, 546 flow [2024-02-07 14:31:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:31:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:31:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2024-02-07 14:31:50,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-02-07 14:31:50,741 INFO L175 Difference]: Start difference. First operand has 171 places, 192 transitions, 396 flow. Second operand 3 states and 240 transitions. [2024-02-07 14:31:50,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 144 transitions, 546 flow [2024-02-07 14:31:50,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 144 transitions, 538 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-07 14:31:50,749 INFO L231 Difference]: Finished difference. Result has 133 places, 144 transitions, 296 flow [2024-02-07 14:31:50,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=133, PETRI_TRANSITIONS=144} [2024-02-07 14:31:50,753 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, -38 predicate places. [2024-02-07 14:31:50,753 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 144 transitions, 296 flow [2024-02-07 14:31:50,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-07 14:31:50,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:31:50,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-07 14:31:50,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:31:50,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:31:50,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:31:50,755 INFO L85 PathProgramCache]: Analyzing trace with hash 721865712, now seen corresponding path program 1 times [2024-02-07 14:31:50,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:31:50,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392254451] [2024-02-07 14:31:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:31:50,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:31:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:31:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:50,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:31:50,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392254451] [2024-02-07 14:31:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392254451] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:31:50,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:31:50,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:31:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188883071] [2024-02-07 14:31:50,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:31:50,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:31:50,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:31:50,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:31:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:31:50,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 195 [2024-02-07 14:31:50,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 144 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-07 14:31:50,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:31:50,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 195 [2024-02-07 14:31:50,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:31:51,975 INFO L124 PetriNetUnfolderBase]: 3613/5968 cut-off events. [2024-02-07 14:31:51,975 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-07 14:31:51,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11839 conditions, 5968 events. 3613/5968 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 37080 event pairs, 3069 based on Foata normal form. 0/4082 useless extension candidates. Maximal degree in co-relation 11799. Up to 5825 conditions per place. [2024-02-07 14:31:51,997 INFO L140 encePairwiseOnDemand]: 163/195 looper letters, 111 selfloop transitions, 24 changer transitions 0/160 dead transitions. [2024-02-07 14:31:51,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 160 transitions, 600 flow [2024-02-07 14:31:51,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:31:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:31:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2024-02-07 14:31:51,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40341880341880343 [2024-02-07 14:31:51,999 INFO L175 Difference]: Start difference. First operand has 133 places, 144 transitions, 296 flow. Second operand 3 states and 236 transitions. [2024-02-07 14:31:52,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 160 transitions, 600 flow [2024-02-07 14:31:52,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 160 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:31:52,002 INFO L231 Difference]: Finished difference. Result has 134 places, 160 transitions, 444 flow [2024-02-07 14:31:52,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=134, PETRI_TRANSITIONS=160} [2024-02-07 14:31:52,003 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, -37 predicate places. [2024-02-07 14:31:52,003 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 160 transitions, 444 flow [2024-02-07 14:31:52,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-07 14:31:52,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:31:52,004 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-02-07 14:31:52,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:31:52,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:31:52,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:31:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2071581884, now seen corresponding path program 1 times [2024-02-07 14:31:52,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:31:52,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632383843] [2024-02-07 14:31:52,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:31:52,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:31:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:31:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:52,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:31:52,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632383843] [2024-02-07 14:31:52,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632383843] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:31:52,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434429034] [2024-02-07 14:31:52,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:31:52,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:31:52,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:31:52,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:31:52,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-07 14:31:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:31:52,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-07 14:31:52,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:31:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:52,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:31:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:52,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434429034] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:31:52,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:31:52,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-02-07 14:31:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928214746] [2024-02-07 14:31:52,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:31:52,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:31:52,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:31:52,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:31:52,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:31:52,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 195 [2024-02-07 14:31:52,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 160 transitions, 444 flow. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-07 14:31:52,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:31:52,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 195 [2024-02-07 14:31:52,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:31:53,785 INFO L124 PetriNetUnfolderBase]: 3621/5992 cut-off events. [2024-02-07 14:31:53,786 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-02-07 14:31:53,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11957 conditions, 5992 events. 3621/5992 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 37213 event pairs, 3069 based on Foata normal form. 0/4106 useless extension candidates. Maximal degree in co-relation 11691. Up to 5833 conditions per place. [2024-02-07 14:31:53,809 INFO L140 encePairwiseOnDemand]: 163/195 looper letters, 111 selfloop transitions, 40 changer transitions 0/176 dead transitions. [2024-02-07 14:31:53,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 176 transitions, 810 flow [2024-02-07 14:31:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:31:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:31:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2024-02-07 14:31:53,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3628205128205128 [2024-02-07 14:31:53,811 INFO L175 Difference]: Start difference. First operand has 134 places, 160 transitions, 444 flow. Second operand 4 states and 283 transitions. [2024-02-07 14:31:53,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 176 transitions, 810 flow [2024-02-07 14:31:53,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 176 transitions, 786 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:31:53,815 INFO L231 Difference]: Finished difference. Result has 137 places, 176 transitions, 636 flow [2024-02-07 14:31:53,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=636, PETRI_PLACES=137, PETRI_TRANSITIONS=176} [2024-02-07 14:31:53,815 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, -34 predicate places. [2024-02-07 14:31:53,816 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 176 transitions, 636 flow [2024-02-07 14:31:53,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-07 14:31:53,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:31:53,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:31:53,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-07 14:31:54,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:31:54,032 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:31:54,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:31:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash 206512587, now seen corresponding path program 1 times [2024-02-07 14:31:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:31:54,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357686131] [2024-02-07 14:31:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:31:54,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:31:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:31:54,124 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-07 14:31:54,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:31:54,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357686131] [2024-02-07 14:31:54,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357686131] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:31:54,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:31:54,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:31:54,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431896563] [2024-02-07 14:31:54,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:31:54,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:31:54,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:31:54,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:31:54,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:31:54,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 195 [2024-02-07 14:31:54,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 176 transitions, 636 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-07 14:31:54,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:31:54,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 195 [2024-02-07 14:31:54,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:31:55,479 INFO L124 PetriNetUnfolderBase]: 3613/5984 cut-off events. [2024-02-07 14:31:55,479 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-02-07 14:31:55,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11990 conditions, 5984 events. 3613/5984 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 37220 event pairs, 3069 based on Foata normal form. 8/4106 useless extension candidates. Maximal degree in co-relation 11691. Up to 5778 conditions per place. [2024-02-07 14:31:55,502 INFO L140 encePairwiseOnDemand]: 170/195 looper letters, 124 selfloop transitions, 19 changer transitions 0/168 dead transitions. [2024-02-07 14:31:55,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 168 transitions, 874 flow [2024-02-07 14:31:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:31:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:31:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2024-02-07 14:31:55,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33205128205128204 [2024-02-07 14:31:55,505 INFO L175 Difference]: Start difference. First operand has 137 places, 176 transitions, 636 flow. Second operand 4 states and 259 transitions. [2024-02-07 14:31:55,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 168 transitions, 874 flow [2024-02-07 14:31:55,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 168 transitions, 802 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-02-07 14:31:55,509 INFO L231 Difference]: Finished difference. Result has 138 places, 168 transitions, 554 flow [2024-02-07 14:31:55,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=554, PETRI_PLACES=138, PETRI_TRANSITIONS=168} [2024-02-07 14:31:55,510 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, -33 predicate places. [2024-02-07 14:31:55,510 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 168 transitions, 554 flow [2024-02-07 14:31:55,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-07 14:31:55,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:31:55,510 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-02-07 14:31:55,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:31:55,511 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:31:55,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:31:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2074805656, now seen corresponding path program 2 times [2024-02-07 14:31:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:31:55,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259380264] [2024-02-07 14:31:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:31:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:31:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:31:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:55,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:31:55,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259380264] [2024-02-07 14:31:55,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259380264] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:31:55,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600411097] [2024-02-07 14:31:55,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:31:55,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:31:55,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:31:55,577 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:31:55,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-07 14:31:56,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:31:56,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:31:56,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-07 14:31:56,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:31:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:56,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:31:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:56,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600411097] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:31:56,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:31:56,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-02-07 14:31:56,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911180170] [2024-02-07 14:31:56,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:31:56,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:31:56,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:31:56,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:31:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:31:56,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 195 [2024-02-07 14:31:56,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 168 transitions, 554 flow. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-07 14:31:56,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:31:56,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 195 [2024-02-07 14:31:56,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:31:57,454 INFO L124 PetriNetUnfolderBase]: 3621/6008 cut-off events. [2024-02-07 14:31:57,454 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2024-02-07 14:31:57,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12042 conditions, 6008 events. 3621/6008 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 37288 event pairs, 3069 based on Foata normal form. 0/4122 useless extension candidates. Maximal degree in co-relation 11700. Up to 5833 conditions per place. [2024-02-07 14:31:57,474 INFO L140 encePairwiseOnDemand]: 163/195 looper letters, 111 selfloop transitions, 48 changer transitions 0/184 dead transitions. [2024-02-07 14:31:57,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 184 transitions, 970 flow [2024-02-07 14:31:57,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:31:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:31:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 322 transitions. [2024-02-07 14:31:57,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3302564102564103 [2024-02-07 14:31:57,476 INFO L175 Difference]: Start difference. First operand has 138 places, 168 transitions, 554 flow. Second operand 5 states and 322 transitions. [2024-02-07 14:31:57,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 184 transitions, 970 flow [2024-02-07 14:31:57,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 184 transitions, 950 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:31:57,480 INFO L231 Difference]: Finished difference. Result has 141 places, 184 transitions, 800 flow [2024-02-07 14:31:57,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=800, PETRI_PLACES=141, PETRI_TRANSITIONS=184} [2024-02-07 14:31:57,483 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, -30 predicate places. [2024-02-07 14:31:57,483 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 184 transitions, 800 flow [2024-02-07 14:31:57,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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-07 14:31:57,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:31:57,484 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1] [2024-02-07 14:31:57,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-07 14:31:57,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:31:57,698 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:31:57,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:31:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1023580908, now seen corresponding path program 3 times [2024-02-07 14:31:57,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:31:57,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603242122] [2024-02-07 14:31:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:31:57,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:31:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:31:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:57,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:31:57,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603242122] [2024-02-07 14:31:57,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603242122] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:31:57,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224943249] [2024-02-07 14:31:57,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-07 14:31:57,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:31:57,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:31:57,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:31:57,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-07 14:31:58,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-07 14:31:58,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:31:58,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-07 14:31:58,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:31:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-07 14:31:58,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:31:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-07 14:31:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224943249] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:31:58,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:31:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2024-02-07 14:31:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811100966] [2024-02-07 14:31:58,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:31:58,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-07 14:31:58,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:31:58,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-07 14:31:58,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-02-07 14:31:58,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 195 [2024-02-07 14:31:58,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 184 transitions, 800 flow. Second operand has 11 states, 11 states have (on average 25.0) internal successors, (275), 11 states have internal predecessors, (275), 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-07 14:31:58,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:31:58,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 195 [2024-02-07 14:31:58,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:31:59,955 INFO L124 PetriNetUnfolderBase]: 3637/6044 cut-off events. [2024-02-07 14:31:59,957 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-02-07 14:31:59,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12284 conditions, 6044 events. 3637/6044 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 37429 event pairs, 3069 based on Foata normal form. 0/4164 useless extension candidates. Maximal degree in co-relation 11866. Up to 5801 conditions per place. [2024-02-07 14:31:59,979 INFO L140 encePairwiseOnDemand]: 156/195 looper letters, 134 selfloop transitions, 93 changer transitions 0/244 dead transitions. [2024-02-07 14:31:59,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 244 transitions, 1496 flow [2024-02-07 14:31:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-07 14:31:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-07 14:31:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 565 transitions. [2024-02-07 14:31:59,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20695970695970695 [2024-02-07 14:31:59,982 INFO L175 Difference]: Start difference. First operand has 141 places, 184 transitions, 800 flow. Second operand 14 states and 565 transitions. [2024-02-07 14:31:59,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 244 transitions, 1496 flow [2024-02-07 14:31:59,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 244 transitions, 1360 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-02-07 14:31:59,986 INFO L231 Difference]: Finished difference. Result has 148 places, 210 transitions, 1082 flow [2024-02-07 14:31:59,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1082, PETRI_PLACES=148, PETRI_TRANSITIONS=210} [2024-02-07 14:31:59,987 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, -23 predicate places. [2024-02-07 14:31:59,987 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 210 transitions, 1082 flow [2024-02-07 14:31:59,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.0) internal successors, (275), 11 states have internal predecessors, (275), 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-07 14:31:59,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:31:59,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:32:00,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-02-07 14:32:00,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:00,202 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:32:00,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:32:00,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1632993126, now seen corresponding path program 1 times [2024-02-07 14:32:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:32:00,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233807149] [2024-02-07 14:32:00,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:00,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:32:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-07 14:32:00,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:32:00,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233807149] [2024-02-07 14:32:00,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233807149] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:32:00,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:32:00,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:32:00,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469992524] [2024-02-07 14:32:00,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:32:00,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:32:00,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:32:00,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:32:00,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:32:00,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 195 [2024-02-07 14:32:00,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 210 transitions, 1082 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-07 14:32:00,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:32:00,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 195 [2024-02-07 14:32:00,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:32:01,383 INFO L124 PetriNetUnfolderBase]: 3637/6036 cut-off events. [2024-02-07 14:32:01,384 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2024-02-07 14:32:01,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12312 conditions, 6036 events. 3637/6036 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 37374 event pairs, 3069 based on Foata normal form. 4/4160 useless extension candidates. Maximal degree in co-relation 12221. Up to 5831 conditions per place. [2024-02-07 14:32:01,402 INFO L140 encePairwiseOnDemand]: 185/195 looper letters, 171 selfloop transitions, 10 changer transitions 0/202 dead transitions. [2024-02-07 14:32:01,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 202 transitions, 1428 flow [2024-02-07 14:32:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:32:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:32:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2024-02-07 14:32:01,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3282051282051282 [2024-02-07 14:32:01,404 INFO L175 Difference]: Start difference. First operand has 148 places, 210 transitions, 1082 flow. Second operand 3 states and 192 transitions. [2024-02-07 14:32:01,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 202 transitions, 1428 flow [2024-02-07 14:32:01,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 202 transitions, 1104 flow, removed 114 selfloop flow, removed 4 redundant places. [2024-02-07 14:32:01,408 INFO L231 Difference]: Finished difference. Result has 138 places, 202 transitions, 762 flow [2024-02-07 14:32:01,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=138, PETRI_TRANSITIONS=202} [2024-02-07 14:32:01,409 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, -33 predicate places. [2024-02-07 14:32:01,409 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 202 transitions, 762 flow [2024-02-07 14:32:01,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-07 14:32:01,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:32:01,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:32:01,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:32:01,410 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:32:01,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:32:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1057438035, now seen corresponding path program 1 times [2024-02-07 14:32:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:32:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505853255] [2024-02-07 14:32:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:32:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-07 14:32:01,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:32:01,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505853255] [2024-02-07 14:32:01,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505853255] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:32:01,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:32:01,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:32:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962116752] [2024-02-07 14:32:01,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:32:01,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:32:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:32:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:32:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:32:01,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 195 [2024-02-07 14:32:01,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 202 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-07 14:32:01,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:32:01,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 195 [2024-02-07 14:32:01,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:32:02,735 INFO L124 PetriNetUnfolderBase]: 3637/6032 cut-off events. [2024-02-07 14:32:02,735 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-02-07 14:32:02,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12151 conditions, 6032 events. 3637/6032 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 37418 event pairs, 3069 based on Foata normal form. 2/4156 useless extension candidates. Maximal degree in co-relation 12077. Up to 5849 conditions per place. [2024-02-07 14:32:02,754 INFO L140 encePairwiseOnDemand]: 189/195 looper letters, 167 selfloop transitions, 10 changer transitions 0/198 dead transitions. [2024-02-07 14:32:02,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 198 transitions, 1108 flow [2024-02-07 14:32:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:32:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:32:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2024-02-07 14:32:02,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3145299145299145 [2024-02-07 14:32:02,756 INFO L175 Difference]: Start difference. First operand has 138 places, 202 transitions, 762 flow. Second operand 3 states and 184 transitions. [2024-02-07 14:32:02,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 198 transitions, 1108 flow [2024-02-07 14:32:02,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 198 transitions, 1088 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:32:02,760 INFO L231 Difference]: Finished difference. Result has 134 places, 198 transitions, 754 flow [2024-02-07 14:32:02,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=134, PETRI_TRANSITIONS=198} [2024-02-07 14:32:02,761 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, -37 predicate places. [2024-02-07 14:32:02,761 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 198 transitions, 754 flow [2024-02-07 14:32:02,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-07 14:32:02,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:32:02,762 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:32:02,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:32:02,762 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:32:02,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:32:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash 225860551, now seen corresponding path program 1 times [2024-02-07 14:32:02,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:32:02,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370161560] [2024-02-07 14:32:02,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:02,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:32:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-02-07 14:32:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:32:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370161560] [2024-02-07 14:32:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370161560] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:32:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164133628] [2024-02-07 14:32:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:02,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:02,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:32:02,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:32:02,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-07 14:32:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:03,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-07 14:32:03,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:32:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-02-07 14:32:03,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:32:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-02-07 14:32:03,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164133628] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:32:03,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:32:03,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-02-07 14:32:03,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410358808] [2024-02-07 14:32:03,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:32:03,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-07 14:32:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:32:03,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-07 14:32:03,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-02-07 14:32:03,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 195 [2024-02-07 14:32:03,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 198 transitions, 754 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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-07 14:32:03,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:32:03,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 195 [2024-02-07 14:32:03,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:32:05,074 INFO L124 PetriNetUnfolderBase]: 3609/6004 cut-off events. [2024-02-07 14:32:05,075 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-02-07 14:32:05,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12107 conditions, 6004 events. 3609/6004 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 37216 event pairs, 3069 based on Foata normal form. 28/4149 useless extension candidates. Maximal degree in co-relation 11813. Up to 5777 conditions per place. [2024-02-07 14:32:05,097 INFO L140 encePairwiseOnDemand]: 162/195 looper letters, 132 selfloop transitions, 67 changer transitions 0/204 dead transitions. [2024-02-07 14:32:05,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 204 transitions, 1135 flow [2024-02-07 14:32:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-07 14:32:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-07 14:32:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 304 transitions. [2024-02-07 14:32:05,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.11992110453648915 [2024-02-07 14:32:05,099 INFO L175 Difference]: Start difference. First operand has 134 places, 198 transitions, 754 flow. Second operand 13 states and 304 transitions. [2024-02-07 14:32:05,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 204 transitions, 1135 flow [2024-02-07 14:32:05,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 204 transitions, 1129 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:32:05,104 INFO L231 Difference]: Finished difference. Result has 146 places, 176 transitions, 823 flow [2024-02-07 14:32:05,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=823, PETRI_PLACES=146, PETRI_TRANSITIONS=176} [2024-02-07 14:32:05,104 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, -25 predicate places. [2024-02-07 14:32:05,105 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 176 transitions, 823 flow [2024-02-07 14:32:05,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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-07 14:32:05,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:32:05,105 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:32:05,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-07 14:32:05,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:05,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:32:05,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:32:05,319 INFO L85 PathProgramCache]: Analyzing trace with hash 844785732, now seen corresponding path program 2 times [2024-02-07 14:32:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:32:05,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531678724] [2024-02-07 14:32:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:05,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:32:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-02-07 14:32:05,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:32:05,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531678724] [2024-02-07 14:32:05,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531678724] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:32:05,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755557088] [2024-02-07 14:32:05,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:32:05,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:05,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:32:05,818 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:32:05,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-07 14:32:06,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:32:06,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:32:06,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 16 conjunts are in the unsatisfiable core [2024-02-07 14:32:06,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:32:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-02-07 14:32:06,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:32:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-02-07 14:32:06,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755557088] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:32:06,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:32:06,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 15 [2024-02-07 14:32:06,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186317332] [2024-02-07 14:32:06,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:32:06,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-07 14:32:06,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:32:06,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-07 14:32:06,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-02-07 14:32:06,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 195 [2024-02-07 14:32:06,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 176 transitions, 823 flow. Second operand has 16 states, 16 states have (on average 17.625) internal successors, (282), 16 states have internal predecessors, (282), 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-07 14:32:06,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:32:06,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 195 [2024-02-07 14:32:06,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:32:08,449 INFO L124 PetriNetUnfolderBase]: 3609/6032 cut-off events. [2024-02-07 14:32:08,449 INFO L125 PetriNetUnfolderBase]: For 643/643 co-relation queries the response was YES. [2024-02-07 14:32:08,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12315 conditions, 6032 events. 3609/6032 cut-off events. For 643/643 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 37191 event pairs, 3069 based on Foata normal form. 28/4182 useless extension candidates. Maximal degree in co-relation 11974. Up to 5828 conditions per place. [2024-02-07 14:32:08,471 INFO L140 encePairwiseOnDemand]: 186/195 looper letters, 136 selfloop transitions, 29 changer transitions 0/190 dead transitions. [2024-02-07 14:32:08,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 190 transitions, 1335 flow [2024-02-07 14:32:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-07 14:32:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-07 14:32:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 390 transitions. [2024-02-07 14:32:08,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.13333333333333333 [2024-02-07 14:32:08,481 INFO L175 Difference]: Start difference. First operand has 146 places, 176 transitions, 823 flow. Second operand 15 states and 390 transitions. [2024-02-07 14:32:08,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 190 transitions, 1335 flow [2024-02-07 14:32:08,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 190 transitions, 1315 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:32:08,486 INFO L231 Difference]: Finished difference. Result has 165 places, 190 transitions, 1117 flow [2024-02-07 14:32:08,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1117, PETRI_PLACES=165, PETRI_TRANSITIONS=190} [2024-02-07 14:32:08,487 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, -6 predicate places. [2024-02-07 14:32:08,487 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 190 transitions, 1117 flow [2024-02-07 14:32:08,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 17.625) internal successors, (282), 16 states have internal predecessors, (282), 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-07 14:32:08,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:32:08,487 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 12, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:32:08,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-07 14:32:08,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-02-07 14:32:08,701 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:32:08,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:32:08,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1904945852, now seen corresponding path program 3 times [2024-02-07 14:32:08,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:32:08,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684998339] [2024-02-07 14:32:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:08,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:32:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-02-07 14:32:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:32:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684998339] [2024-02-07 14:32:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684998339] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:32:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752287502] [2024-02-07 14:32:09,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-07 14:32:09,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:09,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:32:09,405 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:32:09,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-07 14:32:09,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-07 14:32:09,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:32:09,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-07 14:32:09,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:32:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-02-07 14:32:10,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-07 14:32:10,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752287502] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:32:10,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-07 14:32:10,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2024-02-07 14:32:10,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281524238] [2024-02-07 14:32:10,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:32:10,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:32:10,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:32:10,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:32:10,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-02-07 14:32:10,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 195 [2024-02-07 14:32:10,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 190 transitions, 1117 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-07 14:32:10,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:32:10,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 195 [2024-02-07 14:32:10,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:32:11,398 INFO L124 PetriNetUnfolderBase]: 3609/6030 cut-off events. [2024-02-07 14:32:11,398 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2024-02-07 14:32:11,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12412 conditions, 6030 events. 3609/6030 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 37187 event pairs, 3069 based on Foata normal form. 2/4154 useless extension candidates. Maximal degree in co-relation 12034. Up to 5864 conditions per place. [2024-02-07 14:32:11,430 INFO L140 encePairwiseOnDemand]: 186/195 looper letters, 151 selfloop transitions, 34 changer transitions 0/190 dead transitions. [2024-02-07 14:32:11,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 190 transitions, 1443 flow [2024-02-07 14:32:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:32:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:32:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-02-07 14:32:11,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1641025641025641 [2024-02-07 14:32:11,432 INFO L175 Difference]: Start difference. First operand has 165 places, 190 transitions, 1117 flow. Second operand 5 states and 160 transitions. [2024-02-07 14:32:11,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 190 transitions, 1443 flow [2024-02-07 14:32:11,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 190 transitions, 1228 flow, removed 68 selfloop flow, removed 11 redundant places. [2024-02-07 14:32:11,437 INFO L231 Difference]: Finished difference. Result has 157 places, 190 transitions, 962 flow [2024-02-07 14:32:11,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=962, PETRI_PLACES=157, PETRI_TRANSITIONS=190} [2024-02-07 14:32:11,438 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, -14 predicate places. [2024-02-07 14:32:11,438 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 190 transitions, 962 flow [2024-02-07 14:32:11,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-07 14:32:11,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:32:11,439 INFO L208 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:32:11,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-07 14:32:11,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:11,652 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:32:11,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:32:11,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1725849803, now seen corresponding path program 1 times [2024-02-07 14:32:11,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:32:11,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139897667] [2024-02-07 14:32:11,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:32:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-02-07 14:32:12,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:32:12,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139897667] [2024-02-07 14:32:12,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139897667] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:32:12,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000550998] [2024-02-07 14:32:12,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:12,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:12,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:32:12,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:32:12,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-07 14:32:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:12,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 16 conjunts are in the unsatisfiable core [2024-02-07 14:32:12,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:32:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-02-07 14:32:13,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:32:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-02-07 14:32:13,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000550998] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:32:13,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:32:13,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2024-02-07 14:32:13,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890971566] [2024-02-07 14:32:13,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:32:13,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-02-07 14:32:13,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:32:13,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-02-07 14:32:13,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=1176, Unknown=0, NotChecked=0, Total=1806 [2024-02-07 14:32:13,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 195 [2024-02-07 14:32:13,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 190 transitions, 962 flow. Second operand has 43 states, 43 states have (on average 9.837209302325581) internal successors, (423), 43 states have internal predecessors, (423), 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-07 14:32:13,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:32:13,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 195 [2024-02-07 14:32:13,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:32:15,031 INFO L124 PetriNetUnfolderBase]: 3609/6032 cut-off events. [2024-02-07 14:32:15,031 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-02-07 14:32:15,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12395 conditions, 6032 events. 3609/6032 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 37183 event pairs, 3069 based on Foata normal form. 2/4156 useless extension candidates. Maximal degree in co-relation 12038. Up to 5804 conditions per place. [2024-02-07 14:32:15,053 INFO L140 encePairwiseOnDemand]: 168/195 looper letters, 146 selfloop transitions, 81 changer transitions 0/232 dead transitions. [2024-02-07 14:32:15,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 232 transitions, 1690 flow [2024-02-07 14:32:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-07 14:32:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-07 14:32:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 353 transitions. [2024-02-07 14:32:15,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.09051282051282052 [2024-02-07 14:32:15,056 INFO L175 Difference]: Start difference. First operand has 157 places, 190 transitions, 962 flow. Second operand 20 states and 353 transitions. [2024-02-07 14:32:15,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 232 transitions, 1690 flow [2024-02-07 14:32:15,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 232 transitions, 1682 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:32:15,061 INFO L231 Difference]: Finished difference. Result has 177 places, 194 transitions, 1198 flow [2024-02-07 14:32:15,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1198, PETRI_PLACES=177, PETRI_TRANSITIONS=194} [2024-02-07 14:32:15,062 INFO L281 CegarLoopForPetriNet]: 171 programPoint places, 6 predicate places. [2024-02-07 14:32:15,062 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 194 transitions, 1198 flow [2024-02-07 14:32:15,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 9.837209302325581) internal successors, (423), 43 states have internal predecessors, (423), 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-07 14:32:15,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:32:15,063 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:32:15,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-07 14:32:15,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:15,277 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (and 128 more)] === [2024-02-07 14:32:15,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:32:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1569613942, now seen corresponding path program 2 times [2024-02-07 14:32:15,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:32:15,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090610987] [2024-02-07 14:32:15,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:15,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:32:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:32:15,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:32:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:32:15,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:32:15,681 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:32:15,682 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 131 remaining) [2024-02-07 14:32:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 131 remaining) [2024-02-07 14:32:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 131 remaining) [2024-02-07 14:32:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 131 remaining) [2024-02-07 14:32:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 131 remaining) [2024-02-07 14:32:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 131 remaining) [2024-02-07 14:32:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 131 remaining) [2024-02-07 14:32:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 131 remaining) [2024-02-07 14:32:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 131 remaining) [2024-02-07 14:32:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 131 remaining) [2024-02-07 14:32:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 131 remaining) [2024-02-07 14:32:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 131 remaining) [2024-02-07 14:32:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 131 remaining) [2024-02-07 14:32:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 131 remaining) [2024-02-07 14:32:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 131 remaining) [2024-02-07 14:32:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 131 remaining) [2024-02-07 14:32:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 131 remaining) [2024-02-07 14:32:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 131 remaining) [2024-02-07 14:32:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 131 remaining) [2024-02-07 14:32:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 131 remaining) [2024-02-07 14:32:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 131 remaining) [2024-02-07 14:32:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 131 remaining) [2024-02-07 14:32:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 131 remaining) [2024-02-07 14:32:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 131 remaining) [2024-02-07 14:32:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 131 remaining) [2024-02-07 14:32:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 131 remaining) [2024-02-07 14:32:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 131 remaining) [2024-02-07 14:32:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 131 remaining) [2024-02-07 14:32:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 131 remaining) [2024-02-07 14:32:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 131 remaining) [2024-02-07 14:32:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 131 remaining) [2024-02-07 14:32:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 131 remaining) [2024-02-07 14:32:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 131 remaining) [2024-02-07 14:32:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 131 remaining) [2024-02-07 14:32:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 131 remaining) [2024-02-07 14:32:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 131 remaining) [2024-02-07 14:32:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 131 remaining) [2024-02-07 14:32:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 131 remaining) [2024-02-07 14:32:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 131 remaining) [2024-02-07 14:32:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 131 remaining) [2024-02-07 14:32:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 131 remaining) [2024-02-07 14:32:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 131 remaining) [2024-02-07 14:32:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 131 remaining) [2024-02-07 14:32:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 131 remaining) [2024-02-07 14:32:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 131 remaining) [2024-02-07 14:32:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 131 remaining) [2024-02-07 14:32:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 131 remaining) [2024-02-07 14:32:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 131 remaining) [2024-02-07 14:32:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 131 remaining) [2024-02-07 14:32:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 131 remaining) [2024-02-07 14:32:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 131 remaining) [2024-02-07 14:32:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 131 remaining) [2024-02-07 14:32:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 131 remaining) [2024-02-07 14:32:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 131 remaining) [2024-02-07 14:32:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 131 remaining) [2024-02-07 14:32:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 131 remaining) [2024-02-07 14:32:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 131 remaining) [2024-02-07 14:32:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 131 remaining) [2024-02-07 14:32:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 131 remaining) [2024-02-07 14:32:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 131 remaining) [2024-02-07 14:32:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 131 remaining) [2024-02-07 14:32:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 131 remaining) [2024-02-07 14:32:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 131 remaining) [2024-02-07 14:32:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 131 remaining) [2024-02-07 14:32:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 131 remaining) [2024-02-07 14:32:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 131 remaining) [2024-02-07 14:32:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 131 remaining) [2024-02-07 14:32:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 131 remaining) [2024-02-07 14:32:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 131 remaining) [2024-02-07 14:32:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 131 remaining) [2024-02-07 14:32:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 131 remaining) [2024-02-07 14:32:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 131 remaining) [2024-02-07 14:32:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 131 remaining) [2024-02-07 14:32:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 131 remaining) [2024-02-07 14:32:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 131 remaining) [2024-02-07 14:32:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 131 remaining) [2024-02-07 14:32:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 131 remaining) [2024-02-07 14:32:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (53 of 131 remaining) [2024-02-07 14:32:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 131 remaining) [2024-02-07 14:32:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 131 remaining) [2024-02-07 14:32:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 131 remaining) [2024-02-07 14:32:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 131 remaining) [2024-02-07 14:32:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 131 remaining) [2024-02-07 14:32:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 131 remaining) [2024-02-07 14:32:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 131 remaining) [2024-02-07 14:32:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 131 remaining) [2024-02-07 14:32:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 131 remaining) [2024-02-07 14:32:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 131 remaining) [2024-02-07 14:32:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 131 remaining) [2024-02-07 14:32:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 131 remaining) [2024-02-07 14:32:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 131 remaining) [2024-02-07 14:32:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 131 remaining) [2024-02-07 14:32:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 131 remaining) [2024-02-07 14:32:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 131 remaining) [2024-02-07 14:32:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 131 remaining) [2024-02-07 14:32:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 131 remaining) [2024-02-07 14:32:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 131 remaining) [2024-02-07 14:32:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 131 remaining) [2024-02-07 14:32:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 131 remaining) [2024-02-07 14:32:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 131 remaining) [2024-02-07 14:32:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 131 remaining) [2024-02-07 14:32:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 131 remaining) [2024-02-07 14:32:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 131 remaining) [2024-02-07 14:32:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 131 remaining) [2024-02-07 14:32:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 131 remaining) [2024-02-07 14:32:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 131 remaining) [2024-02-07 14:32:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 131 remaining) [2024-02-07 14:32:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 131 remaining) [2024-02-07 14:32:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 131 remaining) [2024-02-07 14:32:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 131 remaining) [2024-02-07 14:32:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 131 remaining) [2024-02-07 14:32:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 131 remaining) [2024-02-07 14:32:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 131 remaining) [2024-02-07 14:32:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 131 remaining) [2024-02-07 14:32:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 131 remaining) [2024-02-07 14:32:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 131 remaining) [2024-02-07 14:32:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 131 remaining) [2024-02-07 14:32:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 131 remaining) [2024-02-07 14:32:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 131 remaining) [2024-02-07 14:32:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 131 remaining) [2024-02-07 14:32:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 131 remaining) [2024-02-07 14:32:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 131 remaining) [2024-02-07 14:32:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 131 remaining) [2024-02-07 14:32:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 131 remaining) [2024-02-07 14:32:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 131 remaining) [2024-02-07 14:32:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 131 remaining) [2024-02-07 14:32:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 131 remaining) [2024-02-07 14:32:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 131 remaining) [2024-02-07 14:32:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 131 remaining) [2024-02-07 14:32:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 131 remaining) [2024-02-07 14:32:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 131 remaining) [2024-02-07 14:32:15,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 14:32:15,702 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1] [2024-02-07 14:32:15,710 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:32:15,710 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:32:15,902 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 14:32:15,907 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 14:32:15,909 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 14:32:15,912 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 14:32:15,922 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 14:32:15,924 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 14:32:15,928 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 14:32:15,933 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 14:32:15,986 INFO L503 ceAbstractionStarter]: Automizer considered 76 witness invariants [2024-02-07 14:32:15,986 INFO L504 ceAbstractionStarter]: WitnessConsidered=76 [2024-02-07 14:32:15,987 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:32:15 BasicIcfg [2024-02-07 14:32:15,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:32:15,987 INFO L158 Benchmark]: Toolchain (without parser) took 32111.44ms. Allocated memory was 144.7MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 106.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-02-07 14:32:15,987 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:32:15,987 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 144.7MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:32:15,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.23ms. Allocated memory is still 144.7MB. Free memory was 106.2MB in the beginning and 72.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 14:32:15,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.88ms. Allocated memory is still 144.7MB. Free memory was 72.6MB in the beginning and 63.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-02-07 14:32:15,988 INFO L158 Benchmark]: Boogie Preprocessor took 129.71ms. Allocated memory is still 144.7MB. Free memory was 63.3MB in the beginning and 51.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-02-07 14:32:15,988 INFO L158 Benchmark]: RCFGBuilder took 3144.29ms. Allocated memory was 144.7MB in the beginning and 289.4MB in the end (delta: 144.7MB). Free memory was 51.7MB in the beginning and 200.9MB in the end (delta: -149.2MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. [2024-02-07 14:32:15,988 INFO L158 Benchmark]: TraceAbstraction took 28234.42ms. Allocated memory was 289.4MB in the beginning and 3.2GB in the end (delta: 2.9GB). Free memory was 199.8MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-02-07 14:32:15,989 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 is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.18ms. Allocated memory is still 144.7MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.23ms. Allocated memory is still 144.7MB. Free memory was 106.2MB in the beginning and 72.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.88ms. Allocated memory is still 144.7MB. Free memory was 72.6MB in the beginning and 63.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.71ms. Allocated memory is still 144.7MB. Free memory was 63.3MB in the beginning and 51.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 3144.29ms. Allocated memory was 144.7MB in the beginning and 289.4MB in the end (delta: 144.7MB). Free memory was 51.7MB in the beginning and 200.9MB in the end (delta: -149.2MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. * TraceAbstraction took 28234.42ms. Allocated memory was 289.4MB in the beginning and 3.2GB in the end (delta: 2.9GB). Free memory was 199.8MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 252]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] 0 int *index_of_0, *char_at_1, *count_occurrences_of_2, *last_index_of_3, *index_of_4, *char_at_5, *count_occurrences_of_6, *last_index_of_7; [L42] 0 int result_8, i1_9, i2_11, result_13, i1_14, i2_16; [L43] 0 _Bool break_10, break_12, break_15, break_17; [L217] 0 pthread_t t1, t2; [L219] CALL, EXPR 0 create_fresh_int_array(5) [L241] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L241] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L241] RET 0 assume_abort_if_not(size >= 0) [L242] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L242] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L242] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L244] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L245] 0 int i = 0; VAL [\old(size)=5, arr={-2:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={0:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND TRUE 0 i < size VAL [\old(size)=5, arr={-2:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={0:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=5, arr={-2:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={0:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND TRUE 0 i < size VAL [\old(size)=5, arr={-2:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={0:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=5, arr={-2:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={0:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND TRUE 0 i < size VAL [\old(size)=5, arr={-2:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={0:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=5, arr={-2:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={0:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND TRUE 0 i < size VAL [\old(size)=5, arr={-2:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={0:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=5, arr={-2:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={0:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND TRUE 0 i < size VAL [\old(size)=5, arr={-2:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={0:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=5, arr={-2:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=5, index_of_0={0:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND FALSE 0 !(i < size) [L248] 0 return arr; [L219] RET, EXPR 0 create_fresh_int_array(5) [L219] 0 index_of_0 = create_fresh_int_array(5) [L220] CALL, EXPR 0 create_fresh_int_array(5) [L241] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L241] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L241] RET 0 assume_abort_if_not(size >= 0) [L242] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L242] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L242] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L244] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L245] 0 int i = 0; VAL [\old(size)=5, arr={-7:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND TRUE 0 i < size VAL [\old(size)=5, arr={-7:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=5, arr={-7:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND TRUE 0 i < size VAL [\old(size)=5, arr={-7:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=5, arr={-7:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND TRUE 0 i < size VAL [\old(size)=5, arr={-7:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=5, arr={-7:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND TRUE 0 i < size VAL [\old(size)=5, arr={-7:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=5, arr={-7:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={-2:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND TRUE 0 i < size VAL [\old(size)=5, arr={-7:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={-2:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=5, arr={-7:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=5, index_of_0={-2:0}, index_of_4={0:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=5] [L245] COND FALSE 0 !(i < size) [L248] 0 return arr; [L220] RET, EXPR 0 create_fresh_int_array(5) [L220] 0 index_of_4 = create_fresh_int_array(5) [L221] CALL, EXPR 0 create_fresh_int_array(4) [L241] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L241] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L241] RET 0 assume_abort_if_not(size >= 0) [L242] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L242] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L242] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L244] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L245] 0 int i = 0; VAL [\old(size)=4, arr={-11:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-11:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-11:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-11:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-11:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-11:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-11:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-11:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-11:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={0:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND FALSE 0 !(i < size) [L248] 0 return arr; [L221] RET, EXPR 0 create_fresh_int_array(4) [L221] 0 count_occurrences_of_2 = create_fresh_int_array(4) [L222] CALL, EXPR 0 create_fresh_int_array(4) [L241] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L241] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L241] RET 0 assume_abort_if_not(size >= 0) [L242] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L242] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L242] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L244] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L245] 0 int i = 0; VAL [\old(size)=4, arr={-14:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-14:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-14:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-14:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-14:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-14:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-14:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-14:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-14:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={0:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND FALSE 0 !(i < size) [L248] 0 return arr; [L222] RET, EXPR 0 create_fresh_int_array(4) [L222] 0 count_occurrences_of_6 = create_fresh_int_array(4) [L223] CALL, EXPR 0 create_fresh_int_array(4) [L241] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L241] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L241] RET 0 assume_abort_if_not(size >= 0) [L242] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L242] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L242] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L244] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L245] 0 int i = 0; VAL [\old(size)=4, arr={-17:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-17:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-17:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-17:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-17:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-17:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-17:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-17:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-17:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={0:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND FALSE 0 !(i < size) [L248] 0 return arr; [L223] RET, EXPR 0 create_fresh_int_array(4) [L223] 0 last_index_of_3 = create_fresh_int_array(4) [L224] CALL, EXPR 0 create_fresh_int_array(4) [L241] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L241] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L241] RET 0 assume_abort_if_not(size >= 0) [L242] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L242] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L242] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L244] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L245] 0 int i = 0; VAL [\old(size)=4, arr={-20:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-20:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-20:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-20:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-20:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-20:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-20:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND TRUE 0 i < size VAL [\old(size)=4, arr={-20:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=4, arr={-20:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={0:0}, result_13=0, result_8=0, size=4] [L245] COND FALSE 0 !(i < size) [L248] 0 return arr; [L224] RET, EXPR 0 create_fresh_int_array(4) [L224] 0 last_index_of_7 = create_fresh_int_array(4) [L225] CALL, EXPR 0 create_fresh_int_array(13) [L241] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L241] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L241] RET 0 assume_abort_if_not(size >= 0) [L242] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L242] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L242] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L244] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L245] 0 int i = 0; VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=5, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=5, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=6, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=6, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=7, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=7, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=8, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=8, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=9, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=9, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=10, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=10, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=11, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=11, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=12, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=12, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-23:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={0:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=13, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND FALSE 0 !(i < size) [L248] 0 return arr; [L225] RET, EXPR 0 create_fresh_int_array(13) [L225] 0 char_at_1 = create_fresh_int_array(13) [L226] CALL, EXPR 0 create_fresh_int_array(13) [L241] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L241] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L241] RET 0 assume_abort_if_not(size >= 0) [L242] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[13]]],BinaryExpression[COMPLEQ,IdentifierExpression[size],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[4]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[size],IntegerLiteral[13]]]]]] [L242] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L242] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L244] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L245] 0 int i = 0; VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=1, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=2, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=3, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=4, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=5, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=5, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=6, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=6, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=7, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=7, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=8, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=8, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=9, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=9, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=10, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=10, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=11, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=11, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=12, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND TRUE 0 i < size VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=12, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L246] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[13],IdentifierExpression[size]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[12]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L246] 0 arr[i] = __VERIFIER_nondet_int() [L245] 0 i++ VAL [\old(size)=13, arr={-31:0}, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={0:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, i=13, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, size=13] [L245] COND FALSE 0 !(i < size) [L248] 0 return arr; [L226] RET, EXPR 0 create_fresh_int_array(13) [L226] 0 char_at_5 = create_fresh_int_array(13) [L229] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={-31:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0, t1={6:0}, t2={3:0}] [L49] COND FALSE 1 !(__VERIFIER_nondet_bool()) [L68] COND TRUE 1 __VERIFIER_nondet_bool() [L70] EXPR 1 index_of_0[4] [L70] EXPR 1 ( index_of_0[4] != ( 0 - 1 ) ) || ( index_of_4[4] != ( 0 - 1 ) ) [L70] EXPR 1 ( index_of_0[4] != ( 0 - 1 ) ) || ( index_of_4[4] != ( 0 - 1 ) ) [L70] EXPR 1 index_of_4[4] [L70] EXPR 1 ( index_of_0[4] != ( 0 - 1 ) ) || ( index_of_4[4] != ( 0 - 1 ) ) [L70] EXPR 1 ( ( index_of_0[4] != ( 0 - 1 ) ) || ( index_of_4[4] != ( 0 - 1 ) ) ) && !( index_of_0[4] == index_of_4[4] ) [L70] EXPR 1 ( ( index_of_0[4] != ( 0 - 1 ) ) || ( index_of_4[4] != ( 0 - 1 ) ) ) && !( index_of_0[4] == index_of_4[4] ) [L70] EXPR 1 index_of_0[4] [L70] EXPR 1 index_of_4[4] [L70] EXPR 1 ( ( index_of_0[4] != ( 0 - 1 ) ) || ( index_of_4[4] != ( 0 - 1 ) ) ) && !( index_of_0[4] == index_of_4[4] ) [L70] CALL 1 assume_abort_if_not ( ( ( index_of_0[4] != ( 0 - 1 ) ) || ( index_of_4[4] != ( 0 - 1 ) ) ) && !( index_of_0[4] == index_of_4[4] ) ) [L38] COND FALSE 1 !(!cond) [L70] RET 1 assume_abort_if_not ( ( ( index_of_0[4] != ( 0 - 1 ) ) || ( index_of_4[4] != ( 0 - 1 ) ) ) && !( index_of_0[4] == index_of_4[4] ) ) [L71] EXPR 1 index_of_0[4] [L71] EXPR 1 index_of_4[4] [L71] CALL 1 minus(index_of_0[4], index_of_4[4]) [L252] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=-1, \old(b)=0, a=-1, b=0, break_10=0, break_12=0, break_15=0, break_17=0, char_at_1={-23:0}, char_at_5={-31:0}, count_occurrences_of_2={-11:0}, count_occurrences_of_6={-14:0}, i1_14=0, i1_9=0, i2_11=0, i2_16=0, index_of_0={-2:0}, index_of_4={-7:0}, last_index_of_3={-17:0}, last_index_of_7={-20:0}, result_13=0, result_8=0] - 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: 253]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 252]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 253]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 252]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 253]: 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: 252]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 253]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 110]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 138]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 252]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 253]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 252]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 253]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 165]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 166]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 142]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 143]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 144]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 252]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 253]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 252]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 253]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 194]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 169]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 170]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 171]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 202]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 210]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 241]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 242]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 241]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 242]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 241]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 242]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 241]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 242]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 241]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 242]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 241]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 242]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 241]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 242]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 241]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 242]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 235]: 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: 230]: 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: 229]: 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, 270 locations, 131 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: 27.4s, OverallIterations: 13, TraceHistogramMax: 13, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1409 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1093 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 740 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7107 IncrementalHoareTripleChecker+Invalid, 7847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 740 mSolverCounterUnsat, 28 mSDtfsCounter, 7107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 744 GetRequests, 624 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1198occurred in iteration=12, InterpolantAutomatonStates: 92, 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.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 965 NumberOfCodeBlocks, 899 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1093 ConstructedInterpolants, 0 QuantifiedInterpolants, 2361 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2908 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 1628/2354 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-07 14:32:16,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE