/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 13:34:21,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 13:34:21,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 13:34:21,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 13:34:21,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 13:34:21,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 13:34:21,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 13:34:21,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 13:34:21,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 13:34:21,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 13:34:21,229 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 13:34:21,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 13:34:21,231 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 13:34:21,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 13:34:21,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 13:34:21,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 13:34:21,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 13:34:21,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 13:34:21,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 13:34:21,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 13:34:21,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 13:34:21,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 13:34:21,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 13:34:21,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 13:34:21,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 13:34:21,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 13:34:21,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 13:34:21,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 13:34:21,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 13:34:21,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 13:34:21,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 13:34:21,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 13:34:21,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 13:34:21,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 13:34:21,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 13:34:21,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 13:34:21,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 13:34:21,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 13:34:21,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 13:34:21,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 13:34:21,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 13:34:21,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 13:34:21,298 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 13:34:21,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 13:34:21,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 13:34:21,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 13:34:21,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 13:34:21,300 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 13:34:21,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 13:34:21,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 13:34:21,300 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 13:34:21,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 13:34:21,301 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 13:34:21,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 13:34:21,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 13:34:21,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 13:34:21,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 13:34:21,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 13:34:21,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 13:34:21,302 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 13:34:21,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 13:34:21,302 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 13:34:21,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 13:34:21,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 13:34:21,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 13:34:21,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 13:34:21,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 13:34:21,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 13:34:21,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 13:34:21,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 13:34:21,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 13:34:21,304 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 13:34:21,304 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 13:34:21,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 13:34:21,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 13:34:21,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 13:34:21,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 13:34:21,305 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 13:34:21,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-04 13:34:21,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 13:34:21,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 13:34:21,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 13:34:21,584 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 13:34:21,584 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 13:34:21,585 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2023-05-04 13:34:21,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437ba3aa5/199f83974e5a4ab2a4212e8cf13dc328/FLAG41c98021a [2023-05-04 13:34:22,088 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 13:34:22,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2023-05-04 13:34:22,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437ba3aa5/199f83974e5a4ab2a4212e8cf13dc328/FLAG41c98021a [2023-05-04 13:34:22,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437ba3aa5/199f83974e5a4ab2a4212e8cf13dc328 [2023-05-04 13:34:22,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 13:34:22,436 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 13:34:22,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 13:34:22,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 13:34:22,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 13:34:22,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 01:34:22" (1/1) ... [2023-05-04 13:34:22,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b67a7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:22, skipping insertion in model container [2023-05-04 13:34:22,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 01:34:22" (1/1) ... [2023-05-04 13:34:22,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 13:34:22,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 13:34:22,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2023-05-04 13:34:22,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2023-05-04 13:34:22,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2023-05-04 13:34:22,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 13:34:22,955 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 13:34:22,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2023-05-04 13:34:22,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2023-05-04 13:34:22,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2023-05-04 13:34:22,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 13:34:23,042 INFO L208 MainTranslator]: Completed translation [2023-05-04 13:34:23,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23 WrapperNode [2023-05-04 13:34:23,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 13:34:23,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 13:34:23,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 13:34:23,046 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 13:34:23,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (1/1) ... [2023-05-04 13:34:23,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (1/1) ... [2023-05-04 13:34:23,105 INFO L138 Inliner]: procedures = 274, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2023-05-04 13:34:23,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 13:34:23,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 13:34:23,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 13:34:23,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 13:34:23,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (1/1) ... [2023-05-04 13:34:23,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (1/1) ... [2023-05-04 13:34:23,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (1/1) ... [2023-05-04 13:34:23,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (1/1) ... [2023-05-04 13:34:23,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (1/1) ... [2023-05-04 13:34:23,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (1/1) ... [2023-05-04 13:34:23,138 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (1/1) ... [2023-05-04 13:34:23,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (1/1) ... [2023-05-04 13:34:23,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 13:34:23,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 13:34:23,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 13:34:23,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 13:34:23,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (1/1) ... [2023-05-04 13:34:23,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 13:34:23,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:34:23,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 13:34:23,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 13:34:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-04 13:34:23,205 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-04 13:34:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-04 13:34:23,205 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-04 13:34:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 13:34:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 13:34:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 13:34:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 13:34:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 13:34:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 13:34:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 13:34:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 13:34:23,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 13:34:23,208 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 13:34:23,364 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 13:34:23,366 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 13:34:23,724 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 13:34:23,733 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 13:34:23,733 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-04 13:34:23,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 01:34:23 BoogieIcfgContainer [2023-05-04 13:34:23,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 13:34:23,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 13:34:23,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 13:34:23,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 13:34:23,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 01:34:22" (1/3) ... [2023-05-04 13:34:23,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6521f003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 01:34:23, skipping insertion in model container [2023-05-04 13:34:23,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:34:23" (2/3) ... [2023-05-04 13:34:23,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6521f003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 01:34:23, skipping insertion in model container [2023-05-04 13:34:23,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 01:34:23" (3/3) ... [2023-05-04 13:34:23,748 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2023-05-04 13:34:23,756 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 13:34:23,764 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 13:34:23,764 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 13:34:23,764 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 13:34:23,864 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 13:34:23,934 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 13:34:23,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 13:34:23,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:34:23,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 13:34:23,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 13:34:23,987 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 13:34:24,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-05-04 13:34:24,012 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7424e0c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 13:34:24,013 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 13:34:24,230 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:24,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1859602308, now seen corresponding path program 1 times [2023-05-04 13:34:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:24,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192615328] [2023-05-04 13:34:24,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:24,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:24,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:24,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192615328] [2023-05-04 13:34:24,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192615328] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:24,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:34:24,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 13:34:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566993020] [2023-05-04 13:34:24,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:24,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 13:34:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:24,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 13:34:24,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 13:34:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:24,575 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:24,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 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) [2023-05-04 13:34:24,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:24,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 13:34:24,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:24,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1839025871, now seen corresponding path program 1 times [2023-05-04 13:34:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:24,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430438433] [2023-05-04 13:34:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:24,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:24,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430438433] [2023-05-04 13:34:24,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430438433] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:24,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:34:24,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 13:34:24,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106105737] [2023-05-04 13:34:24,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:24,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 13:34:24,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:24,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 13:34:24,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 13:34:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:24,848 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:24,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2023-05-04 13:34:24,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:24,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:25,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:25,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 13:34:25,045 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:25,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1194622836, now seen corresponding path program 1 times [2023-05-04 13:34:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:25,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352923074] [2023-05-04 13:34:25,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:25,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:25,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352923074] [2023-05-04 13:34:25,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352923074] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:25,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:34:25,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 13:34:25,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253324703] [2023-05-04 13:34:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:25,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 13:34:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 13:34:25,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 13:34:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:25,325 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:25,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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) [2023-05-04 13:34:25,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:25,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:25,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:25,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 13:34:25,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:25,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2066557716, now seen corresponding path program 1 times [2023-05-04 13:34:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:25,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023042116] [2023-05-04 13:34:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:25,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:25,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:25,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023042116] [2023-05-04 13:34:25,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023042116] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:25,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:34:25,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 13:34:25,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528916771] [2023-05-04 13:34:25,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:25,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 13:34:25,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:25,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 13:34:25,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 13:34:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:25,549 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:25,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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) [2023-05-04 13:34:25,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:25,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:25,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:25,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:25,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 13:34:25,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:25,597 INFO L85 PathProgramCache]: Analyzing trace with hash 779802156, now seen corresponding path program 1 times [2023-05-04 13:34:25,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:25,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803787713] [2023-05-04 13:34:25,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:25,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:26,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:26,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803787713] [2023-05-04 13:34:26,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803787713] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:26,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:34:26,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 13:34:26,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40724536] [2023-05-04 13:34:26,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:26,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 13:34:26,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:26,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 13:34:26,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 13:34:26,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:26,393 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:26,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 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) [2023-05-04 13:34:26,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:26,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:26,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:26,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:26,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 13:34:26,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 13:34:26,733 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:26,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash -362007519, now seen corresponding path program 1 times [2023-05-04 13:34:26,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:26,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140170856] [2023-05-04 13:34:26,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:26,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:29,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140170856] [2023-05-04 13:34:29,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140170856] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:29,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:34:29,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-05-04 13:34:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50376548] [2023-05-04 13:34:29,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:29,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-05-04 13:34:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:29,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-05-04 13:34:29,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2023-05-04 13:34:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:29,990 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:29,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 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) [2023-05-04 13:34:29,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 13:34:29,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:32,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 13:34:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 13:34:32,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 13:34:32,435 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:32,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:32,435 INFO L85 PathProgramCache]: Analyzing trace with hash 347462894, now seen corresponding path program 1 times [2023-05-04 13:34:32,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:32,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449420548] [2023-05-04 13:34:32,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:32,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:32,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:32,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449420548] [2023-05-04 13:34:32,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449420548] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:32,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:34:32,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 13:34:32,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247247975] [2023-05-04 13:34:32,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:32,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 13:34:32,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:32,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 13:34:32,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 13:34:32,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:32,506 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:32,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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) [2023-05-04 13:34:32,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:32,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:32,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:32,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:32,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 13:34:32,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 13:34:32,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 13:34:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 13:34:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:32,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 13:34:32,934 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:32,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:32,934 INFO L85 PathProgramCache]: Analyzing trace with hash 490277457, now seen corresponding path program 2 times [2023-05-04 13:34:32,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:32,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785119316] [2023-05-04 13:34:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:39,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785119316] [2023-05-04 13:34:39,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785119316] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:39,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:34:39,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2023-05-04 13:34:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989308481] [2023-05-04 13:34:39,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:39,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-05-04 13:34:39,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:39,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-05-04 13:34:39,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2023-05-04 13:34:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:39,864 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:39,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 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) [2023-05-04 13:34:39,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:39,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:39,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:39,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:39,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 13:34:39,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-05-04 13:34:39,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:39,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 13:34:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 13:34:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 13:34:42,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 13:34:42,924 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash -756562713, now seen corresponding path program 1 times [2023-05-04 13:34:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:42,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137406326] [2023-05-04 13:34:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:42,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:42,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:42,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137406326] [2023-05-04 13:34:42,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137406326] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:42,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:34:42,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 13:34:42,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704487230] [2023-05-04 13:34:42,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:42,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 13:34:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:42,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 13:34:42,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 13:34:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:42,988 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:42,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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) [2023-05-04 13:34:42,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:42,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:42,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:42,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:42,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 13:34:42,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-04 13:34:42,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 13:34:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 13:34:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 13:34:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 13:34:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 13:34:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:43,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 13:34:43,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 13:34:43,199 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 13:34:43,201 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-05-04 13:34:43,206 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 13:34:43,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 13:34:43,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:34:43,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 13:34:43,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-05-04 13:34:43,221 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 13:34:43,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 13:34:43,223 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7424e0c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 13:34:43,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 13:34:43,423 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 13:34:43,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash 935827827, now seen corresponding path program 1 times [2023-05-04 13:34:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:43,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315965302] [2023-05-04 13:34:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:43,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:43,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:43,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315965302] [2023-05-04 13:34:43,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315965302] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:43,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:34:43,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 13:34:43,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495455957] [2023-05-04 13:34:43,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:43,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 13:34:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:43,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 13:34:43,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 13:34:43,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:43,444 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:43,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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) [2023-05-04 13:34:43,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:43,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:43,453 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 13:34:43,453 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 13:34:43,453 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 13:34:43,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 13:34:43,456 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2023-05-04 13:34:43,456 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-05-04 13:34:43,459 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 13:34:43,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 13:34:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:34:43,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 13:34:43,495 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 13:34:43,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-05-04 13:34:43,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-05-04 13:34:43,498 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7424e0c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 13:34:43,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 13:34:43,610 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:43,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:43,611 INFO L85 PathProgramCache]: Analyzing trace with hash 435183295, now seen corresponding path program 1 times [2023-05-04 13:34:43,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:43,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204653607] [2023-05-04 13:34:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:43,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:43,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:43,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:43,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204653607] [2023-05-04 13:34:43,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204653607] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:43,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:34:43,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 13:34:43,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339743661] [2023-05-04 13:34:43,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:43,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 13:34:43,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:43,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 13:34:43,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 13:34:43,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:43,708 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:43,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) [2023-05-04 13:34:43,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:43,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:43,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-04 13:34:43,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:43,785 INFO L85 PathProgramCache]: Analyzing trace with hash 434653346, now seen corresponding path program 1 times [2023-05-04 13:34:43,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:43,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634698878] [2023-05-04 13:34:43,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:43,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:43,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:43,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634698878] [2023-05-04 13:34:43,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634698878] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 13:34:43,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547950010] [2023-05-04 13:34:43,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:43,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:34:43,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:34:43,968 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) [2023-05-04 13:34:43,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 13:34:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:44,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 13:34:44,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 13:34:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:44,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 13:34:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:44,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547950010] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 13:34:44,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 13:34:44,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 13:34:44,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063025125] [2023-05-04 13:34:44,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 13:34:44,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 13:34:44,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:44,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 13:34:44,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 13:34:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:44,335 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:44,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.4) internal successors, (334), 10 states have internal predecessors, (334), 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) [2023-05-04 13:34:44,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:44,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:44,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:34:44,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 13:34:44,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:34:44,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:44,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1972821792, now seen corresponding path program 2 times [2023-05-04 13:34:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:44,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250439745] [2023-05-04 13:34:44,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:44,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 96 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:44,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:44,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250439745] [2023-05-04 13:34:44,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250439745] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 13:34:44,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99423871] [2023-05-04 13:34:44,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 13:34:44,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:34:44,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:34:44,993 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) [2023-05-04 13:34:44,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 13:34:45,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-05-04 13:34:45,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 13:34:45,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 35 conjunts are in the unsatisfiable core [2023-05-04 13:34:45,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 13:34:45,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 13:34:45,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-05-04 13:34:45,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-05-04 13:34:45,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-05-04 13:34:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2023-05-04 13:34:45,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 13:34:45,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99423871] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:45,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 13:34:45,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2023-05-04 13:34:45,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452578312] [2023-05-04 13:34:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:45,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 13:34:45,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:45,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 13:34:45,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-05-04 13:34:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:45,565 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:45,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.416666666666668) internal successors, (197), 12 states have internal predecessors, (197), 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) [2023-05-04 13:34:45,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:45,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:34:45,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:34:46,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:34:46,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 13:34:46,217 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,SelfDestructingSolverStorable12 [2023-05-04 13:34:46,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:46,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:46,217 INFO L85 PathProgramCache]: Analyzing trace with hash 768197909, now seen corresponding path program 1 times [2023-05-04 13:34:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:46,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352037591] [2023-05-04 13:34:46,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:46,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 96 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:46,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:46,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352037591] [2023-05-04 13:34:46,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352037591] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 13:34:46,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775046766] [2023-05-04 13:34:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:46,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:34:46,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:34:46,589 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) [2023-05-04 13:34:46,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 13:34:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:46,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 13:34:46,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 13:34:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 96 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:47,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 13:34:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 96 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:47,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775046766] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 13:34:47,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 13:34:47,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-04 13:34:47,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415445208] [2023-05-04 13:34:47,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 13:34:47,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 13:34:47,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:47,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 13:34:47,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-04 13:34:47,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:47,269 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:47,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.72222222222222) internal successors, (535), 18 states have internal predecessors, (535), 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) [2023-05-04 13:34:47,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:47,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:34:47,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:34:47,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:47,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:47,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:34:47,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:34:47,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:34:47,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 13:34:47,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:34:47,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:47,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1189457937, now seen corresponding path program 2 times [2023-05-04 13:34:47,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:47,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430398118] [2023-05-04 13:34:47,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:47,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 224 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:48,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:48,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430398118] [2023-05-04 13:34:48,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430398118] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 13:34:48,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44381865] [2023-05-04 13:34:48,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 13:34:48,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:34:48,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:34:48,476 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) [2023-05-04 13:34:48,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 13:34:48,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 13:34:48,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 13:34:48,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 13:34:48,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 13:34:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 224 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:49,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 13:34:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 224 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:49,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44381865] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 13:34:49,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 13:34:49,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-05-04 13:34:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386282087] [2023-05-04 13:34:49,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 13:34:49,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-05-04 13:34:49,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:49,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-05-04 13:34:49,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-05-04 13:34:49,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:49,944 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:49,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 27.5) internal successors, (935), 34 states have internal predecessors, (935), 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) [2023-05-04 13:34:49,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:49,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:34:49,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:34:49,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:34:49,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:34:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:34:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:34:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 13:34:50,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 13:34:50,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:34:50,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:50,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash 44986889, now seen corresponding path program 3 times [2023-05-04 13:34:50,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:50,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529324620] [2023-05-04 13:34:50,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5775 backedges. 480 proven. 5295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:34:53,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:53,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529324620] [2023-05-04 13:34:53,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529324620] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 13:34:53,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322005288] [2023-05-04 13:34:53,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 13:34:53,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:34:53,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:34:53,594 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 13:34:53,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 13:34:53,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-05-04 13:34:53,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 13:34:53,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 3 conjunts are in the unsatisfiable core [2023-05-04 13:34:53,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 13:34:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5775 backedges. 679 proven. 0 refuted. 0 times theorem prover too weak. 5096 trivial. 0 not checked. [2023-05-04 13:34:54,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 13:34:54,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322005288] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:34:54,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 13:34:54,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [33] total 34 [2023-05-04 13:34:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275214486] [2023-05-04 13:34:54,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:34:54,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 13:34:54,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:34:54,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 13:34:54,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2023-05-04 13:34:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:54,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:34:54,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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) [2023-05-04 13:34:54,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:54,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:34:54,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:34:54,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:34:54,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-04 13:34:54,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:34:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:34:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:34:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:34:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 13:34:54,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:34:54,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-04 13:34:54,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-05-04 13:34:54,453 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:34:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:34:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash -145288845, now seen corresponding path program 1 times [2023-05-04 13:34:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:34:54,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228889531] [2023-05-04 13:34:54,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:34:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9904 backedges. 1086 proven. 8790 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-05-04 13:34:58,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:34:58,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228889531] [2023-05-04 13:34:58,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228889531] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 13:34:58,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940992339] [2023-05-04 13:34:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:34:58,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:34:58,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:34:58,775 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 13:34:58,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-04 13:34:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:34:59,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 3004 conjuncts, 32 conjunts are in the unsatisfiable core [2023-05-04 13:34:59,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 13:35:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9904 backedges. 1086 proven. 8790 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-05-04 13:35:00,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 13:35:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 9904 backedges. 1086 proven. 8790 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-05-04 13:35:02,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940992339] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 13:35:02,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 13:35:02,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 41 [2023-05-04 13:35:02,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229696294] [2023-05-04 13:35:02,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 13:35:02,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-05-04 13:35:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:35:02,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-05-04 13:35:02,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2023-05-04 13:35:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:35:02,575 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:35:02,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 43.34146341463415) internal successors, (1777), 41 states have internal predecessors, (1777), 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) [2023-05-04 13:35:02,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:02,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:35:02,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:35:02,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:35:02,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-04 13:35:02,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:02,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:35:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:35:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:35:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:35:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 13:35:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-05-04 13:35:03,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-04 13:35:03,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-05-04 13:35:03,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:35:03,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:35:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1766302605, now seen corresponding path program 2 times [2023-05-04 13:35:03,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:35:03,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357798077] [2023-05-04 13:35:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:35:03,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:35:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:35:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15690 backedges. 14855 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:35:10,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:35:10,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357798077] [2023-05-04 13:35:10,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357798077] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 13:35:10,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534130479] [2023-05-04 13:35:10,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 13:35:10,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:35:10,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:35:10,325 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 13:35:10,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-04 13:35:11,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 13:35:11,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 13:35:11,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 3672 conjuncts, 42 conjunts are in the unsatisfiable core [2023-05-04 13:35:11,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 13:35:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15690 backedges. 15690 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:35:12,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 13:35:12,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534130479] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:35:12,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 13:35:12,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2023-05-04 13:35:12,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321397495] [2023-05-04 13:35:12,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:35:12,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-05-04 13:35:12,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:35:12,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-05-04 13:35:12,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2023-05-04 13:35:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:35:12,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:35:12,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 41.86046511627907) internal successors, (1800), 43 states have internal predecessors, (1800), 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) [2023-05-04 13:35:12,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:12,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:35:12,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:35:12,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:35:12,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-04 13:35:12,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:12,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-05-04 13:35:12,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:35:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:35:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:35:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:35:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 13:35:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-05-04 13:35:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-05-04 13:35:13,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-04 13:35:13,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-05-04 13:35:13,885 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:35:13,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:35:13,886 INFO L85 PathProgramCache]: Analyzing trace with hash 362545475, now seen corresponding path program 1 times [2023-05-04 13:35:13,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:35:13,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737628686] [2023-05-04 13:35:13,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:35:13,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:35:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:35:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14858 backedges. 13359 proven. 1499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:35:19,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:35:19,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737628686] [2023-05-04 13:35:19,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737628686] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 13:35:19,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062902616] [2023-05-04 13:35:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:35:19,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:35:19,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 13:35:19,693 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 13:35:19,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-04 13:35:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:35:20,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 3580 conjuncts, 40 conjunts are in the unsatisfiable core [2023-05-04 13:35:20,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 13:35:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14858 backedges. 14839 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:35:21,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 13:35:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 14858 backedges. 14839 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 13:35:24,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062902616] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 13:35:24,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 13:35:24,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 43 [2023-05-04 13:35:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740974297] [2023-05-04 13:35:24,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 13:35:24,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-05-04 13:35:24,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:35:24,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-05-04 13:35:24,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1360, Unknown=0, NotChecked=0, Total=1806 [2023-05-04 13:35:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:35:24,089 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:35:24,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 42.72093023255814) internal successors, (1837), 43 states have internal predecessors, (1837), 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) [2023-05-04 13:35:24,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:24,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:35:24,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:35:24,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:35:24,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-04 13:35:24,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:24,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-05-04 13:35:24,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-05-04 13:35:24,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:35:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:35:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:35:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:35:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 13:35:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-05-04 13:35:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-05-04 13:35:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-05-04 13:35:25,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-05-04 13:35:25,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 13:35:25,372 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:35:25,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:35:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1247126602, now seen corresponding path program 3 times [2023-05-04 13:35:25,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:35:25,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250367860] [2023-05-04 13:35:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:35:25,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:35:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 13:35:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14858 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 14763 trivial. 0 not checked. [2023-05-04 13:35:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 13:35:26,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250367860] [2023-05-04 13:35:26,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250367860] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 13:35:26,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 13:35:26,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 13:35:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322568875] [2023-05-04 13:35:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 13:35:26,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 13:35:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 13:35:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 13:35:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 13:35:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:35:26,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 13:35:26,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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) [2023-05-04 13:35:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:35:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:35:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:35:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-04 13:35:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-05-04 13:35:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-05-04 13:35:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-05-04 13:35:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 13:35:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 13:35:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 13:35:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 13:35:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 13:35:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-05-04 13:35:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-05-04 13:35:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-05-04 13:35:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 13:35:26,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-05-04 13:35:26,697 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 13:35:26,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 13:35:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1585433393, now seen corresponding path program 1 times [2023-05-04 13:35:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 13:35:26,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219872970] [2023-05-04 13:35:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 13:35:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 13:36:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 13:36:15,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 13:36:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 13:36:50,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 13:36:50,386 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 13:36:50,387 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 13:36:50,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-05-04 13:36:50,388 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1] [2023-05-04 13:36:50,388 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was UNSAFE (3/3) [2023-05-04 13:36:50,393 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 13:36:50,393 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 13:36:51,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 01:36:51 BasicIcfg [2023-05-04 13:36:51,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 13:36:51,561 INFO L158 Benchmark]: Toolchain (without parser) took 149125.63ms. Allocated memory was 245.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 215.1MB in the beginning and 671.8MB in the end (delta: -456.7MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-05-04 13:36:51,562 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 182.5MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 13:36:51,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.02ms. Allocated memory is still 245.4MB. Free memory was 215.1MB in the beginning and 194.2MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-05-04 13:36:51,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.12ms. Allocated memory is still 245.4MB. Free memory was 194.2MB in the beginning and 191.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 13:36:51,562 INFO L158 Benchmark]: Boogie Preprocessor took 42.88ms. Allocated memory is still 245.4MB. Free memory was 191.0MB in the beginning and 188.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 13:36:51,562 INFO L158 Benchmark]: RCFGBuilder took 589.93ms. Allocated memory is still 245.4MB. Free memory was 188.9MB in the beginning and 165.4MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-05-04 13:36:51,563 INFO L158 Benchmark]: TraceAbstraction took 147819.13ms. Allocated memory was 245.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 164.3MB in the beginning and 671.8MB in the end (delta: -507.5MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-05-04 13:36:51,564 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 182.5MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 606.02ms. Allocated memory is still 245.4MB. Free memory was 215.1MB in the beginning and 194.2MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.12ms. Allocated memory is still 245.4MB. Free memory was 194.2MB in the beginning and 191.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.88ms. Allocated memory is still 245.4MB. Free memory was 191.0MB in the beginning and 188.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 589.93ms. Allocated memory is still 245.4MB. Free memory was 188.9MB in the beginning and 165.4MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 147819.13ms. Allocated memory was 245.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 164.3MB in the beginning and 671.8MB in the end (delta: -507.5MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 27958, independent: 27018, independent conditional: 12827, independent unconditional: 14191, dependent: 940, dependent conditional: 863, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27138, independent: 27018, independent conditional: 12827, independent unconditional: 14191, dependent: 120, dependent conditional: 43, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27138, independent: 27018, independent conditional: 12827, independent unconditional: 14191, dependent: 120, dependent conditional: 43, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27560, independent: 27018, independent conditional: 127, independent unconditional: 26891, dependent: 542, dependent conditional: 295, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27560, independent: 27018, independent conditional: 127, independent unconditional: 26891, dependent: 542, dependent conditional: 63, dependent unconditional: 479, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27560, independent: 27018, independent conditional: 127, independent unconditional: 26891, dependent: 542, dependent conditional: 63, dependent unconditional: 479, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11999, independent: 11915, independent conditional: 25, independent unconditional: 11890, dependent: 84, dependent conditional: 7, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11999, independent: 11886, independent conditional: 0, independent unconditional: 11886, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 113, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 84, dependent conditional: 7, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 113, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 84, dependent conditional: 7, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 286, independent: 126, independent conditional: 69, independent unconditional: 57, dependent: 160, dependent conditional: 18, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 27560, independent: 15103, independent conditional: 102, independent unconditional: 15001, dependent: 458, dependent conditional: 56, dependent unconditional: 402, unknown: 11999, unknown conditional: 32, unknown unconditional: 11967] , Statistics on independence cache: Total cache size (in pairs): 11999, Positive cache size: 11915, Positive conditional cache size: 25, Positive unconditional cache size: 11890, Negative cache size: 84, Negative conditional cache size: 7, Negative unconditional cache size: 77, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 232, Maximal queried relation: 7, Independence queries for same thread: 820 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 2705, Number of trivial persistent sets: 2580, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14268, independent: 14191, independent conditional: 0, independent unconditional: 14191, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 27958, independent: 27018, independent conditional: 12827, independent unconditional: 14191, dependent: 940, dependent conditional: 863, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27138, independent: 27018, independent conditional: 12827, independent unconditional: 14191, dependent: 120, dependent conditional: 43, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27138, independent: 27018, independent conditional: 12827, independent unconditional: 14191, dependent: 120, dependent conditional: 43, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27560, independent: 27018, independent conditional: 127, independent unconditional: 26891, dependent: 542, dependent conditional: 295, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27560, independent: 27018, independent conditional: 127, independent unconditional: 26891, dependent: 542, dependent conditional: 63, dependent unconditional: 479, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27560, independent: 27018, independent conditional: 127, independent unconditional: 26891, dependent: 542, dependent conditional: 63, dependent unconditional: 479, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11999, independent: 11915, independent conditional: 25, independent unconditional: 11890, dependent: 84, dependent conditional: 7, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11999, independent: 11886, independent conditional: 0, independent unconditional: 11886, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 113, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 84, dependent conditional: 7, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 113, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 84, dependent conditional: 7, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 286, independent: 126, independent conditional: 69, independent unconditional: 57, dependent: 160, dependent conditional: 18, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 27560, independent: 15103, independent conditional: 102, independent unconditional: 15001, dependent: 458, dependent conditional: 56, dependent unconditional: 402, unknown: 11999, unknown conditional: 32, unknown unconditional: 11967] , Statistics on independence cache: Total cache size (in pairs): 11999, Positive cache size: 11915, Positive conditional cache size: 25, Positive unconditional cache size: 11890, Negative cache size: 84, Negative conditional cache size: 7, Negative unconditional cache size: 77, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 232, Maximal queried relation: 7, Independence queries for same thread: 820 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8607, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 191, dependent conditional: 116, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 20, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8115, independent: 8040, independent conditional: 0, independent unconditional: 8040, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8115, independent: 8036, independent conditional: 0, independent unconditional: 8036, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 134, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8551, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8115, unknown conditional: 0, unknown unconditional: 8115] , Statistics on independence cache: Total cache size (in pairs): 8115, Positive cache size: 8040, Positive conditional cache size: 0, Positive unconditional cache size: 8040, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 76 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 249, Number of trivial persistent sets: 218, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8253, independent: 8178, independent conditional: 0, independent unconditional: 8178, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8607, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 191, dependent conditional: 116, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 20, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8115, independent: 8040, independent conditional: 0, independent unconditional: 8040, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8115, independent: 8036, independent conditional: 0, independent unconditional: 8036, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 134, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8551, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8115, unknown conditional: 0, unknown unconditional: 8115] , Statistics on independence cache: Total cache size (in pairs): 8115, Positive cache size: 8040, Positive conditional cache size: 0, Positive unconditional cache size: 8040, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 76 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29227, independent: 26944, independent conditional: 11595, independent unconditional: 15349, dependent: 2283, dependent conditional: 2222, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27229, independent: 26944, independent conditional: 11595, independent unconditional: 15349, dependent: 285, dependent conditional: 224, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27229, independent: 26944, independent conditional: 11595, independent unconditional: 15349, dependent: 285, dependent conditional: 224, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28745, independent: 26944, independent conditional: 0, independent unconditional: 26944, dependent: 1801, dependent conditional: 1516, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28745, independent: 26944, independent conditional: 0, independent unconditional: 26944, dependent: 1801, dependent conditional: 222, dependent unconditional: 1579, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28745, independent: 26944, independent conditional: 0, independent unconditional: 26944, dependent: 1801, dependent conditional: 222, dependent unconditional: 1579, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11681, independent: 11617, independent conditional: 0, independent unconditional: 11617, dependent: 64, dependent conditional: 3, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11681, independent: 11611, independent conditional: 0, independent unconditional: 11611, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 64, dependent conditional: 3, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 64, dependent conditional: 3, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 109, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 81, dependent conditional: 3, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 28745, independent: 15327, independent conditional: 0, independent unconditional: 15327, dependent: 1737, dependent conditional: 219, dependent unconditional: 1518, unknown: 11681, unknown conditional: 3, unknown unconditional: 11678] , Statistics on independence cache: Total cache size (in pairs): 11681, Positive cache size: 11617, Positive conditional cache size: 0, Positive unconditional cache size: 11617, Negative cache size: 64, Negative conditional cache size: 3, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1294, Maximal queried relation: 10, Independence queries for same thread: 1998 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 381, Number of trivial persistent sets: 322, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15410, independent: 15349, independent conditional: 0, independent unconditional: 15349, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29227, independent: 26944, independent conditional: 11595, independent unconditional: 15349, dependent: 2283, dependent conditional: 2222, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27229, independent: 26944, independent conditional: 11595, independent unconditional: 15349, dependent: 285, dependent conditional: 224, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27229, independent: 26944, independent conditional: 11595, independent unconditional: 15349, dependent: 285, dependent conditional: 224, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28745, independent: 26944, independent conditional: 0, independent unconditional: 26944, dependent: 1801, dependent conditional: 1516, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28745, independent: 26944, independent conditional: 0, independent unconditional: 26944, dependent: 1801, dependent conditional: 222, dependent unconditional: 1579, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28745, independent: 26944, independent conditional: 0, independent unconditional: 26944, dependent: 1801, dependent conditional: 222, dependent unconditional: 1579, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11681, independent: 11617, independent conditional: 0, independent unconditional: 11617, dependent: 64, dependent conditional: 3, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11681, independent: 11611, independent conditional: 0, independent unconditional: 11611, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 64, dependent conditional: 3, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 64, dependent conditional: 3, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 109, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 81, dependent conditional: 3, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 28745, independent: 15327, independent conditional: 0, independent unconditional: 15327, dependent: 1737, dependent conditional: 219, dependent unconditional: 1518, unknown: 11681, unknown conditional: 3, unknown unconditional: 11678] , Statistics on independence cache: Total cache size (in pairs): 11681, Positive cache size: 11617, Positive conditional cache size: 0, Positive unconditional cache size: 11617, Negative cache size: 64, Negative conditional cache size: 3, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1294, Maximal queried relation: 10, Independence queries for same thread: 1998 - PositiveResult [Line: 1032]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L950] 0 _Bool enqueue_flag, dequeue_flag; VAL [enqueue_flag=0] [L947] 0 pthread_mutex_t m; VAL [enqueue_flag=0, m={5:0}] [L951] 0 QType queue; VAL [enqueue_flag=0, m={5:0}, queue={6:0}] [L949] 0 int stored_elements[(20)]; VAL [enqueue_flag=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L950] 0 _Bool enqueue_flag, dequeue_flag; VAL [dequeue_flag=0, enqueue_flag=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1054] 0 pthread_t id1, id2; VAL [dequeue_flag=0, enqueue_flag=0, id1={35:0}, id2={21:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1055] 0 enqueue_flag=(1) VAL [dequeue_flag=0, enqueue_flag=1, id1={35:0}, id2={21:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1056] 0 dequeue_flag=(0) VAL [dequeue_flag=0, enqueue_flag=1, id1={35:0}, id2={21:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L955] 0 q->tail=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L956] 0 q->amount=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L960] EXPR 0 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->tail=0, queue={6:0}, stored_elements={7:0}] [L960] COND TRUE 0 q->head == q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->tail=0, queue={6:0}, stored_elements={7:0}] [L963] 0 return (-1); VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) VAL [dequeue_flag=0, empty(&queue)=-1, enqueue_flag=1, id1={35:0}, id2={21:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={35:0}, id2={21:0}, m={5:0}, pthread_create(&id1, ((void *)0), t1, &queue)=-3, queue={6:0}, stored_elements={7:0}] [L1007] 1 int value, i; VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1007] 1 int value, i; VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={35:0}, id2={21:0}, m={5:0}, pthread_create(&id2, ((void *)0), t2, &queue)=-2, queue={6:0}, stored_elements={7:0}] [L1009] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1036] 2 int i; VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1010] CALL 1 enqueue(&queue,value) [L1037] 2 i=0 VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1065] 0 \read(id1) VAL [\read(id1)=-3, dequeue_flag=0, enqueue_flag=1, id1={35:0}, id2={21:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=0, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=0, q->amount++=0, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, q->tail++=0, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue(&queue,value)=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1013] 1 stored_elements[0]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L960] EXPR 1 q->tail VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, q->tail=1, queue={6:0}, stored_elements={7:0}] [L960] COND FALSE 1 !(q->head == q->tail) VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, q->tail=1, queue={6:0}, stored_elements={7:0}] [L966] 1 return 0; VAL [\result=-1, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, empty(&queue)=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i=0 VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, i++=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, i++=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, q->tail++=1, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=0, i++=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=1, i++=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=0, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=0, queue={6:0}, stored_elements={7:0}, x=0] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=0] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=0] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=0] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=0] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=0] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->head++=0, queue={6:0}, stored_elements={7:0}, x=0] [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, i++=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=2, i++=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=2, queue={6:0}, stored_elements={7:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=2, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=2, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=2, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=2, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=2, q->tail++=2, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=1, i++=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=2, i++=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=1, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=1, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=1, queue={6:0}, stored_elements={7:0}, x=0] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=0] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=0] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=1, queue={6:0}, stored_elements={7:0}, x=0] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=1, queue={6:0}, stored_elements={7:0}, x=0] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=1, queue={6:0}, stored_elements={7:0}, x=0] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=1, q->head++=1, queue={6:0}, stored_elements={7:0}, x=0] [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=2, i++=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=3, i++=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=3, queue={6:0}, stored_elements={7:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=3, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=3, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=3, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=3, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=3, q->tail++=3, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=2, i++=2, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=3, i++=2, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=2, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=2, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=2, queue={6:0}, stored_elements={7:0}, x=0] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=0] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=0] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=2, queue={6:0}, stored_elements={7:0}, x=0] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=2, queue={6:0}, stored_elements={7:0}, x=0] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=2, queue={6:0}, stored_elements={7:0}, x=0] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=2, q->head++=2, queue={6:0}, stored_elements={7:0}, x=0] [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=3, i++=3, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=4, i++=3, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=4, queue={6:0}, stored_elements={7:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=4, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=4, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=4, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=4, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=4, q->tail++=4, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=3, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=3, i++=3, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=4, i++=3, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=3, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=3, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=3, queue={6:0}, stored_elements={7:0}, x=0] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=0] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=0] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=3, queue={6:0}, stored_elements={7:0}, x=0] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=3, queue={6:0}, stored_elements={7:0}, x=0] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=3, queue={6:0}, stored_elements={7:0}, x=0] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=3, q->head++=3, queue={6:0}, stored_elements={7:0}, x=0] [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=4, i++=4, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=5, i++=4, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=5, queue={6:0}, stored_elements={7:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=5, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=5, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=5, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=5, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=5, q->tail++=5, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=4, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=4, i++=4, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=5, i++=4, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=4, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=4, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=4, queue={6:0}, stored_elements={7:0}, x=0] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=0] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=0] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=4, queue={6:0}, stored_elements={7:0}, x=0] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=4, queue={6:0}, stored_elements={7:0}, x=0] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=4, queue={6:0}, stored_elements={7:0}, x=0] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=4, q->head++=4, queue={6:0}, stored_elements={7:0}, x=0] [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=5, i++=5, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=6, i++=5, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=6, queue={6:0}, stored_elements={7:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=6, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=6, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=6, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=6, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=6, q->tail++=6, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=5, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=5, i++=5, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=6, i++=5, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=5, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=5, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=5, queue={6:0}, stored_elements={7:0}, x=0] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=0] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=0] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=5, queue={6:0}, stored_elements={7:0}, x=0] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=5, queue={6:0}, stored_elements={7:0}, x=0] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=5, queue={6:0}, stored_elements={7:0}, x=0] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=5, q->head++=5, queue={6:0}, stored_elements={7:0}, x=0] [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=6, i++=6, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=7, i++=6, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=7, queue={6:0}, stored_elements={7:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=7, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=7, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=7, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=7, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=7, q->tail++=7, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=6, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=6, i++=6, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=7, i++=6, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=6, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=6, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=6, queue={6:0}, stored_elements={7:0}, x=0] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=0] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=0] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=6, queue={6:0}, stored_elements={7:0}, x=0] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=6, queue={6:0}, stored_elements={7:0}, x=0] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=6, queue={6:0}, stored_elements={7:0}, x=0] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=6, q->head++=6, queue={6:0}, stored_elements={7:0}, x=0] [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=7, i++=7, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=8, i++=7, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=8, queue={6:0}, stored_elements={7:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=8, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=8, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=8, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=8, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=8, q->tail++=8, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=7, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=7, i++=7, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=8, i++=7, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=7, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=7, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=7, queue={6:0}, stored_elements={7:0}, x=0] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=0] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=0] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=7, queue={6:0}, stored_elements={7:0}, x=0] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=7, queue={6:0}, stored_elements={7:0}, x=0] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=7, queue={6:0}, stored_elements={7:0}, x=0] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=7, q->head++=7, queue={6:0}, stored_elements={7:0}, x=0] [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=8, i++=8, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=9, i++=8, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=26, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}, value=26] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=26, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=9, queue={6:0}, stored_elements={7:0}, x=26] [L980] 1 q->element[q->tail] = x VAL [\old(x)=26, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=9, queue={6:0}, stored_elements={7:0}, x=26] [L981] EXPR 1 q->amount VAL [\old(x)=26, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=26] [L981] 1 q->amount++ VAL [\old(x)=26, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=26] [L982] EXPR 1 q->tail VAL [\old(x)=26, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=9, queue={6:0}, stored_elements={7:0}, x=26] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=26, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=9, queue={6:0}, stored_elements={7:0}, x=26] [L988] EXPR 1 q->tail VAL [\old(x)=26, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=9, queue={6:0}, stored_elements={7:0}, x=26] [L988] 1 q->tail++ VAL [\old(x)=26, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=9, q->tail++=9, queue={6:0}, stored_elements={7:0}, x=26] [L990] 1 return 0; VAL [\old(x)=26, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=26] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}, value=26] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}, value=26] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=8, m={5:0}, queue={6:0}, stored_elements={7:0}, value=26] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=8, i++=8, m={5:0}, queue={6:0}, stored_elements={7:0}, value=26] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=9, i++=8, m={5:0}, queue={6:0}, stored_elements={7:0}, value=26] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}, value=26] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=8, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=8, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=8, queue={6:0}, stored_elements={7:0}, x=0] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=0] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=0] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=8, queue={6:0}, stored_elements={7:0}, x=0] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=8, queue={6:0}, stored_elements={7:0}, x=0] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=8, queue={6:0}, stored_elements={7:0}, x=0] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=8, q->head++=8, queue={6:0}, stored_elements={7:0}, x=0] [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=26] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=26] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=9, i++=9, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=10, i++=9, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}, value=26] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=9, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=10, queue={6:0}, stored_elements={7:0}, x=9] [L980] 1 q->element[q->tail] = x VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=10, queue={6:0}, stored_elements={7:0}, x=9] [L981] EXPR 1 q->amount VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=9] [L981] 1 q->amount++ VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=9] [L982] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=10, queue={6:0}, stored_elements={7:0}, x=9] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=10, queue={6:0}, stored_elements={7:0}, x=9] [L988] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=10, queue={6:0}, stored_elements={7:0}, x=9] [L988] 1 q->tail++ VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=10, q->tail++=10, queue={6:0}, stored_elements={7:0}, x=9] [L990] 1 return 0; VAL [\old(x)=9, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=9] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=9, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=9, i++=9, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=10, i++=9, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=9, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=26, q->head=9, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=26, q->head=9, queue={6:0}, stored_elements={7:0}, x=26] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=26] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=26] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=9, queue={6:0}, stored_elements={7:0}, x=26] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=9, queue={6:0}, stored_elements={7:0}, x=26] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=9, queue={6:0}, stored_elements={7:0}, x=26] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=9, q->head++=9, queue={6:0}, stored_elements={7:0}, x=26] [L1003] 2 return x; VAL [\result=26, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=26] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=26, dequeue_flag=1, enqueue_flag=0, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=9] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=26, dequeue_flag=1, enqueue_flag=0, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=9] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=10, i++=10, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=11, i++=10, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=11, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}, value=11] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=11, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=11, queue={6:0}, stored_elements={7:0}, x=11] [L980] 1 q->element[q->tail] = x VAL [\old(x)=11, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=11, queue={6:0}, stored_elements={7:0}, x=11] [L981] EXPR 1 q->amount VAL [\old(x)=11, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=11] [L981] 1 q->amount++ VAL [\old(x)=11, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=11] [L982] EXPR 1 q->tail VAL [\old(x)=11, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=11, queue={6:0}, stored_elements={7:0}, x=11] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=11, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=11, queue={6:0}, stored_elements={7:0}, x=11] [L988] EXPR 1 q->tail VAL [\old(x)=11, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=11, queue={6:0}, stored_elements={7:0}, x=11] [L988] 1 q->tail++ VAL [\old(x)=11, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=11, q->tail++=11, queue={6:0}, stored_elements={7:0}, x=11] [L990] 1 return 0; VAL [\old(x)=11, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=11] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}, value=11] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}, value=11] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=10, m={5:0}, queue={6:0}, stored_elements={7:0}, value=11] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=10, i++=10, m={5:0}, queue={6:0}, stored_elements={7:0}, value=11] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=11, i++=10, m={5:0}, queue={6:0}, stored_elements={7:0}, value=11] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}, value=11] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=10, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=9, q->head=10, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=9, q->head=10, queue={6:0}, stored_elements={7:0}, x=9] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=9] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=9] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=10, queue={6:0}, stored_elements={7:0}, x=9] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=10, queue={6:0}, stored_elements={7:0}, x=9] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=10, queue={6:0}, stored_elements={7:0}, x=9] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=10, q->head++=10, queue={6:0}, stored_elements={7:0}, x=9] [L1003] 2 return x; VAL [\result=9, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=9] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=9, dequeue_flag=1, enqueue_flag=0, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=11] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=9, dequeue_flag=1, enqueue_flag=0, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=11] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=11, i++=11, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=12, i++=11, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}, value=11] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=23, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}, value=23] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=23, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=12, queue={6:0}, stored_elements={7:0}, x=23] [L980] 1 q->element[q->tail] = x VAL [\old(x)=23, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=12, queue={6:0}, stored_elements={7:0}, x=23] [L981] EXPR 1 q->amount VAL [\old(x)=23, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=23] [L981] 1 q->amount++ VAL [\old(x)=23, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=23] [L982] EXPR 1 q->tail VAL [\old(x)=23, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=12, queue={6:0}, stored_elements={7:0}, x=23] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=23, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=12, queue={6:0}, stored_elements={7:0}, x=23] [L988] EXPR 1 q->tail VAL [\old(x)=23, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=12, queue={6:0}, stored_elements={7:0}, x=23] [L988] 1 q->tail++ VAL [\old(x)=23, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=12, q->tail++=12, queue={6:0}, stored_elements={7:0}, x=23] [L990] 1 return 0; VAL [\old(x)=23, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=23] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}, value=23] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}, value=23] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=11, m={5:0}, queue={6:0}, stored_elements={7:0}, value=23] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=11, i++=11, m={5:0}, queue={6:0}, stored_elements={7:0}, value=23] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=12, i++=11, m={5:0}, queue={6:0}, stored_elements={7:0}, value=23] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}, value=23] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=11, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=11, q->head=11, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=11, q->head=11, queue={6:0}, stored_elements={7:0}, x=11] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=11] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=11] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=11, queue={6:0}, stored_elements={7:0}, x=11] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=11, queue={6:0}, stored_elements={7:0}, x=11] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=11, queue={6:0}, stored_elements={7:0}, x=11] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=11, q->head++=11, queue={6:0}, stored_elements={7:0}, x=11] [L1003] 2 return x; VAL [\result=11, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=11] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=11, dequeue_flag=1, enqueue_flag=0, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=23] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=11, dequeue_flag=1, enqueue_flag=0, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=23] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=12, i++=12, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=13, i++=12, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}, value=23] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=27, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=13, queue={6:0}, stored_elements={7:0}, x=27] [L980] 1 q->element[q->tail] = x VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=13, queue={6:0}, stored_elements={7:0}, x=27] [L981] EXPR 1 q->amount VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=27] [L981] 1 q->amount++ VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=27] [L982] EXPR 1 q->tail VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=13, queue={6:0}, stored_elements={7:0}, x=27] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=13, queue={6:0}, stored_elements={7:0}, x=27] [L988] EXPR 1 q->tail VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=13, queue={6:0}, stored_elements={7:0}, x=27] [L988] 1 q->tail++ VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=13, q->tail++=13, queue={6:0}, stored_elements={7:0}, x=27] [L990] 1 return 0; VAL [\old(x)=27, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=27] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=12, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=12, i++=12, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=13, i++=12, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=12, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=23, q->head=12, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=23, q->head=12, queue={6:0}, stored_elements={7:0}, x=23] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=23] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=23] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=12, queue={6:0}, stored_elements={7:0}, x=23] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=12, queue={6:0}, stored_elements={7:0}, x=23] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=12, queue={6:0}, stored_elements={7:0}, x=23] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=12, q->head++=12, queue={6:0}, stored_elements={7:0}, x=23] [L1003] 2 return x; VAL [\result=23, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=23] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=23, dequeue_flag=1, enqueue_flag=0, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=27] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=23, dequeue_flag=1, enqueue_flag=0, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=27] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=13, i++=13, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=14, i++=13, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=27, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=14, queue={6:0}, stored_elements={7:0}, x=27] [L980] 1 q->element[q->tail] = x VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=14, queue={6:0}, stored_elements={7:0}, x=27] [L981] EXPR 1 q->amount VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=27] [L981] 1 q->amount++ VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=27] [L982] EXPR 1 q->tail VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=14, queue={6:0}, stored_elements={7:0}, x=27] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=14, queue={6:0}, stored_elements={7:0}, x=27] [L988] EXPR 1 q->tail VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=14, queue={6:0}, stored_elements={7:0}, x=27] [L988] 1 q->tail++ VAL [\old(x)=27, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=14, q->tail++=14, queue={6:0}, stored_elements={7:0}, x=27] [L990] 1 return 0; VAL [\old(x)=27, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=27] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=13, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=13, i++=13, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=14, i++=13, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=13, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=27, q->head=13, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=27, q->head=13, queue={6:0}, stored_elements={7:0}, x=27] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=27] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=27] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=13, queue={6:0}, stored_elements={7:0}, x=27] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=13, queue={6:0}, stored_elements={7:0}, x=27] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=13, queue={6:0}, stored_elements={7:0}, x=27] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=13, q->head++=13, queue={6:0}, stored_elements={7:0}, x=27] [L1003] 2 return x; VAL [\result=27, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=27] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=27, dequeue_flag=1, enqueue_flag=0, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=27] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=27, dequeue_flag=1, enqueue_flag=0, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=27] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=14, i++=14, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=15, i++=14, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}, value=27] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=30, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}, value=30] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=30, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=15, queue={6:0}, stored_elements={7:0}, x=30] [L980] 1 q->element[q->tail] = x VAL [\old(x)=30, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=15, queue={6:0}, stored_elements={7:0}, x=30] [L981] EXPR 1 q->amount VAL [\old(x)=30, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=30] [L981] 1 q->amount++ VAL [\old(x)=30, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=30] [L982] EXPR 1 q->tail VAL [\old(x)=30, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=15, queue={6:0}, stored_elements={7:0}, x=30] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=30, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=15, queue={6:0}, stored_elements={7:0}, x=30] [L988] EXPR 1 q->tail VAL [\old(x)=30, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=15, queue={6:0}, stored_elements={7:0}, x=30] [L988] 1 q->tail++ VAL [\old(x)=30, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=15, q->tail++=15, queue={6:0}, stored_elements={7:0}, x=30] [L990] 1 return 0; VAL [\old(x)=30, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=30] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}, value=30] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}, value=30] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=14, m={5:0}, queue={6:0}, stored_elements={7:0}, value=30] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=14, i++=14, m={5:0}, queue={6:0}, stored_elements={7:0}, value=30] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=15, i++=14, m={5:0}, queue={6:0}, stored_elements={7:0}, value=30] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}, value=30] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=14, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=27, q->head=14, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=27, q->head=14, queue={6:0}, stored_elements={7:0}, x=27] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=27] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=27] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=14, queue={6:0}, stored_elements={7:0}, x=27] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=14, queue={6:0}, stored_elements={7:0}, x=27] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=14, queue={6:0}, stored_elements={7:0}, x=27] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=14, q->head++=14, queue={6:0}, stored_elements={7:0}, x=27] [L1003] 2 return x; VAL [\result=27, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=27] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=27, dequeue_flag=1, enqueue_flag=0, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=30] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=27, dequeue_flag=1, enqueue_flag=0, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=30] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=15, i++=15, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=16, i++=15, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}, value=30] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=29, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}, value=29] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=29, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=16, queue={6:0}, stored_elements={7:0}, x=29] [L980] 1 q->element[q->tail] = x VAL [\old(x)=29, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=16, queue={6:0}, stored_elements={7:0}, x=29] [L981] EXPR 1 q->amount VAL [\old(x)=29, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=29] [L981] 1 q->amount++ VAL [\old(x)=29, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=29] [L982] EXPR 1 q->tail VAL [\old(x)=29, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=16, queue={6:0}, stored_elements={7:0}, x=29] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=29, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=16, queue={6:0}, stored_elements={7:0}, x=29] [L988] EXPR 1 q->tail VAL [\old(x)=29, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=16, queue={6:0}, stored_elements={7:0}, x=29] [L988] 1 q->tail++ VAL [\old(x)=29, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=16, q->tail++=16, queue={6:0}, stored_elements={7:0}, x=29] [L990] 1 return 0; VAL [\old(x)=29, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=29] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}, value=29] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}, value=29] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=15, m={5:0}, queue={6:0}, stored_elements={7:0}, value=29] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=15, i++=15, m={5:0}, queue={6:0}, stored_elements={7:0}, value=29] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=16, i++=15, m={5:0}, queue={6:0}, stored_elements={7:0}, value=29] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}, value=29] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=15, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=30, q->head=15, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=30, q->head=15, queue={6:0}, stored_elements={7:0}, x=30] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=30] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=30] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=15, queue={6:0}, stored_elements={7:0}, x=30] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=15, queue={6:0}, stored_elements={7:0}, x=30] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=15, queue={6:0}, stored_elements={7:0}, x=30] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=15, q->head++=15, queue={6:0}, stored_elements={7:0}, x=30] [L1003] 2 return x; VAL [\result=30, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=30] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=30, dequeue_flag=1, enqueue_flag=0, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=29] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=30, dequeue_flag=1, enqueue_flag=0, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=29] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=16, i++=16, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=17, i++=16, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}, value=29] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}, value=-1] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=17, queue={6:0}, stored_elements={7:0}, x=-1] [L980] 1 q->element[q->tail] = x VAL [\old(x)=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=17, queue={6:0}, stored_elements={7:0}, x=-1] [L981] EXPR 1 q->amount VAL [\old(x)=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=-1] [L981] 1 q->amount++ VAL [\old(x)=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=-1] [L982] EXPR 1 q->tail VAL [\old(x)=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=17, queue={6:0}, stored_elements={7:0}, x=-1] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=17, queue={6:0}, stored_elements={7:0}, x=-1] [L988] EXPR 1 q->tail VAL [\old(x)=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=17, queue={6:0}, stored_elements={7:0}, x=-1] [L988] 1 q->tail++ VAL [\old(x)=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=17, q->tail++=17, queue={6:0}, stored_elements={7:0}, x=-1] [L990] 1 return 0; VAL [\old(x)=-1, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=-1] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}, value=-1] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}, value=-1] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=16, m={5:0}, queue={6:0}, stored_elements={7:0}, value=-1] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=16, i++=16, m={5:0}, queue={6:0}, stored_elements={7:0}, value=-1] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=17, i++=16, m={5:0}, queue={6:0}, stored_elements={7:0}, value=-1] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}, value=-1] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=16, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=29, q->head=16, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=29, q->head=16, queue={6:0}, stored_elements={7:0}, x=29] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=29] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=29] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=16, queue={6:0}, stored_elements={7:0}, x=29] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=16, queue={6:0}, stored_elements={7:0}, x=29] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=16, queue={6:0}, stored_elements={7:0}, x=29] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=16, q->head++=16, queue={6:0}, stored_elements={7:0}, x=29] [L1003] 2 return x; VAL [\result=29, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=29] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=29, dequeue_flag=1, enqueue_flag=0, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=-1] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=29, dequeue_flag=1, enqueue_flag=0, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=-1] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=17, i++=17, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=18, i++=17, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}, value=-1] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=31, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}, value=31] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=31, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=18, queue={6:0}, stored_elements={7:0}, x=31] [L980] 1 q->element[q->tail] = x VAL [\old(x)=31, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=18, queue={6:0}, stored_elements={7:0}, x=31] [L981] EXPR 1 q->amount VAL [\old(x)=31, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=31] [L981] 1 q->amount++ VAL [\old(x)=31, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=31] [L982] EXPR 1 q->tail VAL [\old(x)=31, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=18, queue={6:0}, stored_elements={7:0}, x=31] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=31, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=18, queue={6:0}, stored_elements={7:0}, x=31] [L988] EXPR 1 q->tail VAL [\old(x)=31, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=18, queue={6:0}, stored_elements={7:0}, x=31] [L988] 1 q->tail++ VAL [\old(x)=31, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=18, q->tail++=18, queue={6:0}, stored_elements={7:0}, x=31] [L990] 1 return 0; VAL [\old(x)=31, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=31] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}, value=31] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}, value=31] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=17, m={5:0}, queue={6:0}, stored_elements={7:0}, value=31] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=17, i++=17, m={5:0}, queue={6:0}, stored_elements={7:0}, value=31] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=18, i++=17, m={5:0}, queue={6:0}, stored_elements={7:0}, value=31] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}, value=31] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=17, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=-1, q->head=17, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=-1, q->head=17, queue={6:0}, stored_elements={7:0}, x=-1] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=-1] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=-1] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=17, queue={6:0}, stored_elements={7:0}, x=-1] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=17, queue={6:0}, stored_elements={7:0}, x=-1] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=17, queue={6:0}, stored_elements={7:0}, x=-1] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=17, q->head++=17, queue={6:0}, stored_elements={7:0}, x=-1] [L1003] 2 return x; VAL [\result=-1, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=-1] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=-1, dequeue_flag=1, enqueue_flag=0, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=31] [L1042] COND FALSE 2 !(!dequeue(&queue)==stored_elements[i]) VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=-1, dequeue_flag=1, enqueue_flag=0, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=31] [L1045] 2 dequeue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1046] 2 enqueue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=18, i++=18, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=19, i++=18, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}, value=31] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=19, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=19, queue={6:0}, stored_elements={7:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=19, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=19, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=19, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=19, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=19, q->tail++=19, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=18, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=18, i++=18, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=19, i++=18, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=19, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L1018] COND FALSE 1 !(i<((20)-1)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=19, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1031] 1 return ((void *)0); VAL [\result={0:0}, arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=19, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1065] FCALL, JOIN 1 pthread_join(id1, ((void *)0)) VAL [\read(id1)=-3, dequeue_flag=1, enqueue_flag=0, id1={35:0}, id2={21:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1066] 0 \read(id2) VAL [\read(id2)=-2, dequeue_flag=1, enqueue_flag=0, id1={35:0}, id2={21:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=18, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=31, q->head=18, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=31, q->head=18, queue={6:0}, stored_elements={7:0}, x=31] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=31] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=31] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=18, queue={6:0}, stored_elements={7:0}, x=31] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=18, queue={6:0}, stored_elements={7:0}, x=31] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=18, queue={6:0}, stored_elements={7:0}, x=31] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=18, q->head++=18, queue={6:0}, stored_elements={7:0}, x=31] [L1003] 2 return x; VAL [\result=31, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=31] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=31, dequeue_flag=1, enqueue_flag=0, i=19, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=31, dequeue_flag=1, enqueue_flag=0, i=19, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1043] 2 reach_error() VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=19, m={5:0}, queue={6:0}, stored_elements={7:0}] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 7.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 1312 NumberOfCodeBlocks, 1312 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1303 ConstructedInterpolants, 0 QuantifiedInterpolants, 10588 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 10/10 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 126.9s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 4.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 275, 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.8s SsaConstructionTime, 50.7s SatisfiabilityAnalysisTime, 32.4s InterpolantComputationTime, 18388 NumberOfCodeBlocks, 17498 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 20954 ConstructedInterpolants, 0 QuantifiedInterpolants, 50520 SizeOfPredicates, 144 NumberOfNonLiveVariables, 13479 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 99444/137339 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! [2023-05-04 13:36:51,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2023-05-04 13:36:51,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2023-05-04 13:36:52,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-05-04 13:36:52,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...