/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/mix037.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 14:39:44,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 14:39:44,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 14:39:44,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 14:39:44,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 14:39:44,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 14:39:44,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 14:39:44,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 14:39:44,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 14:39:44,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 14:39:44,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 14:39:44,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 14:39:44,785 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 14:39:44,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 14:39:44,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 14:39:44,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 14:39:44,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 14:39:44,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 14:39:44,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 14:39:44,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 14:39:44,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 14:39:44,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 14:39:44,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 14:39:44,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 14:39:44,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 14:39:44,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 14:39:44,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 14:39:44,808 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 14:39:44,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 14:39:44,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:39:44,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 14:39:44,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 14:39:44,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 14:39:44,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 14:39:44,811 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 14:39:44,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 14:39:44,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 14:39:44,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 14:39:44,811 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 14:39:44,811 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:39:45,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 14:39:45,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 14:39:45,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 14:39:45,109 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 14:39:45,109 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 14:39:45,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037.opt.i [2024-05-06 14:39:46,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 14:39:46,496 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 14:39:46,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037.opt.i [2024-05-06 14:39:46,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9fd4be123/96ac845df5f44c52b4b4139d2fd16aa4/FLAG5a8019db2 [2024-05-06 14:39:46,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9fd4be123/96ac845df5f44c52b4b4139d2fd16aa4 [2024-05-06 14:39:46,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 14:39:46,540 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 14:39:46,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 14:39:46,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 14:39:46,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 14:39:46,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:39:46" (1/1) ... [2024-05-06 14:39:46,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d245cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:46, skipping insertion in model container [2024-05-06 14:39:46,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:39:46" (1/1) ... [2024-05-06 14:39:46,605 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 14:39:46,786 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/mix037.opt.i[944,957] [2024-05-06 14:39:46,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:39:47,031 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 14:39:47,050 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/mix037.opt.i[944,957] [2024-05-06 14:39:47,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:39:47,167 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:39:47,168 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:39:47,174 INFO L206 MainTranslator]: Completed translation [2024-05-06 14:39:47,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:47 WrapperNode [2024-05-06 14:39:47,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 14:39:47,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 14:39:47,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 14:39:47,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 14:39:47,182 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:39:47" (1/1) ... [2024-05-06 14:39:47,215 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:39:47" (1/1) ... [2024-05-06 14:39:47,251 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2024-05-06 14:39:47,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 14:39:47,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 14:39:47,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 14:39:47,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 14:39:47,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:47" (1/1) ... [2024-05-06 14:39:47,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:47" (1/1) ... [2024-05-06 14:39:47,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:47" (1/1) ... [2024-05-06 14:39:47,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:47" (1/1) ... [2024-05-06 14:39:47,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:47" (1/1) ... [2024-05-06 14:39:47,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:47" (1/1) ... [2024-05-06 14:39:47,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:47" (1/1) ... [2024-05-06 14:39:47,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:47" (1/1) ... [2024-05-06 14:39:47,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 14:39:47,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 14:39:47,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 14:39:47,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 14:39:47,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:47" (1/1) ... [2024-05-06 14:39:47,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:39:47,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:39:47,313 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:39:47,317 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:39:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 14:39:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 14:39:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 14:39:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 14:39:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 14:39:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 14:39:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 14:39:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 14:39:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 14:39:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 14:39:47,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 14:39:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-06 14:39:47,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-06 14:39:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 14:39:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 14:39:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 14:39:47,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 14:39:47,360 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:39:47,540 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 14:39:47,542 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 14:39:47,886 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 14:39:47,977 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 14:39:47,977 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 14:39:47,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:39:47 BoogieIcfgContainer [2024-05-06 14:39:47,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 14:39:47,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 14:39:47,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 14:39:47,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 14:39:47,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 02:39:46" (1/3) ... [2024-05-06 14:39:47,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6659c14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:39:47, skipping insertion in model container [2024-05-06 14:39:47,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:47" (2/3) ... [2024-05-06 14:39:47,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6659c14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:39:47, skipping insertion in model container [2024-05-06 14:39:47,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:39:47" (3/3) ... [2024-05-06 14:39:47,989 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2024-05-06 14:39:47,997 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 14:39:48,006 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 14:39:48,006 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 14:39:48,007 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 14:39:48,062 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 14:39:48,102 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 14:39:48,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 14:39:48,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:39:48,104 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:39:48,105 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:39:48,134 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 14:39:48,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:39:48,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 14:39:48,152 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;@46e0828a, 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:39:48,152 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-06 14:39:48,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:39:48,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:39:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1023419656, now seen corresponding path program 1 times [2024-05-06 14:39:48,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:39:48,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111423443] [2024-05-06 14:39:48,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:39:49,145 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:49,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:39:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111423443] [2024-05-06 14:39:49,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111423443] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:39:49,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:39:49,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 14:39:49,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827755977] [2024-05-06 14:39:49,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:39:49,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 14:39:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:39:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 14:39:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 14:39:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:49,185 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:39:49,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 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:49,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:39:49,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 14:39:49,289 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:39:49,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:39:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1332895024, now seen corresponding path program 1 times [2024-05-06 14:39:49,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:39:49,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673268946] [2024-05-06 14:39:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:49,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:39:49,775 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:49,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:39:49,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673268946] [2024-05-06 14:39:49,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673268946] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:39:49,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:39:49,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 14:39:49,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998714590] [2024-05-06 14:39:49,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:39:49,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 14:39:49,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:39:49,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 14:39:49,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-06 14:39:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:49,782 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:39:49,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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:49,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:39:49,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash -677720743, now seen corresponding path program 1 times [2024-05-06 14:39:50,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:50,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:39:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:39:50,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 14:39:50,374 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:39:50,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:39:50,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1498515658, now seen corresponding path program 1 times [2024-05-06 14:39:50,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:39:50,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249447756] [2024-05-06 14:39:50,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:50,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:39:50,747 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:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:39:50,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249447756] [2024-05-06 14:39:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249447756] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:39:50,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:39:50,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 14:39:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242013619] [2024-05-06 14:39:50,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:39:50,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 14:39:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:39:50,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 14:39:50,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-06 14:39:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:50,751 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:39:50,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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:50,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:39:50,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:39:50,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash -677720743, now seen corresponding path program 2 times [2024-05-06 14:39:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:50,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:50,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash -340404671, now seen corresponding path program 1 times [2024-05-06 14:39:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:51,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash 114747640, now seen corresponding path program 1 times [2024-05-06 14:39:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:51,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:51,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1561692264, now seen corresponding path program 1 times [2024-05-06 14:39:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:51,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:51,955 INFO L85 PathProgramCache]: Analyzing trace with hash -327471769, now seen corresponding path program 1 times [2024-05-06 14:39:51,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:51,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash 405078445, now seen corresponding path program 1 times [2024-05-06 14:39:52,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1788048260, now seen corresponding path program 1 times [2024-05-06 14:39:52,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:52,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2135888846, now seen corresponding path program 1 times [2024-05-06 14:39:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:52,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash 69647701, now seen corresponding path program 1 times [2024-05-06 14:39:52,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:52,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash 972078122, now seen corresponding path program 1 times [2024-05-06 14:39:52,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1278283448, now seen corresponding path program 1 times [2024-05-06 14:39:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:52,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash -257693633, now seen corresponding path program 1 times [2024-05-06 14:39:53,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:53,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash 88786587, now seen corresponding path program 1 times [2024-05-06 14:39:53,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1256880802, now seen corresponding path program 1 times [2024-05-06 14:39:53,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash -774654350, now seen corresponding path program 1 times [2024-05-06 14:39:53,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:53,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2053221197, now seen corresponding path program 1 times [2024-05-06 14:39:53,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:53,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash -903598329, now seen corresponding path program 1 times [2024-05-06 14:39:54,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,108 INFO L85 PathProgramCache]: Analyzing trace with hash 109399010, now seen corresponding path program 1 times [2024-05-06 14:39:54,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:54,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,193 INFO L85 PathProgramCache]: Analyzing trace with hash -412112884, now seen corresponding path program 1 times [2024-05-06 14:39:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2064916027, now seen corresponding path program 1 times [2024-05-06 14:39:54,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:54,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash 620799620, now seen corresponding path program 1 times [2024-05-06 14:39:54,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:54,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,577 INFO L85 PathProgramCache]: Analyzing trace with hash -257068770, now seen corresponding path program 1 times [2024-05-06 14:39:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1866558664, now seen corresponding path program 1 times [2024-05-06 14:39:55,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:55,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1071490942, now seen corresponding path program 1 times [2024-05-06 14:39:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash -878667113, now seen corresponding path program 1 times [2024-05-06 14:39:55,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,605 INFO L85 PathProgramCache]: Analyzing trace with hash 761566745, now seen corresponding path program 1 times [2024-05-06 14:39:55,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:55,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash -252527930, now seen corresponding path program 1 times [2024-05-06 14:39:55,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:55,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1947808658, now seen corresponding path program 1 times [2024-05-06 14:39:55,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:55,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1322640795, now seen corresponding path program 1 times [2024-05-06 14:39:55,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:55,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1204260045, now seen corresponding path program 1 times [2024-05-06 14:39:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:56,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:56,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1208078900, now seen corresponding path program 1 times [2024-05-06 14:39:56,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:56,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1207955605, now seen corresponding path program 1 times [2024-05-06 14:39:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:56,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:56,343 INFO L85 PathProgramCache]: Analyzing trace with hash 792317783, now seen corresponding path program 1 times [2024-05-06 14:39:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:56,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:56,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1906313043, now seen corresponding path program 1 times [2024-05-06 14:39:57,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2001156684, now seen corresponding path program 1 times [2024-05-06 14:39:57,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:57,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,642 INFO L85 PathProgramCache]: Analyzing trace with hash 618742824, now seen corresponding path program 1 times [2024-05-06 14:39:57,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:57,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,724 INFO L85 PathProgramCache]: Analyzing trace with hash 19959457, now seen corresponding path program 1 times [2024-05-06 14:39:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,799 INFO L85 PathProgramCache]: Analyzing trace with hash -553545363, now seen corresponding path program 1 times [2024-05-06 14:39:57,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:57,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1126234950, now seen corresponding path program 1 times [2024-05-06 14:39:57,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:57,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:57,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:58,035 INFO L85 PathProgramCache]: Analyzing trace with hash -451972059, now seen corresponding path program 1 times [2024-05-06 14:39:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:58,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:58,110 INFO L85 PathProgramCache]: Analyzing trace with hash 816704349, now seen corresponding path program 1 times [2024-05-06 14:39:58,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:58,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:58,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash -979441510, now seen corresponding path program 1 times [2024-05-06 14:39:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,148 INFO L85 PathProgramCache]: Analyzing trace with hash -724331483, now seen corresponding path program 1 times [2024-05-06 14:39:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,233 INFO L85 PathProgramCache]: Analyzing trace with hash 669371183, now seen corresponding path program 1 times [2024-05-06 14:39:59,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:59,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash 160139962, now seen corresponding path program 1 times [2024-05-06 14:39:59,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:59,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1380307404, now seen corresponding path program 1 times [2024-05-06 14:39:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash -875810029, now seen corresponding path program 1 times [2024-05-06 14:39:59,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:59,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,663 INFO L85 PathProgramCache]: Analyzing trace with hash -720988500, now seen corresponding path program 1 times [2024-05-06 14:39:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:59,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,805 INFO L85 PathProgramCache]: Analyzing trace with hash -577446922, now seen corresponding path program 1 times [2024-05-06 14:39:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:59,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:59,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash -809904780, now seen corresponding path program 1 times [2024-05-06 14:40:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:01,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:40:01,897 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:40:01,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:01,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:40:01,993 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:40:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 14:40:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-06 14:40:02,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1561692264, now seen corresponding path program 2 times [2024-05-06 14:40:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:02,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash -327471769, now seen corresponding path program 2 times [2024-05-06 14:40:02,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:02,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,437 INFO L85 PathProgramCache]: Analyzing trace with hash 405078445, now seen corresponding path program 2 times [2024-05-06 14:40:02,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:02,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1788048260, now seen corresponding path program 2 times [2024-05-06 14:40:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2135888846, now seen corresponding path program 2 times [2024-05-06 14:40:02,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:02,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,756 INFO L85 PathProgramCache]: Analyzing trace with hash 69647701, now seen corresponding path program 2 times [2024-05-06 14:40:02,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:02,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash 972078122, now seen corresponding path program 2 times [2024-05-06 14:40:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:02,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:02,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1278283448, now seen corresponding path program 2 times [2024-05-06 14:40:02,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:03,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash -774654350, now seen corresponding path program 2 times [2024-05-06 14:40:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:03,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2053221197, now seen corresponding path program 2 times [2024-05-06 14:40:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:03,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash 199399862, now seen corresponding path program 1 times [2024-05-06 14:40:13,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:13,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:13,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash 301831597, now seen corresponding path program 1 times [2024-05-06 14:40:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:21,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 702547204, now seen corresponding path program 1 times [2024-05-06 14:40:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:30,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash -254368382, now seen corresponding path program 1 times [2024-05-06 14:40:37,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:37,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:45,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1670751271, now seen corresponding path program 1 times [2024-05-06 14:40:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:45,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2131985977, now seen corresponding path program 1 times [2024-05-06 14:40:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:53,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1177132174, now seen corresponding path program 1 times [2024-05-06 14:41:01,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:41:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:41:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:01,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:41:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash 377774783, now seen corresponding path program 1 times [2024-05-06 14:41:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:41:10,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:41:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:10,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:41:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1650274027, now seen corresponding path program 1 times [2024-05-06 14:41:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:41:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:41:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:17,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:41:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1351204435, now seen corresponding path program 1 times [2024-05-06 14:41:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:41:28,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:41:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:28,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:41:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1042895280, now seen corresponding path program 1 times [2024-05-06 14:41:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:41:36,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:41:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:36,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:41:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:44,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1696283809, now seen corresponding path program 1 times [2024-05-06 14:41:44,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:41:44,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:41:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:44,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:41:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:52,324 INFO L85 PathProgramCache]: Analyzing trace with hash -776501691, now seen corresponding path program 1 times [2024-05-06 14:41:52,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:41:52,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:41:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:52,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:41:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1498994358, now seen corresponding path program 1 times [2024-05-06 14:42:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:42:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:42:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:00,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:42:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:09,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2029736118, now seen corresponding path program 1 times [2024-05-06 14:42:09,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:42:09,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:42:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:09,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:42:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:16,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1458565519, now seen corresponding path program 1 times [2024-05-06 14:42:16,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:42:16,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:42:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:16,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:42:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1294081282, now seen corresponding path program 1 times [2024-05-06 14:42:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:42:24,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:42:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:24,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:42:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1427325554, now seen corresponding path program 1 times [2024-05-06 14:42:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:42:32,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:42:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:32,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:42:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1863972969, now seen corresponding path program 1 times [2024-05-06 14:42:42,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:42:42,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:42:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:42,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:42:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2047948012, now seen corresponding path program 1 times [2024-05-06 14:42:50,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:42:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:42:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:42:50,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:42:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1867252197, now seen corresponding path program 1 times [2024-05-06 14:43:00,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:43:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:43:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:00,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:43:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:09,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2138507393, now seen corresponding path program 1 times [2024-05-06 14:43:09,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:43:09,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:43:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:09,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:43:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1732109062, now seen corresponding path program 1 times [2024-05-06 14:43:18,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:43:18,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:43:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:18,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:43:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:26,805 INFO L85 PathProgramCache]: Analyzing trace with hash 636981382, now seen corresponding path program 1 times [2024-05-06 14:43:26,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:43:26,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:43:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:26,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:43:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash 297662675, now seen corresponding path program 1 times [2024-05-06 14:43:35,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:43:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:43:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:35,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:43:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash 9706814, now seen corresponding path program 1 times [2024-05-06 14:43:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:43:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:43:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:44,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:43:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:52,031 INFO L85 PathProgramCache]: Analyzing trace with hash -276673866, now seen corresponding path program 1 times [2024-05-06 14:43:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:43:52,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:43:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:43:52,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:43:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:04,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1617790124, now seen corresponding path program 1 times [2024-05-06 14:44:04,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:44:04,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:44:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:04,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:44:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:13,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2064734769, now seen corresponding path program 1 times [2024-05-06 14:44:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:44:13,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:44:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:13,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:44:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:22,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1180395682, now seen corresponding path program 1 times [2024-05-06 14:44:22,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:44:22,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:44:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:22,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:44:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:29,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1347332572, now seen corresponding path program 1 times [2024-05-06 14:44:29,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:44:29,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:44:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:29,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:44:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1896222455, now seen corresponding path program 1 times [2024-05-06 14:44:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:44:36,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:44:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:36,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:44:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash -492901655, now seen corresponding path program 1 times [2024-05-06 14:44:47,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:44:47,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:44:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:47,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:44:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1231046160, now seen corresponding path program 1 times [2024-05-06 14:44:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:44:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:44:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:44:55,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:44:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:03,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1761299359, now seen corresponding path program 1 times [2024-05-06 14:45:03,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:45:03,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:45:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:03,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:45:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 81838899, now seen corresponding path program 1 times [2024-05-06 14:45:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:45:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:45:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:11,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:45:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash -428666504, now seen corresponding path program 1 times [2024-05-06 14:45:21,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:45:21,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:45:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:21,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:45:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:30,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1554692139, now seen corresponding path program 1 times [2024-05-06 14:45:30,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:45:30,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:45:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:30,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:45:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1612342586, now seen corresponding path program 1 times [2024-05-06 14:45:39,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:45:39,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:45:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:40,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:45:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:48,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2026262400, now seen corresponding path program 1 times [2024-05-06 14:45:48,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:45:48,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:45:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:48,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:45:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1727953435, now seen corresponding path program 1 times [2024-05-06 14:45:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:45:55,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:45:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:55,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:45:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:04,176 INFO L85 PathProgramCache]: Analyzing trace with hash 471501637, now seen corresponding path program 1 times [2024-05-06 14:46:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:04,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1677797940, now seen corresponding path program 1 times [2024-05-06 14:46:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:12,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1469793347, now seen corresponding path program 1 times [2024-05-06 14:46:20,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:20,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:20,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash 368336983, now seen corresponding path program 1 times [2024-05-06 14:46:28,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:28,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash -34600754, now seen corresponding path program 1 times [2024-05-06 14:46:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:29,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1483611221, now seen corresponding path program 1 times [2024-05-06 14:46:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:39,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1226730002, now seen corresponding path program 1 times [2024-05-06 14:46:46,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:46,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:46,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1840613213, now seen corresponding path program 1 times [2024-05-06 14:46:54,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:54,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:03,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1603256835, now seen corresponding path program 1 times [2024-05-06 14:47:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:03,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash -640996552, now seen corresponding path program 1 times [2024-05-06 14:47:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:11,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:12,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:47:12,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:47:12,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:47:12,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable98,SelfDestructingSolverStorable11,SelfDestructingSolverStorable99,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28,SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable110,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable115,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 14:47:12,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:47:12,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:47:12,380 INFO L85 PathProgramCache]: Analyzing trace with hash -333193700, now seen corresponding path program 2 times [2024-05-06 14:47:12,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:47:12,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328154938] [2024-05-06 14:47:12,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:12,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:47:12,732 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:47:12,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:47:12,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328154938] [2024-05-06 14:47:12,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328154938] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:47:12,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:47:12,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 14:47:12,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160416296] [2024-05-06 14:47:12,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:47:12,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 14:47:12,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:47:12,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 14:47:12,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-05-06 14:47:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:47:12,737 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:47:12,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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:47:12,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:47:12,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:47:12,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:47:12,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:47:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash -34600754, now seen corresponding path program 2 times [2024-05-06 14:47:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:19,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1642525229, now seen corresponding path program 1 times [2024-05-06 14:47:31,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:31,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:31,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:31,726 INFO L85 PathProgramCache]: Analyzing trace with hash 470921574, now seen corresponding path program 1 times [2024-05-06 14:47:31,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:31,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:31,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:31,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1818273528, now seen corresponding path program 1 times [2024-05-06 14:47:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:31,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:31,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:31,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1583360817, now seen corresponding path program 1 times [2024-05-06 14:47:31,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:31,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:31,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:32,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1994433875, now seen corresponding path program 1 times [2024-05-06 14:47:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:32,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1459057480, now seen corresponding path program 1 times [2024-05-06 14:47:32,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:32,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:32,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:47:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:47:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:47:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 14:47:32,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,SelfDestructingSolverStorable121,SelfDestructingSolverStorable119,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123 [2024-05-06 14:47:32,234 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:47:32,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:47:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash -821466750, now seen corresponding path program 3 times [2024-05-06 14:47:32,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:47:32,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31022029] [2024-05-06 14:47:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:47:32,736 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:47:32,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:47:32,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31022029] [2024-05-06 14:47:32,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31022029] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:47:32,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:47:32,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 14:47:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962649235] [2024-05-06 14:47:32,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:47:32,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 14:47:32,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:47:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 14:47:32,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-06 14:47:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:47:32,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:47:32,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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:47:32,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:47:32,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:47:32,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:47:32,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 14:47:32,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:47:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash -34600754, now seen corresponding path program 3 times [2024-05-06 14:47:40,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:40,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:40,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1642525229, now seen corresponding path program 2 times [2024-05-06 14:47:50,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:50,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,494 INFO L85 PathProgramCache]: Analyzing trace with hash 470921574, now seen corresponding path program 2 times [2024-05-06 14:47:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:50,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1818273528, now seen corresponding path program 2 times [2024-05-06 14:47:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1583360817, now seen corresponding path program 2 times [2024-05-06 14:47:50,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:50,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1994433875, now seen corresponding path program 2 times [2024-05-06 14:47:50,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:50,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1459057480, now seen corresponding path program 2 times [2024-05-06 14:47:50,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:50,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:50,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash 510371163, now seen corresponding path program 1 times [2024-05-06 14:47:51,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:51,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1405274485, now seen corresponding path program 1 times [2024-05-06 14:47:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash 584709049, now seen corresponding path program 1 times [2024-05-06 14:47:51,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1087222182, now seen corresponding path program 1 times [2024-05-06 14:47:51,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:51,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,571 INFO L85 PathProgramCache]: Analyzing trace with hash -587293820, now seen corresponding path program 1 times [2024-05-06 14:47:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,765 INFO L85 PathProgramCache]: Analyzing trace with hash 120288549, now seen corresponding path program 1 times [2024-05-06 14:47:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1531595999, now seen corresponding path program 1 times [2024-05-06 14:47:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:51,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 742769580, now seen corresponding path program 1 times [2024-05-06 14:47:52,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1274134503, now seen corresponding path program 1 times [2024-05-06 14:47:52,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1895223959, now seen corresponding path program 1 times [2024-05-06 14:47:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:52,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1524581230, now seen corresponding path program 1 times [2024-05-06 14:47:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:52,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash 605664261, now seen corresponding path program 1 times [2024-05-06 14:47:52,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 437146745, now seen corresponding path program 1 times [2024-05-06 14:47:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1400261008, now seen corresponding path program 1 times [2024-05-06 14:47:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:52,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash 325959444, now seen corresponding path program 1 times [2024-05-06 14:47:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1535162071, now seen corresponding path program 1 times [2024-05-06 14:47:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2025440420, now seen corresponding path program 1 times [2024-05-06 14:47:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:53,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2016210772, now seen corresponding path program 1 times [2024-05-06 14:47:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1420516314, now seen corresponding path program 1 times [2024-05-06 14:47:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1433591321, now seen corresponding path program 1 times [2024-05-06 14:47:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash -90335259, now seen corresponding path program 1 times [2024-05-06 14:47:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1937434788, now seen corresponding path program 1 times [2024-05-06 14:47:53,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:53,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2005855616, now seen corresponding path program 1 times [2024-05-06 14:47:53,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:53,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1735783701, now seen corresponding path program 1 times [2024-05-06 14:47:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1886917832, now seen corresponding path program 1 times [2024-05-06 14:47:54,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:54,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1172584552, now seen corresponding path program 1 times [2024-05-06 14:47:54,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:54,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash 451492015, now seen corresponding path program 1 times [2024-05-06 14:47:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash 709595812, now seen corresponding path program 1 times [2024-05-06 14:47:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1360615942, now seen corresponding path program 1 times [2024-05-06 14:47:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:54,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1065173999, now seen corresponding path program 1 times [2024-05-06 14:47:55,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:55,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:55,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:55,449 INFO L85 PathProgramCache]: Analyzing trace with hash -377586475, now seen corresponding path program 1 times [2024-05-06 14:47:55,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:55,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2089763594, now seen corresponding path program 1 times [2024-05-06 14:47:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:55,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:47:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:47:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:47:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 14:47:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-06 14:47:55,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,SelfDestructingSolverStorable130,SelfDestructingSolverStorable152,SelfDestructingSolverStorable131,SelfDestructingSolverStorable153,SelfDestructingSolverStorable132,SelfDestructingSolverStorable154,SelfDestructingSolverStorable150,SelfDestructingSolverStorable126,SelfDestructingSolverStorable148,SelfDestructingSolverStorable127,SelfDestructingSolverStorable149,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable144,SelfDestructingSolverStorable145,SelfDestructingSolverStorable124,SelfDestructingSolverStorable146,SelfDestructingSolverStorable125,SelfDestructingSolverStorable147,SelfDestructingSolverStorable140,SelfDestructingSolverStorable162,SelfDestructingSolverStorable141,SelfDestructingSolverStorable163,SelfDestructingSolverStorable142,SelfDestructingSolverStorable143,SelfDestructingSolverStorable160,SelfDestructingSolverStorable161,SelfDestructingSolverStorable137,SelfDestructingSolverStorable159,SelfDestructingSolverStorable138,SelfDestructingSolverStorable139,SelfDestructingSolverStorable133,SelfDestructingSolverStorable155,SelfDestructingSolverStorable134,SelfDestructingSolverStorable156,SelfDestructingSolverStorable135,SelfDestructingSolverStorable157,SelfDestructingSolverStorable136,SelfDestructingSolverStorable158 [2024-05-06 14:47:55,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:47:55,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:47:55,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1281410874, now seen corresponding path program 4 times [2024-05-06 14:47:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:47:55,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531625619] [2024-05-06 14:47:55,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:55,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:55,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:55,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 14:47:55,706 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 14:47:55,707 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-06 14:47:55,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-06 14:47:55,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-05-06 14:47:55,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-05-06 14:47:55,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-06 14:47:55,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-06 14:47:55,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-06 14:47:55,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2024-05-06 14:47:55,716 INFO L448 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:47:55,722 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 14:47:55,722 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 14:47:55,925 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 14:47:55,927 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 14:47:55,934 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 14:47:55,936 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2024-05-06 14:47:55,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 02:47:55 BasicIcfg [2024-05-06 14:47:55,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 14:47:55,970 INFO L158 Benchmark]: Toolchain (without parser) took 489430.51ms. Allocated memory was 288.4MB in the beginning and 4.6GB in the end (delta: 4.3GB). Free memory was 217.1MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 488.4MB. Max. memory is 8.0GB. [2024-05-06 14:47:55,970 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 168.8MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 14:47:55,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.02ms. Allocated memory is still 288.4MB. Free memory was 216.9MB in the beginning and 247.2MB in the end (delta: -30.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-05-06 14:47:55,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.31ms. Allocated memory is still 288.4MB. Free memory was 247.2MB in the beginning and 244.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 14:47:55,971 INFO L158 Benchmark]: Boogie Preprocessor took 27.78ms. Allocated memory is still 288.4MB. Free memory was 244.6MB in the beginning and 243.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 14:47:55,971 INFO L158 Benchmark]: RCFGBuilder took 699.30ms. Allocated memory is still 288.4MB. Free memory was 243.0MB in the beginning and 209.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2024-05-06 14:47:55,971 INFO L158 Benchmark]: TraceAbstraction took 487987.74ms. Allocated memory was 288.4MB in the beginning and 4.6GB in the end (delta: 4.3GB). Free memory was 208.4MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 480.1MB. Max. memory is 8.0GB. [2024-05-06 14:47:55,972 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.11ms. Allocated memory is still 168.8MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 633.02ms. Allocated memory is still 288.4MB. Free memory was 216.9MB in the beginning and 247.2MB in the end (delta: -30.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.31ms. Allocated memory is still 288.4MB. Free memory was 247.2MB in the beginning and 244.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.78ms. Allocated memory is still 288.4MB. Free memory was 244.6MB in the beginning and 243.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 699.30ms. Allocated memory is still 288.4MB. Free memory was 243.0MB in the beginning and 209.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 487987.74ms. Allocated memory was 288.4MB in the beginning and 4.6GB in the end (delta: 4.3GB). Free memory was 208.4MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 480.1MB. 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 Unfinished Backtranslation: IdentifierExpression #t~pre11 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: 1290608, independent: 1279396, independent conditional: 1279272, independent unconditional: 124, dependent: 11212, dependent conditional: 11212, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1290201, independent: 1279396, independent conditional: 1279272, independent unconditional: 124, dependent: 10805, dependent conditional: 10805, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1290201, independent: 1279396, independent conditional: 1279272, independent unconditional: 124, dependent: 10805, dependent conditional: 10805, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1290201, independent: 1279396, independent conditional: 1279272, independent unconditional: 124, dependent: 10805, dependent conditional: 10805, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1326303, independent: 1279396, independent conditional: 614191, independent unconditional: 665205, dependent: 46907, dependent conditional: 36103, dependent unconditional: 10804, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1326303, independent: 1279396, independent conditional: 293700, independent unconditional: 985696, dependent: 46907, dependent conditional: 8890, dependent unconditional: 38017, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1326303, independent: 1279396, independent conditional: 293700, independent unconditional: 985696, dependent: 46907, dependent conditional: 8890, dependent unconditional: 38017, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1646, independent: 1620, independent conditional: 315, independent unconditional: 1305, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1646, independent: 1582, independent conditional: 0, independent unconditional: 1582, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 38, independent conditional: 29, independent unconditional: 9, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 38, independent conditional: 29, independent unconditional: 9, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, independent: 49, independent conditional: 42, independent unconditional: 7, dependent: 142, dependent conditional: 105, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1326303, independent: 1277776, independent conditional: 293385, independent unconditional: 984391, dependent: 46881, dependent conditional: 8878, dependent unconditional: 38003, unknown: 1646, unknown conditional: 327, unknown unconditional: 1319] , Statistics on independence cache: Total cache size (in pairs): 1646, Positive cache size: 1620, Positive conditional cache size: 315, Positive unconditional cache size: 1305, Negative cache size: 26, Negative conditional cache size: 12, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 347704, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1326303, independent: 1279396, independent conditional: 614191, independent unconditional: 665205, dependent: 46907, dependent conditional: 36103, dependent unconditional: 10804, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1326303, independent: 1279396, independent conditional: 293700, independent unconditional: 985696, dependent: 46907, dependent conditional: 8890, dependent unconditional: 38017, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1326303, independent: 1279396, independent conditional: 293700, independent unconditional: 985696, dependent: 46907, dependent conditional: 8890, dependent unconditional: 38017, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1646, independent: 1620, independent conditional: 315, independent unconditional: 1305, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1646, independent: 1582, independent conditional: 0, independent unconditional: 1582, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 38, independent conditional: 29, independent unconditional: 9, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 38, independent conditional: 29, independent unconditional: 9, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, independent: 49, independent conditional: 42, independent unconditional: 7, dependent: 142, dependent conditional: 105, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1326303, independent: 1277776, independent conditional: 293385, independent unconditional: 984391, dependent: 46881, dependent conditional: 8878, dependent unconditional: 38003, unknown: 1646, unknown conditional: 327, unknown unconditional: 1319] , Statistics on independence cache: Total cache size (in pairs): 1646, Positive cache size: 1620, Positive conditional cache size: 315, Positive unconditional cache size: 1305, Negative cache size: 26, Negative conditional cache size: 12, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 347704 ], Independence queries for same thread: 407 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z=0] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z=0] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z=0] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z=0] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z=0] [L742] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z=0] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z=0] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z=0] [L745] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z=0] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z=0] [L747] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z=0] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 pthread_t t973; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L857] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t974; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t975; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t976; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L807] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 861]: 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: 857]: 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: 863]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 174 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 487.6s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 484.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 627 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 1674 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 471.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 428, ConditionalCommutativityTraceChecks: 158, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 14:47:55,995 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:47:56,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...