/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/mix035_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 14:38:27,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 14:38:27,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 14:38:27,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 14:38:27,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 14:38:27,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 14:38:27,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 14:38:27,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 14:38:27,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 14:38:27,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 14:38:27,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 14:38:27,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 14:38:27,743 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 14:38:27,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 14:38:27,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 14:38:27,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 14:38:27,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 14:38:27,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 14:38:27,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 14:38:27,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 14:38:27,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 14:38:27,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 14:38:27,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 14:38:27,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 14:38:27,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 14:38:27,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 14:38:27,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 14:38:27,746 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 14:38:27,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 14:38:27,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:38:27,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 14:38:27,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 14:38:27,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 14:38:27,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 14:38:27,748 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 14:38:27,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 14:38:27,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 14:38:27,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 14:38:27,748 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 14:38:27,748 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:38:27,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 14:38:27,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 14:38:27,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 14:38:27,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 14:38:27,918 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 14:38:27,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2024-05-06 14:38:28,926 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 14:38:29,165 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 14:38:29,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2024-05-06 14:38:29,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/45a9ba146/3e31d77400e348ad97f8c4d859d8adfa/FLAGd95028037 [2024-05-06 14:38:29,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/45a9ba146/3e31d77400e348ad97f8c4d859d8adfa [2024-05-06 14:38:29,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 14:38:29,192 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 14:38:29,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 14:38:29,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 14:38:29,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 14:38:29,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:38:29" (1/1) ... [2024-05-06 14:38:29,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520d592d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29, skipping insertion in model container [2024-05-06 14:38:29,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:38:29" (1/1) ... [2024-05-06 14:38:29,244 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 14:38:29,388 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/mix035_pso.opt_tso.opt.i[956,969] [2024-05-06 14:38:29,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:38:29,570 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 14:38:29,578 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/mix035_pso.opt_tso.opt.i[956,969] [2024-05-06 14:38:29,631 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:38:29,659 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:38:29,659 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:38:29,665 INFO L206 MainTranslator]: Completed translation [2024-05-06 14:38:29,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29 WrapperNode [2024-05-06 14:38:29,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 14:38:29,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 14:38:29,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 14:38:29,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 14:38:29,673 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:38:29" (1/1) ... [2024-05-06 14:38:29,698 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:38:29" (1/1) ... [2024-05-06 14:38:29,727 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2024-05-06 14:38:29,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 14:38:29,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 14:38:29,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 14:38:29,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 14:38:29,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29" (1/1) ... [2024-05-06 14:38:29,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29" (1/1) ... [2024-05-06 14:38:29,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29" (1/1) ... [2024-05-06 14:38:29,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29" (1/1) ... [2024-05-06 14:38:29,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29" (1/1) ... [2024-05-06 14:38:29,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29" (1/1) ... [2024-05-06 14:38:29,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29" (1/1) ... [2024-05-06 14:38:29,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29" (1/1) ... [2024-05-06 14:38:29,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 14:38:29,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 14:38:29,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 14:38:29,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 14:38:29,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29" (1/1) ... [2024-05-06 14:38:29,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:38:29,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:38:29,809 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:38:29,832 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:38:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 14:38:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 14:38:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 14:38:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 14:38:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 14:38:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 14:38:29,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 14:38:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 14:38:29,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 14:38:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 14:38:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 14:38:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 14:38:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 14:38:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 14:38:29,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 14:38:29,872 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:38:30,014 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 14:38:30,018 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 14:38:30,281 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 14:38:30,372 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 14:38:30,372 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 14:38:30,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:38:30 BoogieIcfgContainer [2024-05-06 14:38:30,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 14:38:30,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 14:38:30,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 14:38:30,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 14:38:30,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 02:38:29" (1/3) ... [2024-05-06 14:38:30,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615fcb0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:38:30, skipping insertion in model container [2024-05-06 14:38:30,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:38:29" (2/3) ... [2024-05-06 14:38:30,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615fcb0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:38:30, skipping insertion in model container [2024-05-06 14:38:30,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:38:30" (3/3) ... [2024-05-06 14:38:30,379 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2024-05-06 14:38:30,386 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 14:38:30,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 14:38:30,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 14:38:30,393 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 14:38:30,455 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 14:38:30,497 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 14:38:30,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 14:38:30,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:38:30,499 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:38:30,533 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:38:30,554 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 14:38:30,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:38:30,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 14:38:30,575 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;@180a6e7a, 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:38:30,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 14:38:30,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:38:30,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:38:30,614 INFO L85 PathProgramCache]: Analyzing trace with hash -882735027, now seen corresponding path program 1 times [2024-05-06 14:38:30,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:38:30,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006770590] [2024-05-06 14:38:30,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:38:31,396 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:38:31,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:38:31,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006770590] [2024-05-06 14:38:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006770590] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:38:31,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:38:31,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-06 14:38:31,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802351635] [2024-05-06 14:38:31,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:38:31,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 14:38:31,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:38:31,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 14:38:31,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-05-06 14:38:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:38:31,426 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:38:31,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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:38:31,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:38:31,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:38:31,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 14:38:31,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:38:31,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:38:31,516 INFO L85 PathProgramCache]: Analyzing trace with hash -342159405, now seen corresponding path program 1 times [2024-05-06 14:38:31,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:38:31,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166367664] [2024-05-06 14:38:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:31,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:38:31,838 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:38:31,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:38:31,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166367664] [2024-05-06 14:38:31,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166367664] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:38:31,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:38:31,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 14:38:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967935672] [2024-05-06 14:38:31,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:38:31,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 14:38:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:38:31,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 14:38:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-06 14:38:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:38:31,841 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:38:31,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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:38:31,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:38:31,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:38:32,076 INFO L85 PathProgramCache]: Analyzing trace with hash -748757203, now seen corresponding path program 1 times [2024-05-06 14:38:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:32,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:32,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:32,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:38:32,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 14:38:32,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 14:38:32,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:38:32,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:38:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1024570089, now seen corresponding path program 1 times [2024-05-06 14:38:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:38:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137909005] [2024-05-06 14:38:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:38:32,457 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:38:32,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:38:32,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137909005] [2024-05-06 14:38:32,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137909005] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:38:32,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:38:32,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 14:38:32,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884916110] [2024-05-06 14:38:32,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:38:32,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 14:38:32,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:38:32,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 14:38:32,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 14:38:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:38:32,460 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:38:32,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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:38:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:38:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 14:38:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:38:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -748757203, now seen corresponding path program 2 times [2024-05-06 14:38:32,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:32,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:32,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash -317846834, now seen corresponding path program 1 times [2024-05-06 14:38:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:32,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:32,979 INFO L85 PathProgramCache]: Analyzing trace with hash 278871980, now seen corresponding path program 1 times [2024-05-06 14:38:32,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:32,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:32,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash 865931675, now seen corresponding path program 1 times [2024-05-06 14:38:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:33,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1967595980, now seen corresponding path program 1 times [2024-05-06 14:38:33,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:33,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1460549776, now seen corresponding path program 1 times [2024-05-06 14:38:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:33,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1615453509, now seen corresponding path program 1 times [2024-05-06 14:38:33,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:33,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash 190658771, now seen corresponding path program 1 times [2024-05-06 14:38:33,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1379323008, now seen corresponding path program 1 times [2024-05-06 14:38:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:33,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash -875778237, now seen corresponding path program 1 times [2024-05-06 14:38:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,097 INFO L85 PathProgramCache]: Analyzing trace with hash 525938427, now seen corresponding path program 1 times [2024-05-06 14:38:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:34,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash -919141736, now seen corresponding path program 1 times [2024-05-06 14:38:34,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:34,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash -46248445, now seen corresponding path program 1 times [2024-05-06 14:38:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,681 INFO L85 PathProgramCache]: Analyzing trace with hash 980369879, now seen corresponding path program 1 times [2024-05-06 14:38:34,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:34,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1442749968, now seen corresponding path program 1 times [2024-05-06 14:38:34,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:34,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash -923290953, now seen corresponding path program 1 times [2024-05-06 14:38:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,159 INFO L85 PathProgramCache]: Analyzing trace with hash 801500453, now seen corresponding path program 1 times [2024-05-06 14:38:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:35,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1775260432, now seen corresponding path program 1 times [2024-05-06 14:38:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1996929080, now seen corresponding path program 1 times [2024-05-06 14:38:35,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash -341511701, now seen corresponding path program 1 times [2024-05-06 14:38:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:35,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 127530872, now seen corresponding path program 1 times [2024-05-06 14:38:35,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:35,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1666681894, now seen corresponding path program 1 times [2024-05-06 14:38:35,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:35,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1609367660, now seen corresponding path program 1 times [2024-05-06 14:38:36,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:36,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash 866600367, now seen corresponding path program 1 times [2024-05-06 14:38:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:36,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1148363947, now seen corresponding path program 1 times [2024-05-06 14:38:36,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:36,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2002358460, now seen corresponding path program 1 times [2024-05-06 14:38:36,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,561 INFO L85 PathProgramCache]: Analyzing trace with hash 341686923, now seen corresponding path program 1 times [2024-05-06 14:38:36,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1235903791, now seen corresponding path program 1 times [2024-05-06 14:38:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash -178415164, now seen corresponding path program 1 times [2024-05-06 14:38:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:36,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash 548434036, now seen corresponding path program 1 times [2024-05-06 14:38:36,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash 156238783, now seen corresponding path program 1 times [2024-05-06 14:38:36,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:36,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:36,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash 974871332, now seen corresponding path program 1 times [2024-05-06 14:38:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:37,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:37,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1769667846, now seen corresponding path program 1 times [2024-05-06 14:38:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:37,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:37,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1872102831, now seen corresponding path program 1 times [2024-05-06 14:38:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:37,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1602177622, now seen corresponding path program 1 times [2024-05-06 14:38:38,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1714251174, now seen corresponding path program 1 times [2024-05-06 14:38:38,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:38,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1856413775, now seen corresponding path program 1 times [2024-05-06 14:38:38,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:38,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1741230967, now seen corresponding path program 1 times [2024-05-06 14:38:38,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:38,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash 498020618, now seen corresponding path program 1 times [2024-05-06 14:38:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:38,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1540085881, now seen corresponding path program 1 times [2024-05-06 14:38:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:38,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2127890181, now seen corresponding path program 1 times [2024-05-06 14:38:38,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:38,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1456084003, now seen corresponding path program 1 times [2024-05-06 14:38:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash -739707062, now seen corresponding path program 1 times [2024-05-06 14:38:39,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:39,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,567 INFO L85 PathProgramCache]: Analyzing trace with hash 807422514, now seen corresponding path program 1 times [2024-05-06 14:38:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:39,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,654 INFO L85 PathProgramCache]: Analyzing trace with hash -943785405, now seen corresponding path program 1 times [2024-05-06 14:38:39,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:39,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash 108102677, now seen corresponding path program 1 times [2024-05-06 14:38:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,790 INFO L85 PathProgramCache]: Analyzing trace with hash 557676542, now seen corresponding path program 1 times [2024-05-06 14:38:39,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:39,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash 849273605, now seen corresponding path program 1 times [2024-05-06 14:38:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:39,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash 997227257, now seen corresponding path program 1 times [2024-05-06 14:38:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:40,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1542562313, now seen corresponding path program 1 times [2024-05-06 14:38:46,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:46,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:46,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:46,273 INFO L85 PathProgramCache]: Analyzing trace with hash -347473262, now seen corresponding path program 1 times [2024-05-06 14:38:46,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:46,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:46,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1085654916, now seen corresponding path program 1 times [2024-05-06 14:38:52,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:52,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1651359221, now seen corresponding path program 1 times [2024-05-06 14:38:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:52,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2113289767, now seen corresponding path program 1 times [2024-05-06 14:38:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:58,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:58,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:58,506 INFO L85 PathProgramCache]: Analyzing trace with hash -639466969, now seen corresponding path program 1 times [2024-05-06 14:38:58,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:58,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:58,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash -347423271, now seen corresponding path program 1 times [2024-05-06 14:39:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:04,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:04,301 INFO L85 PathProgramCache]: Analyzing trace with hash 395014062, now seen corresponding path program 1 times [2024-05-06 14:39:04,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:04,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:04,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:10,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1651402144, now seen corresponding path program 1 times [2024-05-06 14:39:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:10,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:10,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1675310410, now seen corresponding path program 1 times [2024-05-06 14:39:10,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:10,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash -639421380, now seen corresponding path program 1 times [2024-05-06 14:39:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:15,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:15,779 INFO L85 PathProgramCache]: Analyzing trace with hash -638694359, now seen corresponding path program 1 times [2024-05-06 14:39:15,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:15,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:15,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash 395054939, now seen corresponding path program 1 times [2024-05-06 14:39:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:21,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -574792326, now seen corresponding path program 1 times [2024-05-06 14:39:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:21,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:27,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1675366508, now seen corresponding path program 1 times [2024-05-06 14:39:27,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:27,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:27,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1542562332, now seen corresponding path program 1 times [2024-05-06 14:39:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:28,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash -638673322, now seen corresponding path program 1 times [2024-05-06 14:39:33,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:33,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,715 INFO L85 PathProgramCache]: Analyzing trace with hash 529010674, now seen corresponding path program 1 times [2024-05-06 14:39:33,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:33,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,797 INFO L85 PathProgramCache]: Analyzing trace with hash -814217251, now seen corresponding path program 1 times [2024-05-06 14:39:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:33,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1359209789, now seen corresponding path program 1 times [2024-05-06 14:39:33,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:33,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash -371795196, now seen corresponding path program 1 times [2024-05-06 14:39:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash -981823302, now seen corresponding path program 1 times [2024-05-06 14:39:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1001501783, now seen corresponding path program 1 times [2024-05-06 14:39:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:34,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:34,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:39:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:39:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:39:34,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable30,SelfDestructingSolverStorable74,SelfDestructingSolverStorable31,SelfDestructingSolverStorable75,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,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable55,SelfDestructingSolverStorable12,SelfDestructingSolverStorable56,SelfDestructingSolverStorable13,SelfDestructingSolverStorable57,SelfDestructingSolverStorable14,SelfDestructingSolverStorable58,SelfDestructingSolverStorable15,SelfDestructingSolverStorable59,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable20,SelfDestructingSolverStorable64,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable65,SelfDestructingSolverStorable22,SelfDestructingSolverStorable66,SelfDestructingSolverStorable23,SelfDestructingSolverStorable67,SelfDestructingSolverStorable24,SelfDestructingSolverStorable68,SelfDestructingSolverStorable25,SelfDestructingSolverStorable69,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 14:39:34,104 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:39:34,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:39:34,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1968543729, now seen corresponding path program 2 times [2024-05-06 14:39:34,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:39:34,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721078685] [2024-05-06 14:39:34,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:34,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:39:34,486 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:39:34,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:39:34,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721078685] [2024-05-06 14:39:34,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721078685] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:39:34,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:39:34,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 14:39:34,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371076862] [2024-05-06 14:39:34,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:39:34,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 14:39:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:39:34,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 14:39:34,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-06 14:39:34,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:34,489 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:39:34,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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:39:34,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:39:34,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:39:34,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:39:34,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash 865931675, now seen corresponding path program 2 times [2024-05-06 14:39:34,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:34,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:34,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1967595980, now seen corresponding path program 2 times [2024-05-06 14:39:35,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:35,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1542562313, now seen corresponding path program 2 times [2024-05-06 14:39:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:40,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:40,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:45,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1085654916, now seen corresponding path program 2 times [2024-05-06 14:39:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:45,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:45,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2113289767, now seen corresponding path program 2 times [2024-05-06 14:39:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:49,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash -347423271, now seen corresponding path program 2 times [2024-05-06 14:39:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:58,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1651402144, now seen corresponding path program 2 times [2024-05-06 14:39:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:58,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:58,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash -639421380, now seen corresponding path program 2 times [2024-05-06 14:40:02,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:02,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 395054939, now seen corresponding path program 2 times [2024-05-06 14:40:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:06,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1675366508, now seen corresponding path program 2 times [2024-05-06 14:40:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:10,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:14,812 INFO L85 PathProgramCache]: Analyzing trace with hash -638673322, now seen corresponding path program 2 times [2024-05-06 14:40:14,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:14,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:14,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 529010674, now seen corresponding path program 2 times [2024-05-06 14:40:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:14,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash -814217251, now seen corresponding path program 2 times [2024-05-06 14:40:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1359209789, now seen corresponding path program 2 times [2024-05-06 14:40:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,192 INFO L85 PathProgramCache]: Analyzing trace with hash -371795196, now seen corresponding path program 2 times [2024-05-06 14:40:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash -981823302, now seen corresponding path program 2 times [2024-05-06 14:40:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1001501783, now seen corresponding path program 2 times [2024-05-06 14:40:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1907357898, now seen corresponding path program 1 times [2024-05-06 14:40:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1724096270, now seen corresponding path program 1 times [2024-05-06 14:40:15,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,654 INFO L85 PathProgramCache]: Analyzing trace with hash 712003083, now seen corresponding path program 1 times [2024-05-06 14:40:15,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1408443044, now seen corresponding path program 1 times [2024-05-06 14:40:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,820 INFO L85 PathProgramCache]: Analyzing trace with hash -924396138, now seen corresponding path program 1 times [2024-05-06 14:40:15,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2048392075, now seen corresponding path program 1 times [2024-05-06 14:40:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1042300077, now seen corresponding path program 1 times [2024-05-06 14:40:15,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:15,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1906041328, now seen corresponding path program 1 times [2024-05-06 14:40:16,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1724054947, now seen corresponding path program 1 times [2024-05-06 14:40:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1052763371, now seen corresponding path program 1 times [2024-05-06 14:40:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:16,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1127208915, now seen corresponding path program 1 times [2024-05-06 14:40:16,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:16,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash 867647452, now seen corresponding path program 1 times [2024-05-06 14:40:16,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1911672482, now seen corresponding path program 1 times [2024-05-06 14:40:16,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:16,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2016544451, now seen corresponding path program 1 times [2024-05-06 14:40:16,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:16,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1866166555, now seen corresponding path program 1 times [2024-05-06 14:40:16,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1722768168, now seen corresponding path program 1 times [2024-05-06 14:40:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1052803733, now seen corresponding path program 1 times [2024-05-06 14:40:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:16,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:16,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1490059853, now seen corresponding path program 1 times [2024-05-06 14:40:17,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:17,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1221041140, now seen corresponding path program 1 times [2024-05-06 14:40:17,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:17,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1623181443, now seen corresponding path program 1 times [2024-05-06 14:40:17,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:17,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1056016425, now seen corresponding path program 1 times [2024-05-06 14:40:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash 658672938, now seen corresponding path program 1 times [2024-05-06 14:40:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1683816916, now seen corresponding path program 1 times [2024-05-06 14:40:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1054060721, now seen corresponding path program 1 times [2024-05-06 14:40:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1490020452, now seen corresponding path program 1 times [2024-05-06 14:40:17,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:17,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1987728436, now seen corresponding path program 1 times [2024-05-06 14:40:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:17,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2022005684, now seen corresponding path program 1 times [2024-05-06 14:40:17,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:17,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:17,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1822255162, now seen corresponding path program 1 times [2024-05-06 14:40:22,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:22,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:22,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:22,419 INFO L85 PathProgramCache]: Analyzing trace with hash -73319461, now seen corresponding path program 1 times [2024-05-06 14:40:22,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:22,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:22,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1740514655, now seen corresponding path program 1 times [2024-05-06 14:40:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:26,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:26,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:27,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1526384257, now seen corresponding path program 1 times [2024-05-06 14:40:27,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:27,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:27,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:32,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2023554885, now seen corresponding path program 1 times [2024-05-06 14:40:32,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:32,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:32,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:32,406 INFO L85 PathProgramCache]: Analyzing trace with hash 504952450, now seen corresponding path program 1 times [2024-05-06 14:40:32,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:32,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash -71989368, now seen corresponding path program 1 times [2024-05-06 14:40:37,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:37,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:37,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1092088452, now seen corresponding path program 1 times [2024-05-06 14:40:37,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:37,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:37,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:41,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1524971518, now seen corresponding path program 1 times [2024-05-06 14:40:41,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:41,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:41,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1488793255, now seen corresponding path program 1 times [2024-05-06 14:40:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:41,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash 506219117, now seen corresponding path program 1 times [2024-05-06 14:40:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:45,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:40:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:40:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:40:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 14:40:45,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable130,SelfDestructingSolverStorable92,SelfDestructingSolverStorable131,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable98,SelfDestructingSolverStorable126,SelfDestructingSolverStorable99,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125,SelfDestructingSolverStorable120,SelfDestructingSolverStorable121,SelfDestructingSolverStorable119,SelfDestructingSolverStorable115,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 14:40:45,719 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:40:45,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:40:45,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1958106413, now seen corresponding path program 3 times [2024-05-06 14:40:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:40:45,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562440073] [2024-05-06 14:40:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:45,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:45,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 14:40:45,763 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 14:40:45,764 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 14:40:45,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 14:40:45,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 14:40:45,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 14:40:45,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-05-06 14:40:45,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 14:40:45,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-05-06 14:40:45,769 INFO L448 BasicCegarLoop]: Path program histogram: [3, 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, 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:40:45,773 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 14:40:45,773 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 14:40:45,847 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 14:40:45,849 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 14:40:45,850 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 14:40:45,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 02:40:45 BasicIcfg [2024-05-06 14:40:45,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 14:40:45,886 INFO L158 Benchmark]: Toolchain (without parser) took 136694.72ms. Allocated memory was 157.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 89.7MB in the beginning and 878.5MB in the end (delta: -788.8MB). Peak memory consumption was 811.7MB. Max. memory is 8.0GB. [2024-05-06 14:40:45,887 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 14:40:45,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.79ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 89.6MB in the beginning and 245.8MB in the end (delta: -156.2MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. [2024-05-06 14:40:45,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.25ms. Allocated memory is still 285.2MB. Free memory was 245.8MB in the beginning and 243.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:40:45,887 INFO L158 Benchmark]: Boogie Preprocessor took 29.64ms. Allocated memory is still 285.2MB. Free memory was 243.3MB in the beginning and 241.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:40:45,887 INFO L158 Benchmark]: RCFGBuilder took 615.24ms. Allocated memory is still 285.2MB. Free memory was 241.2MB in the beginning and 209.2MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2024-05-06 14:40:45,887 INFO L158 Benchmark]: TraceAbstraction took 135510.99ms. Allocated memory was 285.2MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 207.6MB in the beginning and 878.5MB in the end (delta: -670.8MB). Peak memory consumption was 801.4MB. Max. memory is 8.0GB. [2024-05-06 14:40:45,888 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.17ms. Allocated memory is still 157.3MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 472.79ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 89.6MB in the beginning and 245.8MB in the end (delta: -156.2MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.25ms. Allocated memory is still 285.2MB. Free memory was 245.8MB in the beginning and 243.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.64ms. Allocated memory is still 285.2MB. Free memory was 243.3MB in the beginning and 241.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 615.24ms. Allocated memory is still 285.2MB. Free memory was 241.2MB in the beginning and 209.2MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 135510.99ms. Allocated memory was 285.2MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 207.6MB in the beginning and 878.5MB in the end (delta: -670.8MB). Peak memory consumption was 801.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: 66686, independent: 66057, independent conditional: 66013, independent unconditional: 44, dependent: 629, dependent conditional: 629, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 66638, independent: 66057, independent conditional: 66013, independent unconditional: 44, dependent: 581, dependent conditional: 581, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66638, independent: 66057, independent conditional: 66013, independent unconditional: 44, dependent: 581, dependent conditional: 581, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66638, independent: 66057, independent conditional: 66013, independent unconditional: 44, dependent: 581, dependent conditional: 581, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68375, independent: 66057, independent conditional: 31256, independent unconditional: 34801, dependent: 2318, dependent conditional: 1735, dependent unconditional: 583, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68375, independent: 66057, independent conditional: 17963, independent unconditional: 48094, dependent: 2318, dependent conditional: 563, dependent unconditional: 1755, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68375, independent: 66057, independent conditional: 17963, independent unconditional: 48094, dependent: 2318, dependent conditional: 563, dependent unconditional: 1755, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1005, independent: 985, independent conditional: 218, independent unconditional: 767, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1005, independent: 965, independent conditional: 0, independent unconditional: 965, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 36, independent conditional: 33, independent unconditional: 3, dependent: 97, dependent conditional: 70, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 68375, independent: 65072, independent conditional: 17745, independent unconditional: 47327, dependent: 2298, dependent conditional: 554, dependent unconditional: 1744, unknown: 1005, unknown conditional: 227, unknown unconditional: 778] , Statistics on independence cache: Total cache size (in pairs): 1005, Positive cache size: 985, Positive conditional cache size: 218, Positive unconditional cache size: 767, Negative cache size: 20, Negative conditional cache size: 9, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14465, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68375, independent: 66057, independent conditional: 31256, independent unconditional: 34801, dependent: 2318, dependent conditional: 1735, dependent unconditional: 583, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68375, independent: 66057, independent conditional: 17963, independent unconditional: 48094, dependent: 2318, dependent conditional: 563, dependent unconditional: 1755, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68375, independent: 66057, independent conditional: 17963, independent unconditional: 48094, dependent: 2318, dependent conditional: 563, dependent unconditional: 1755, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1005, independent: 985, independent conditional: 218, independent unconditional: 767, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1005, independent: 965, independent conditional: 0, independent unconditional: 965, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 20, dependent conditional: 9, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 36, independent conditional: 33, independent unconditional: 3, dependent: 97, dependent conditional: 70, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 68375, independent: 65072, independent conditional: 17745, independent unconditional: 47327, dependent: 2298, dependent conditional: 554, dependent unconditional: 1744, unknown: 1005, unknown conditional: 227, unknown unconditional: 778] , Statistics on independence cache: Total cache size (in pairs): 1005, Positive cache size: 985, Positive conditional cache size: 218, Positive unconditional cache size: 767, Negative cache size: 20, Negative conditional cache size: 9, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14465 ], Independence queries for same thread: 48 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y=0] [L727] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y=0] [L728] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y=0] [L729] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y=0] [L730] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y=0] [L731] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y=0] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y=0] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y=0] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y=0] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y=0] [L736] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y=0] [L737] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y=0] [L738] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y=0] [L739] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y=0] [L740] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y=0] [L741] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t922; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t923; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t924; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L787] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L855] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - 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: 836]: 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: 838]: 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: 840]: 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 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 135.2s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 133.3s, 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: 39, 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, 1.4s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 1339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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: 131.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 240, ConditionalCommutativityTraceChecks: 128, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 14:40:45,909 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:40:46,126 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...