/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 14:53:31,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 14:53:31,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 14:53:31,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 14:53:31,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 14:53:31,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 14:53:31,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 14:53:31,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 14:53:31,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 14:53:31,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 14:53:31,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 14:53:31,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 14:53:31,252 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 14:53:31,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 14:53:31,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 14:53:31,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 14:53:31,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 14:53:31,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 14:53:31,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 14:53:31,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 14:53:31,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 14:53:31,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 14:53:31,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 14:53:31,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 14:53:31,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 14:53:31,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 14:53:31,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 14:53:31,259 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 14:53:31,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 14:53:31,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:53:31,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 14:53:31,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 14:53:31,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 14:53:31,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 14:53:31,260 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 14:53:31,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 14:53:31,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 14:53:31,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 14:53:31,261 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 14:53:31,261 INFO L153 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/UGemCutter-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: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 50 [2024-05-06 14:53:31,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 14:53:31,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 14:53:31,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 14:53:31,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 14:53:31,481 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 14:53:31,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-05-06 14:53:32,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 14:53:32,603 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 14:53:32,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-05-06 14:53:32,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6f67385b3/f44a3ffcddc7415f8661ac1757972c26/FLAG82c8792f1 [2024-05-06 14:53:32,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6f67385b3/f44a3ffcddc7415f8661ac1757972c26 [2024-05-06 14:53:32,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 14:53:32,636 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 14:53:32,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 14:53:32,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 14:53:32,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 14:53:32,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:53:32" (1/1) ... [2024-05-06 14:53:32,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc39364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:32, skipping insertion in model container [2024-05-06 14:53:32,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:53:32" (1/1) ... [2024-05-06 14:53:32,674 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 14:53:32,782 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2024-05-06 14:53:32,921 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:53:32,933 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 14:53:32,945 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2024-05-06 14:53:32,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:53:33,048 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:53:33,048 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:53:33,053 INFO L206 MainTranslator]: Completed translation [2024-05-06 14:53:33,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33 WrapperNode [2024-05-06 14:53:33,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 14:53:33,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 14:53:33,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 14:53:33,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 14:53:33,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (1/1) ... [2024-05-06 14:53:33,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (1/1) ... [2024-05-06 14:53:33,120 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2024-05-06 14:53:33,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 14:53:33,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 14:53:33,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 14:53:33,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 14:53:33,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (1/1) ... [2024-05-06 14:53:33,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (1/1) ... [2024-05-06 14:53:33,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (1/1) ... [2024-05-06 14:53:33,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (1/1) ... [2024-05-06 14:53:33,148 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (1/1) ... [2024-05-06 14:53:33,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (1/1) ... [2024-05-06 14:53:33,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (1/1) ... [2024-05-06 14:53:33,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (1/1) ... [2024-05-06 14:53:33,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 14:53:33,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 14:53:33,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 14:53:33,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 14:53:33,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (1/1) ... [2024-05-06 14:53:33,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:53:33,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:53:33,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 14:53:33,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 14:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 14:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 14:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 14:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 14:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 14:53:33,249 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 14:53:33,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 14:53:33,249 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 14:53:33,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 14:53:33,250 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 14:53:33,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 14:53:33,251 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-06 14:53:33,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-06 14:53:33,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 14:53:33,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 14:53:33,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 14:53:33,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 14:53:33,253 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 14:53:33,357 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 14:53:33,359 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 14:53:33,621 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 14:53:33,709 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 14:53:33,710 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 14:53:33,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:53:33 BoogieIcfgContainer [2024-05-06 14:53:33,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 14:53:33,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 14:53:33,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 14:53:33,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 14:53:33,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 02:53:32" (1/3) ... [2024-05-06 14:53:33,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568c14ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:53:33, skipping insertion in model container [2024-05-06 14:53:33,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:53:33" (2/3) ... [2024-05-06 14:53:33,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568c14ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:53:33, skipping insertion in model container [2024-05-06 14:53:33,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:53:33" (3/3) ... [2024-05-06 14:53:33,717 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-05-06 14:53:33,723 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 14:53:33,730 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 14:53:33,730 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 14:53:33,730 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 14:53:33,778 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 14:53:33,820 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 14:53:33,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 14:53:33,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:53:33,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 14:53:33,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 14:53:33,858 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 14:53:33,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:53:33,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 14:53:33,873 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a004eb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 14:53:33,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-06 14:53:33,913 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:53:33,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:53:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash -412607054, now seen corresponding path program 1 times [2024-05-06 14:53:33,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:53:33,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487055719] [2024-05-06 14:53:33,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:33,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:53:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:53:34,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:53:34,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487055719] [2024-05-06 14:53:34,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487055719] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:53:34,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:53:34,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-06 14:53:34,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748214636] [2024-05-06 14:53:34,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:53:34,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-06 14:53:34,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:53:34,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 14:53:34,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-06 14:53:34,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:34,695 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:53:34,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:53:34,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:53:34,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 14:53:34,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:53:34,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:53:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash 595362090, now seen corresponding path program 1 times [2024-05-06 14:53:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:53:34,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763314813] [2024-05-06 14:53:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:53:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:53:35,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:53:35,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763314813] [2024-05-06 14:53:35,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763314813] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:53:35,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:53:35,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 14:53:35,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689485560] [2024-05-06 14:53:35,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:53:35,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 14:53:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:53:35,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 14:53:35,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-06 14:53:35,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:35,175 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:53:35,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:53:35,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:53:35,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash 435481461, now seen corresponding path program 1 times [2024-05-06 14:53:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:35,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:53:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:53:35,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 14:53:35,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:53:35,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:53:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash -948839716, now seen corresponding path program 1 times [2024-05-06 14:53:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:53:35,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506266425] [2024-05-06 14:53:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:53:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:53:36,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:53:36,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506266425] [2024-05-06 14:53:36,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506266425] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:53:36,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:53:36,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 14:53:36,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601102283] [2024-05-06 14:53:36,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:53:36,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 14:53:36,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:53:36,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 14:53:36,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 14:53:36,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:36,119 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:53:36,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:53:36,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:53:36,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:53:36,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:53:36,286 INFO L85 PathProgramCache]: Analyzing trace with hash 435481461, now seen corresponding path program 2 times [2024-05-06 14:53:36,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:36,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:36,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1047242099, now seen corresponding path program 1 times [2024-05-06 14:53:36,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:36,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:36,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:36,672 INFO L85 PathProgramCache]: Analyzing trace with hash -789348076, now seen corresponding path program 1 times [2024-05-06 14:53:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:36,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,099 INFO L85 PathProgramCache]: Analyzing trace with hash -363356082, now seen corresponding path program 1 times [2024-05-06 14:53:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:37,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash -11721110, now seen corresponding path program 1 times [2024-05-06 14:53:37,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:37,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,339 INFO L85 PathProgramCache]: Analyzing trace with hash 415263937, now seen corresponding path program 1 times [2024-05-06 14:53:37,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1926266937, now seen corresponding path program 1 times [2024-05-06 14:53:37,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:37,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2001800292, now seen corresponding path program 1 times [2024-05-06 14:53:37,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:37,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1043804557, now seen corresponding path program 1 times [2024-05-06 14:53:37,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:37,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1767444174, now seen corresponding path program 1 times [2024-05-06 14:53:37,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:37,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,857 INFO L85 PathProgramCache]: Analyzing trace with hash 220080450, now seen corresponding path program 1 times [2024-05-06 14:53:37,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:37,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:37,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1853395375, now seen corresponding path program 1 times [2024-05-06 14:53:38,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:38,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1555692269, now seen corresponding path program 1 times [2024-05-06 14:53:38,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:38,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -390107698, now seen corresponding path program 1 times [2024-05-06 14:53:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:38,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash -211930028, now seen corresponding path program 1 times [2024-05-06 14:53:38,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:38,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1530857052, now seen corresponding path program 1 times [2024-05-06 14:53:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash -465024441, now seen corresponding path program 1 times [2024-05-06 14:53:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,923 INFO L85 PathProgramCache]: Analyzing trace with hash -569190015, now seen corresponding path program 1 times [2024-05-06 14:53:38,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:38,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:38,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1367112354, now seen corresponding path program 1 times [2024-05-06 14:53:38,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:38,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1706668487, now seen corresponding path program 1 times [2024-05-06 14:53:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1024885176, now seen corresponding path program 1 times [2024-05-06 14:53:39,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:39,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2111270908, now seen corresponding path program 1 times [2024-05-06 14:53:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:39,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash -693111084, now seen corresponding path program 1 times [2024-05-06 14:53:39,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,702 INFO L85 PathProgramCache]: Analyzing trace with hash -945100978, now seen corresponding path program 1 times [2024-05-06 14:53:39,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:39,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash -647505869, now seen corresponding path program 1 times [2024-05-06 14:53:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:39,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:39,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1719429455, now seen corresponding path program 1 times [2024-05-06 14:53:40,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:40,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash 886749513, now seen corresponding path program 1 times [2024-05-06 14:53:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2049605118, now seen corresponding path program 1 times [2024-05-06 14:53:40,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:40,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2005778842, now seen corresponding path program 1 times [2024-05-06 14:53:40,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash -757439203, now seen corresponding path program 1 times [2024-05-06 14:53:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:40,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,468 INFO L85 PathProgramCache]: Analyzing trace with hash -301528084, now seen corresponding path program 1 times [2024-05-06 14:53:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:40,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1672294669, now seen corresponding path program 1 times [2024-05-06 14:53:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:40,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash 361697121, now seen corresponding path program 1 times [2024-05-06 14:53:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:40,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1002403147, now seen corresponding path program 1 times [2024-05-06 14:53:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:41,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1694903517, now seen corresponding path program 1 times [2024-05-06 14:53:41,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:41,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2132884248, now seen corresponding path program 1 times [2024-05-06 14:53:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:41,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,730 INFO L85 PathProgramCache]: Analyzing trace with hash -345897280, now seen corresponding path program 1 times [2024-05-06 14:53:41,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:41,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1258083965, now seen corresponding path program 1 times [2024-05-06 14:53:41,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:41,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 790700742, now seen corresponding path program 1 times [2024-05-06 14:53:41,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 579695833, now seen corresponding path program 1 times [2024-05-06 14:53:41,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:41,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:42,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash -535489349, now seen corresponding path program 1 times [2024-05-06 14:53:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:42,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1312951896, now seen corresponding path program 1 times [2024-05-06 14:53:42,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:42,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:53:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:53:42,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:42,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:53:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:53:43,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 14:53:43,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-06 14:53:43,110 INFO L85 PathProgramCache]: Analyzing trace with hash 435481461, now seen corresponding path program 3 times [2024-05-06 14:53:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:43,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1047242099, now seen corresponding path program 2 times [2024-05-06 14:53:43,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:43,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,353 INFO L85 PathProgramCache]: Analyzing trace with hash -789348076, now seen corresponding path program 2 times [2024-05-06 14:53:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:43,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash -363356082, now seen corresponding path program 2 times [2024-05-06 14:53:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,656 INFO L85 PathProgramCache]: Analyzing trace with hash -11721110, now seen corresponding path program 2 times [2024-05-06 14:53:43,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:43,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash 415263937, now seen corresponding path program 2 times [2024-05-06 14:53:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:43,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1926266937, now seen corresponding path program 2 times [2024-05-06 14:53:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2001800292, now seen corresponding path program 2 times [2024-05-06 14:53:43,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:43,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1043804557, now seen corresponding path program 2 times [2024-05-06 14:53:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:43,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:43,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1767444174, now seen corresponding path program 2 times [2024-05-06 14:53:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:44,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 220080450, now seen corresponding path program 2 times [2024-05-06 14:53:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,588 INFO L85 PathProgramCache]: Analyzing trace with hash -211930028, now seen corresponding path program 2 times [2024-05-06 14:53:44,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:44,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1530857052, now seen corresponding path program 2 times [2024-05-06 14:53:44,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:44,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,778 INFO L85 PathProgramCache]: Analyzing trace with hash -465024441, now seen corresponding path program 2 times [2024-05-06 14:53:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:44,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,864 INFO L85 PathProgramCache]: Analyzing trace with hash -569190015, now seen corresponding path program 2 times [2024-05-06 14:53:44,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:44,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1367112354, now seen corresponding path program 2 times [2024-05-06 14:53:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:44,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1706668487, now seen corresponding path program 2 times [2024-05-06 14:53:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:45,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:45,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1024885176, now seen corresponding path program 2 times [2024-05-06 14:53:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:45,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:45,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2111270908, now seen corresponding path program 2 times [2024-05-06 14:53:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:45,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1719429455, now seen corresponding path program 2 times [2024-05-06 14:53:45,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:45,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:45,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:45,481 INFO L85 PathProgramCache]: Analyzing trace with hash 886749513, now seen corresponding path program 2 times [2024-05-06 14:53:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:53:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:53:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:53:45,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:53:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:04,852 INFO L85 PathProgramCache]: Analyzing trace with hash -405828204, now seen corresponding path program 1 times [2024-05-06 14:54:04,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:04,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:04,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:05,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1872809615, now seen corresponding path program 1 times [2024-05-06 14:54:05,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:05,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:05,787 INFO L85 PathProgramCache]: Analyzing trace with hash 614666011, now seen corresponding path program 1 times [2024-05-06 14:54:05,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:05,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:05,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:06,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2058331070, now seen corresponding path program 1 times [2024-05-06 14:54:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:06,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash -759024840, now seen corresponding path program 1 times [2024-05-06 14:54:06,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:06,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:06,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1222453853, now seen corresponding path program 1 times [2024-05-06 14:54:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:07,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:07,449 INFO L85 PathProgramCache]: Analyzing trace with hash 732281214, now seen corresponding path program 1 times [2024-05-06 14:54:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:07,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash 300756083, now seen corresponding path program 1 times [2024-05-06 14:54:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:08,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash 841106931, now seen corresponding path program 1 times [2024-05-06 14:54:08,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:08,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash 989175679, now seen corresponding path program 1 times [2024-05-06 14:54:27,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:27,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:28,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1730721028, now seen corresponding path program 1 times [2024-05-06 14:54:28,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:28,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1745222138, now seen corresponding path program 1 times [2024-05-06 14:54:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:28,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:28,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash -887530505, now seen corresponding path program 1 times [2024-05-06 14:54:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:28,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:28,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1968183069, now seen corresponding path program 1 times [2024-05-06 14:54:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:29,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1864592558, now seen corresponding path program 1 times [2024-05-06 14:54:29,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:29,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:29,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2018172393, now seen corresponding path program 1 times [2024-05-06 14:54:29,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:29,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:30,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 757878440, now seen corresponding path program 1 times [2024-05-06 14:54:30,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:30,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:30,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1410042142, now seen corresponding path program 1 times [2024-05-06 14:54:30,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:30,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:31,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:49,808 INFO L85 PathProgramCache]: Analyzing trace with hash 968432053, now seen corresponding path program 1 times [2024-05-06 14:54:49,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:49,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:49,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:50,322 INFO L85 PathProgramCache]: Analyzing trace with hash -617850994, now seen corresponding path program 1 times [2024-05-06 14:54:50,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:50,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:50,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash 118680124, now seen corresponding path program 1 times [2024-05-06 14:54:50,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:50,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:50,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:51,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1943542017, now seen corresponding path program 1 times [2024-05-06 14:54:51,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:51,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:51,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash 201351833, now seen corresponding path program 1 times [2024-05-06 14:54:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:51,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:51,797 INFO L85 PathProgramCache]: Analyzing trace with hash -547681572, now seen corresponding path program 1 times [2024-05-06 14:54:51,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:51,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:51,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:52,143 INFO L85 PathProgramCache]: Analyzing trace with hash 398085407, now seen corresponding path program 1 times [2024-05-06 14:54:52,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:52,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:52,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1259806898, now seen corresponding path program 1 times [2024-05-06 14:54:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:52,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:52,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1344713260, now seen corresponding path program 1 times [2024-05-06 14:54:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:54:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:54:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:54:52,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:54:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash 347829824, now seen corresponding path program 1 times [2024-05-06 14:55:13,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:13,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:13,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1257367395, now seen corresponding path program 1 times [2024-05-06 14:55:13,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:14,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:14,401 INFO L85 PathProgramCache]: Analyzing trace with hash -652112953, now seen corresponding path program 1 times [2024-05-06 14:55:14,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:14,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:14,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash -436626922, now seen corresponding path program 1 times [2024-05-06 14:55:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:14,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:15,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1815090460, now seen corresponding path program 1 times [2024-05-06 14:55:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:15,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:15,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2136748751, now seen corresponding path program 1 times [2024-05-06 14:55:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:15,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:15,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1177195478, now seen corresponding path program 1 times [2024-05-06 14:55:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:15,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:15,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1561955257, now seen corresponding path program 1 times [2024-05-06 14:55:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:16,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:16,645 INFO L85 PathProgramCache]: Analyzing trace with hash -743001185, now seen corresponding path program 1 times [2024-05-06 14:55:16,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:16,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:16,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash 262066646, now seen corresponding path program 1 times [2024-05-06 14:55:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:34,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash 497890445, now seen corresponding path program 1 times [2024-05-06 14:55:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:35,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:35,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1955787101, now seen corresponding path program 1 times [2024-05-06 14:55:35,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:35,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:35,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1587161536, now seen corresponding path program 1 times [2024-05-06 14:55:35,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:35,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:35,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:36,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1852423674, now seen corresponding path program 1 times [2024-05-06 14:55:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:36,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash 613957467, now seen corresponding path program 1 times [2024-05-06 14:55:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:36,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:36,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1781199680, now seen corresponding path program 1 times [2024-05-06 14:55:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:36,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1027249935, now seen corresponding path program 1 times [2024-05-06 14:55:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:37,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1557036619, now seen corresponding path program 1 times [2024-05-06 14:55:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:37,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:37,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:50,405 INFO L85 PathProgramCache]: Analyzing trace with hash 609198337, now seen corresponding path program 1 times [2024-05-06 14:55:50,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:50,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1177860670, now seen corresponding path program 1 times [2024-05-06 14:55:50,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:50,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash 377709960, now seen corresponding path program 1 times [2024-05-06 14:55:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:51,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:51,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash 704971829, now seen corresponding path program 1 times [2024-05-06 14:55:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:51,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1269776613, now seen corresponding path program 1 times [2024-05-06 14:55:52,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:52,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:52,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:55:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:55:52,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:55:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:55:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:55:52,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable98,SelfDestructingSolverStorable11,SelfDestructingSolverStorable99,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28,SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable110,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable115,SelfDestructingSolverStorable66,SelfDestructingSolverStorable116,SelfDestructingSolverStorable67,SelfDestructingSolverStorable117,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 14:55:52,408 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:55:52,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:55:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1286815742, now seen corresponding path program 2 times [2024-05-06 14:55:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:55:52,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764175324] [2024-05-06 14:55:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:55:52,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:55:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:55:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:55:53,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:55:53,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764175324] [2024-05-06 14:55:53,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764175324] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:55:53,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:55:53,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-06 14:55:53,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393109372] [2024-05-06 14:55:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:55:53,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-06 14:55:53,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:55:53,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-06 14:55:53,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-06 14:55:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:55:53,016 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:55:53,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:55:53,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:55:53,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:55:53,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:55:53,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:56:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:56:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:56:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:56:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-06 14:56:05,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-05-06 14:56:05,513 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:56:05,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:56:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash 502349416, now seen corresponding path program 3 times [2024-05-06 14:56:05,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:56:05,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538304914] [2024-05-06 14:56:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:05,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:56:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:56:06,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:56:06,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538304914] [2024-05-06 14:56:06,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538304914] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:56:06,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:56:06,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-06 14:56:06,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815037080] [2024-05-06 14:56:06,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:56:06,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-06 14:56:06,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:56:06,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-06 14:56:06,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-05-06 14:56:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:56:06,373 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:56:06,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:56:06,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:56:06,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:56:06,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:56:06,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-06 14:56:06,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:56:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:56:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:56:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:56:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-06 14:56:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-06 14:56:20,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-05-06 14:56:20,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:56:20,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:56:20,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2061515092, now seen corresponding path program 4 times [2024-05-06 14:56:20,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:56:20,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115925778] [2024-05-06 14:56:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:56:20,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:56:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:20,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:56:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:56:20,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 14:56:20,984 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 14:56:20,986 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-06 14:56:20,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-06 14:56:20,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-05-06 14:56:20,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-05-06 14:56:20,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-06 14:56:20,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-06 14:56:20,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-06 14:56:20,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-05-06 14:56:20,991 INFO L448 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 14:56:20,994 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 14:56:20,994 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 14:56:21,065 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2024-05-06 14:56:21,067 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 14:56:21,067 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 14:56:21,068 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 14:56:21,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 02:56:21 BasicIcfg [2024-05-06 14:56:21,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 14:56:21,084 INFO L158 Benchmark]: Toolchain (without parser) took 168448.28ms. Allocated memory was 163.6MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 91.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 644.4MB. Max. memory is 8.0GB. [2024-05-06 14:56:21,084 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 163.6MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 14:56:21,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.72ms. Allocated memory was 163.6MB in the beginning and 327.2MB in the end (delta: 163.6MB). Free memory was 91.1MB in the beginning and 292.6MB in the end (delta: -201.5MB). Peak memory consumption was 25.1MB. Max. memory is 8.0GB. [2024-05-06 14:56:21,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.00ms. Allocated memory is still 327.2MB. Free memory was 292.6MB in the beginning and 289.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 14:56:21,085 INFO L158 Benchmark]: Boogie Preprocessor took 50.60ms. Allocated memory is still 327.2MB. Free memory was 289.5MB in the beginning and 287.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:56:21,085 INFO L158 Benchmark]: RCFGBuilder took 539.46ms. Allocated memory is still 327.2MB. Free memory was 287.4MB in the beginning and 251.2MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2024-05-06 14:56:21,085 INFO L158 Benchmark]: TraceAbstraction took 167370.85ms. Allocated memory was 327.2MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 249.7MB in the beginning and 2.1GB in the end (delta: -1.8GB). Peak memory consumption was 638.1MB. Max. memory is 8.0GB. [2024-05-06 14:56:21,086 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 163.6MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 418.72ms. Allocated memory was 163.6MB in the beginning and 327.2MB in the end (delta: 163.6MB). Free memory was 91.1MB in the beginning and 292.6MB in the end (delta: -201.5MB). Peak memory consumption was 25.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.00ms. Allocated memory is still 327.2MB. Free memory was 292.6MB in the beginning and 289.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.60ms. Allocated memory is still 327.2MB. Free memory was 289.5MB in the beginning and 287.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 539.46ms. Allocated memory is still 327.2MB. Free memory was 287.4MB in the beginning and 251.2MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 167370.85ms. Allocated memory was 327.2MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 249.7MB in the beginning and 2.1GB in the end (delta: -1.8GB). Peak memory consumption was 638.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1812955, independent: 1797744, independent conditional: 1797672, independent unconditional: 72, dependent: 15211, dependent conditional: 15211, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1812327, independent: 1797744, independent conditional: 1797672, independent unconditional: 72, dependent: 14583, dependent conditional: 14583, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1812327, independent: 1797744, independent conditional: 1797672, independent unconditional: 72, dependent: 14583, dependent conditional: 14583, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1812327, independent: 1797744, independent conditional: 1797672, independent unconditional: 72, dependent: 14583, dependent conditional: 14583, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1867595, independent: 1797744, independent conditional: 864136, independent unconditional: 933608, dependent: 69851, dependent conditional: 55269, dependent unconditional: 14582, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1867595, independent: 1797744, independent conditional: 406478, independent unconditional: 1391266, dependent: 69851, dependent conditional: 13250, dependent unconditional: 56601, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1867595, independent: 1797744, independent conditional: 406478, independent unconditional: 1391266, dependent: 69851, dependent conditional: 13250, dependent unconditional: 56601, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1744, independent: 1711, independent conditional: 330, independent unconditional: 1381, dependent: 33, dependent conditional: 17, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1744, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 76, independent: 43, independent conditional: 34, independent unconditional: 9, dependent: 33, dependent conditional: 17, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 43, independent conditional: 34, independent unconditional: 9, dependent: 33, dependent conditional: 17, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 205, independent: 82, independent conditional: 75, independent unconditional: 7, dependent: 124, dependent conditional: 88, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1867595, independent: 1796033, independent conditional: 406148, independent unconditional: 1389885, dependent: 69818, dependent conditional: 13233, dependent unconditional: 56585, unknown: 1744, unknown conditional: 347, unknown unconditional: 1397] , Statistics on independence cache: Total cache size (in pairs): 1744, Positive cache size: 1711, Positive conditional cache size: 330, Positive unconditional cache size: 1381, Negative cache size: 33, Negative conditional cache size: 17, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 499677, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1867595, independent: 1797744, independent conditional: 864136, independent unconditional: 933608, dependent: 69851, dependent conditional: 55269, dependent unconditional: 14582, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1867595, independent: 1797744, independent conditional: 406478, independent unconditional: 1391266, dependent: 69851, dependent conditional: 13250, dependent unconditional: 56601, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1867595, independent: 1797744, independent conditional: 406478, independent unconditional: 1391266, dependent: 69851, dependent conditional: 13250, dependent unconditional: 56601, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1744, independent: 1711, independent conditional: 330, independent unconditional: 1381, dependent: 33, dependent conditional: 17, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1744, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 76, independent: 43, independent conditional: 34, independent unconditional: 9, dependent: 33, dependent conditional: 17, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 43, independent conditional: 34, independent unconditional: 9, dependent: 33, dependent conditional: 17, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 205, independent: 82, independent conditional: 75, independent unconditional: 7, dependent: 124, dependent conditional: 88, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1867595, independent: 1796033, independent conditional: 406148, independent unconditional: 1389885, dependent: 69818, dependent conditional: 13233, dependent unconditional: 56585, unknown: 1744, unknown conditional: 347, unknown unconditional: 1397] , Statistics on independence cache: Total cache size (in pairs): 1744, Positive cache size: 1711, Positive conditional cache size: 330, Positive unconditional cache size: 1381, Negative cache size: 33, Negative conditional cache size: 17, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 499677 ], Independence queries for same thread: 628 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L718] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z=0] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 0 pthread_t t1253; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1254; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1255; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1256; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L795] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 167.2s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 163.9s, 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: 64, 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.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 2693 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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, ConditionalCommutativityCheckTime: 147.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 483, ConditionalCommutativityTraceChecks: 114, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 14:56:21,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 14:56:21,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...