/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/mix030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 14:32:24,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 14:32:24,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 14:32:24,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 14:32:24,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 14:32:24,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 14:32:24,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 14:32:24,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 14:32:24,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 14:32:24,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 14:32:24,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 14:32:24,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 14:32:24,916 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 14:32:24,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 14:32:24,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 14:32:24,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 14:32:24,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 14:32:24,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 14:32:24,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 14:32:24,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 14:32:24,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 14:32:24,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 14:32:24,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 14:32:24,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 14:32:24,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 14:32:24,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 14:32:24,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 14:32:24,920 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 14:32:24,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 14:32:24,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:32:24,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 14:32:24,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 14:32:24,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 14:32:24,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 14:32:24,922 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 14:32:24,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 14:32:24,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 14:32:24,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 14:32:24,923 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 14:32:24,923 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:32:25,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 14:32:25,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 14:32:25,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 14:32:25,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 14:32:25,152 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 14:32:25,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2024-05-06 14:32:26,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 14:32:26,354 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 14:32:26,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2024-05-06 14:32:26,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/969b2f2b3/bfe36eb604104b038dad718a5f0fdc87/FLAGa8ffb8328 [2024-05-06 14:32:26,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/969b2f2b3/bfe36eb604104b038dad718a5f0fdc87 [2024-05-06 14:32:26,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 14:32:26,388 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 14:32:26,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 14:32:26,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 14:32:26,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 14:32:26,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:32:26" (1/1) ... [2024-05-06 14:32:26,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671624f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26, skipping insertion in model container [2024-05-06 14:32:26,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:32:26" (1/1) ... [2024-05-06 14:32:26,431 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 14:32:26,574 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/mix030_power.opt_pso.opt_rmo.opt.i[966,979] [2024-05-06 14:32:26,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:32:26,755 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 14:32:26,766 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/mix030_power.opt_pso.opt_rmo.opt.i[966,979] [2024-05-06 14:32:26,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:32:26,847 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:32:26,847 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:32:26,853 INFO L206 MainTranslator]: Completed translation [2024-05-06 14:32:26,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26 WrapperNode [2024-05-06 14:32:26,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 14:32:26,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 14:32:26,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 14:32:26,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 14:32:26,860 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:32:26" (1/1) ... [2024-05-06 14:32:26,887 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:32:26" (1/1) ... [2024-05-06 14:32:26,922 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2024-05-06 14:32:26,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 14:32:26,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 14:32:26,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 14:32:26,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 14:32:26,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26" (1/1) ... [2024-05-06 14:32:26,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26" (1/1) ... [2024-05-06 14:32:26,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26" (1/1) ... [2024-05-06 14:32:26,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26" (1/1) ... [2024-05-06 14:32:26,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26" (1/1) ... [2024-05-06 14:32:26,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26" (1/1) ... [2024-05-06 14:32:26,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26" (1/1) ... [2024-05-06 14:32:26,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26" (1/1) ... [2024-05-06 14:32:26,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 14:32:26,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 14:32:26,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 14:32:26,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 14:32:26,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26" (1/1) ... [2024-05-06 14:32:26,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:32:26,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:32:27,014 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:32:27,033 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:32:27,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 14:32:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 14:32:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 14:32:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 14:32:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 14:32:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 14:32:27,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 14:32:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 14:32:27,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 14:32:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 14:32:27,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 14:32:27,059 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-06 14:32:27,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-06 14:32:27,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 14:32:27,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 14:32:27,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 14:32:27,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 14:32:27,061 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:32:27,188 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 14:32:27,190 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 14:32:27,493 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 14:32:27,616 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 14:32:27,617 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 14:32:27,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:32:27 BoogieIcfgContainer [2024-05-06 14:32:27,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 14:32:27,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 14:32:27,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 14:32:27,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 14:32:27,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 02:32:26" (1/3) ... [2024-05-06 14:32:27,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5578c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:32:27, skipping insertion in model container [2024-05-06 14:32:27,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:32:26" (2/3) ... [2024-05-06 14:32:27,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5578c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:32:27, skipping insertion in model container [2024-05-06 14:32:27,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:32:27" (3/3) ... [2024-05-06 14:32:27,626 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i [2024-05-06 14:32:27,633 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 14:32:27,640 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 14:32:27,640 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 14:32:27,640 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 14:32:27,700 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 14:32:27,741 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 14:32:27,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 14:32:27,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:32:27,745 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:32:27,755 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:32:27,785 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 14:32:27,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:32:27,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 14:32:27,803 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;@4426f541, 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:32:27,803 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-06 14:32:27,836 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:32:27,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:32:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 815287101, now seen corresponding path program 1 times [2024-05-06 14:32:27,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:32:27,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822440739] [2024-05-06 14:32:27,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:27,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:32:28,455 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:32:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:32:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822440739] [2024-05-06 14:32:28,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822440739] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:32:28,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:32:28,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-06 14:32:28,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161756932] [2024-05-06 14:32:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:32:28,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-06 14:32:28,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:32:28,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 14:32:28,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-06 14:32:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:32:28,481 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:32:28,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:32:28,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:32:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:32:28,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 14:32:28,590 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:32:28,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:32:28,590 INFO L85 PathProgramCache]: Analyzing trace with hash 319279474, now seen corresponding path program 1 times [2024-05-06 14:32:28,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:32:28,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363671358] [2024-05-06 14:32:28,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:28,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:32:29,094 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:32:29,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:32:29,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363671358] [2024-05-06 14:32:29,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363671358] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:32:29,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:32:29,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 14:32:29,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781734737] [2024-05-06 14:32:29,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:32:29,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 14:32:29,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:32:29,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 14:32:29,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-06 14:32:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:32:29,101 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:32:29,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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:32:29,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:32:29,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:32:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash 858530880, now seen corresponding path program 1 times [2024-05-06 14:32:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:29,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:29,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:32:29,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:32:29,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 14:32:29,616 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:32:29,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:32:29,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1300679182, now seen corresponding path program 1 times [2024-05-06 14:32:29,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:32:29,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526544740] [2024-05-06 14:32:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:29,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:32:30,166 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:32:30,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:32:30,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526544740] [2024-05-06 14:32:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526544740] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:32:30,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:32:30,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 14:32:30,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891388123] [2024-05-06 14:32:30,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:32:30,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 14:32:30,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:32:30,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 14:32:30,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 14:32:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:32:30,168 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:32:30,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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:32:30,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:32:30,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:32:30,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:32:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash 858530880, now seen corresponding path program 2 times [2024-05-06 14:32:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:30,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:30,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:30,553 INFO L85 PathProgramCache]: Analyzing trace with hash 826535945, now seen corresponding path program 1 times [2024-05-06 14:32:30,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:30,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:30,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1639718977, now seen corresponding path program 1 times [2024-05-06 14:32:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:30,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:30,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1306881753, now seen corresponding path program 1 times [2024-05-06 14:32:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:31,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1011988750, now seen corresponding path program 1 times [2024-05-06 14:32:31,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:31,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1556665416, now seen corresponding path program 1 times [2024-05-06 14:32:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:31,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash -465856910, now seen corresponding path program 1 times [2024-05-06 14:32:31,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:31,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1677595626, now seen corresponding path program 1 times [2024-05-06 14:32:31,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,559 INFO L85 PathProgramCache]: Analyzing trace with hash 84431445, now seen corresponding path program 1 times [2024-05-06 14:32:31,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:31,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1936939029, now seen corresponding path program 1 times [2024-05-06 14:32:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,806 INFO L85 PathProgramCache]: Analyzing trace with hash -755218452, now seen corresponding path program 1 times [2024-05-06 14:32:31,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:31,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:31,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1942925201, now seen corresponding path program 1 times [2024-05-06 14:32:32,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:32,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash 736166394, now seen corresponding path program 1 times [2024-05-06 14:32:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:32,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash 297028526, now seen corresponding path program 1 times [2024-05-06 14:32:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:32,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2080729944, now seen corresponding path program 1 times [2024-05-06 14:32:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:32,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1591141025, now seen corresponding path program 1 times [2024-05-06 14:32:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash -641409495, now seen corresponding path program 1 times [2024-05-06 14:32:32,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:32,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2098900511, now seen corresponding path program 1 times [2024-05-06 14:32:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1317766855, now seen corresponding path program 1 times [2024-05-06 14:32:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:32,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1065869948, now seen corresponding path program 1 times [2024-05-06 14:32:33,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash -311477540, now seen corresponding path program 1 times [2024-05-06 14:32:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 821236443, now seen corresponding path program 1 times [2024-05-06 14:32:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1821943839, now seen corresponding path program 1 times [2024-05-06 14:32:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2030877624, now seen corresponding path program 1 times [2024-05-06 14:32:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:33,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1454798944, now seen corresponding path program 1 times [2024-05-06 14:32:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash -608179930, now seen corresponding path program 1 times [2024-05-06 14:32:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,150 INFO L85 PathProgramCache]: Analyzing trace with hash -435260653, now seen corresponding path program 1 times [2024-05-06 14:32:34,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:34,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1509980023, now seen corresponding path program 1 times [2024-05-06 14:32:34,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:34,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1890953517, now seen corresponding path program 1 times [2024-05-06 14:32:34,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash -338093163, now seen corresponding path program 1 times [2024-05-06 14:32:34,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:34,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash 266188534, now seen corresponding path program 1 times [2024-05-06 14:32:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:34,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1394060074, now seen corresponding path program 1 times [2024-05-06 14:32:34,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:34,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,648 INFO L85 PathProgramCache]: Analyzing trace with hash 460611789, now seen corresponding path program 1 times [2024-05-06 14:32:34,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:34,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:34,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,442 INFO L85 PathProgramCache]: Analyzing trace with hash 663313335, now seen corresponding path program 1 times [2024-05-06 14:32:35,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:35,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1225528734, now seen corresponding path program 1 times [2024-05-06 14:32:35,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:35,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1207392840, now seen corresponding path program 1 times [2024-05-06 14:32:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:35,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2039261726, now seen corresponding path program 1 times [2024-05-06 14:32:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,748 INFO L85 PathProgramCache]: Analyzing trace with hash 488406694, now seen corresponding path program 1 times [2024-05-06 14:32:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:35,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1678323141, now seen corresponding path program 1 times [2024-05-06 14:32:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:35,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1162518139, now seen corresponding path program 1 times [2024-05-06 14:32:35,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:35,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:35,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2040709284, now seen corresponding path program 1 times [2024-05-06 14:32:36,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:36,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:36,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2039186887, now seen corresponding path program 1 times [2024-05-06 14:32:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:32:39,756 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:32:39,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:39,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:32:39,806 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:32:39,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 14:32:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-06 14:32:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 858530880, now seen corresponding path program 3 times [2024-05-06 14:32:39,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:39,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:39,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash 826535945, now seen corresponding path program 2 times [2024-05-06 14:32:40,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:40,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1639718977, now seen corresponding path program 2 times [2024-05-06 14:32:40,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:40,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1306881753, now seen corresponding path program 2 times [2024-05-06 14:32:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1011988750, now seen corresponding path program 2 times [2024-05-06 14:32:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:40,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1556665416, now seen corresponding path program 2 times [2024-05-06 14:32:40,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash -465856910, now seen corresponding path program 2 times [2024-05-06 14:32:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1677595626, now seen corresponding path program 2 times [2024-05-06 14:32:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:40,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,889 INFO L85 PathProgramCache]: Analyzing trace with hash 84431445, now seen corresponding path program 2 times [2024-05-06 14:32:40,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:40,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:40,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1936939029, now seen corresponding path program 2 times [2024-05-06 14:32:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:41,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,125 INFO L85 PathProgramCache]: Analyzing trace with hash -755218452, now seen corresponding path program 2 times [2024-05-06 14:32:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1942925201, now seen corresponding path program 2 times [2024-05-06 14:32:41,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:41,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash 736166394, now seen corresponding path program 2 times [2024-05-06 14:32:41,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash 297028526, now seen corresponding path program 2 times [2024-05-06 14:32:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2080729944, now seen corresponding path program 2 times [2024-05-06 14:32:41,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:41,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1591141025, now seen corresponding path program 2 times [2024-05-06 14:32:41,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash -641409495, now seen corresponding path program 2 times [2024-05-06 14:32:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2098900511, now seen corresponding path program 2 times [2024-05-06 14:32:42,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:42,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1317766855, now seen corresponding path program 2 times [2024-05-06 14:32:42,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:42,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1065869948, now seen corresponding path program 2 times [2024-05-06 14:32:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:42,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash -311477540, now seen corresponding path program 2 times [2024-05-06 14:32:42,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:42,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,456 INFO L85 PathProgramCache]: Analyzing trace with hash 821236443, now seen corresponding path program 2 times [2024-05-06 14:32:42,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:42,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash -608179930, now seen corresponding path program 2 times [2024-05-06 14:32:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash -435260653, now seen corresponding path program 2 times [2024-05-06 14:32:42,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:32:42,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:32:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:32:42,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:32:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:33:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1172346613, now seen corresponding path program 1 times [2024-05-06 14:33:02,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:33:02,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:33:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:33:02,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:33:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:33:03,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1584089432, now seen corresponding path program 1 times [2024-05-06 14:33:03,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:33:03,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:33:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:33:03,381 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:33:03,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:33:03,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:33:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:33:03,437 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:33:03,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 14:33:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-06 14:33:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1172346613, now seen corresponding path program 2 times [2024-05-06 14:33:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:33:22,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:33:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:33:22,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:33:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:33:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2035417058, now seen corresponding path program 1 times [2024-05-06 14:33:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:33:45,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:33:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:33:45,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:33:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:34:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2036017012, now seen corresponding path program 1 times [2024-05-06 14:34:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:34:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:34:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:34:07,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:34:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:34:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1731700673, now seen corresponding path program 1 times [2024-05-06 14:34:31,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:34:31,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:34:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:34:31,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:34:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:36:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash -245019661, now seen corresponding path program 1 times [2024-05-06 14:36:11,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:36:11,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:36:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:36:11,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:36:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:36:51,457 INFO L85 PathProgramCache]: Analyzing trace with hash 689216952, now seen corresponding path program 1 times [2024-05-06 14:36:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:36:51,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:36:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:36:51,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:36:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1942457304, now seen corresponding path program 1 times [2024-05-06 14:37:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:01,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:01,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash -175945972, now seen corresponding path program 1 times [2024-05-06 14:37:04,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:04,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:04,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1658770835, now seen corresponding path program 1 times [2024-05-06 14:37:07,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:07,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1578961051, now seen corresponding path program 1 times [2024-05-06 14:37:09,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:09,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:12,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1469748141, now seen corresponding path program 1 times [2024-05-06 14:37:12,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:12,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:12,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash 368649533, now seen corresponding path program 1 times [2024-05-06 14:37:15,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:15,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:15,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:17,905 INFO L85 PathProgramCache]: Analyzing trace with hash -400382000, now seen corresponding path program 1 times [2024-05-06 14:37:17,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:17,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:17,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1512238856, now seen corresponding path program 1 times [2024-05-06 14:37:20,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:20,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:20,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1610060519, now seen corresponding path program 1 times [2024-05-06 14:37:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:23,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash 910900128, now seen corresponding path program 1 times [2024-05-06 14:37:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:25,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:26,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1826866709, now seen corresponding path program 1 times [2024-05-06 14:37:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:26,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:26,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash -798292519, now seen corresponding path program 1 times [2024-05-06 14:37:27,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:27,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:27,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash 349986136, now seen corresponding path program 2 times [2024-05-06 14:37:30,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:30,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:30,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:31,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1443543570, now seen corresponding path program 2 times [2024-05-06 14:37:31,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:31,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:31,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:33,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1065973075, now seen corresponding path program 2 times [2024-05-06 14:37:33,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:33,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:33,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1964413949, now seen corresponding path program 2 times [2024-05-06 14:37:34,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:34,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:35,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2024546259, now seen corresponding path program 2 times [2024-05-06 14:37:35,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:35,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:35,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:36,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1437586527, now seen corresponding path program 2 times [2024-05-06 14:37:36,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:36,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:37,824 INFO L85 PathProgramCache]: Analyzing trace with hash 927802320, now seen corresponding path program 2 times [2024-05-06 14:37:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:37,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:37,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:38,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1812212650, now seen corresponding path program 2 times [2024-05-06 14:37:38,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:38,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:38,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash 590700185, now seen corresponding path program 2 times [2024-05-06 14:37:39,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:39,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:39,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:40,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:37:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:37:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:37:40,271 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,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79,SelfDestructingSolverStorable100,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,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2024-05-06 14:37:40,271 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:37:40,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:37:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2075970226, now seen corresponding path program 2 times [2024-05-06 14:37:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:37:40,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132413528] [2024-05-06 14:37:40,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:40,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:37:40,986 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:37:40,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:37:40,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132413528] [2024-05-06 14:37:40,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132413528] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:37:40,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:37:40,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-05-06 14:37:40,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003562369] [2024-05-06 14:37:40,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:37:40,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-06 14:37:40,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:37:40,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-06 14:37:40,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-05-06 14:37:40,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:37:40,990 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:37:40,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 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:37:40,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:37:40,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:37:40,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:37:40,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:37:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1172346613, now seen corresponding path program 3 times [2024-05-06 14:37:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:41,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2035417058, now seen corresponding path program 2 times [2024-05-06 14:37:41,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:41,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:41,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:42,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2036017012, now seen corresponding path program 2 times [2024-05-06 14:37:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:42,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:42,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1731700673, now seen corresponding path program 2 times [2024-05-06 14:37:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:42,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash -245019661, now seen corresponding path program 2 times [2024-05-06 14:37:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:37:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:37:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:37:45,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:37:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,318 INFO L85 PathProgramCache]: Analyzing trace with hash 910900128, now seen corresponding path program 2 times [2024-05-06 14:38:35,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:35,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:35,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash 349986136, now seen corresponding path program 3 times [2024-05-06 14:38:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:37,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:37,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1443543570, now seen corresponding path program 3 times [2024-05-06 14:38:38,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:38,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:38,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1065973075, now seen corresponding path program 3 times [2024-05-06 14:38:39,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:39,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:39,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1964413949, now seen corresponding path program 3 times [2024-05-06 14:38:40,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:40,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:41,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2024546259, now seen corresponding path program 3 times [2024-05-06 14:38:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:41,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1437586527, now seen corresponding path program 3 times [2024-05-06 14:38:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:42,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:43,714 INFO L85 PathProgramCache]: Analyzing trace with hash 927802320, now seen corresponding path program 3 times [2024-05-06 14:38:43,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:43,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:43,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1812212650, now seen corresponding path program 3 times [2024-05-06 14:38:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:44,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash 590700185, now seen corresponding path program 3 times [2024-05-06 14:38:45,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:38:45,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:38:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:38:45,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:38:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:01,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 14:39:01,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:39:01,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:39:01,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 14:39:01,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable104,SelfDestructingSolverStorable115,SelfDestructingSolverStorable105,SelfDestructingSolverStorable116,SelfDestructingSolverStorable106,SelfDestructingSolverStorable107,SelfDestructingSolverStorable111,SelfDestructingSolverStorable101,SelfDestructingSolverStorable112,SelfDestructingSolverStorable102,SelfDestructingSolverStorable113,SelfDestructingSolverStorable103,SelfDestructingSolverStorable114 [2024-05-06 14:39:01,614 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:39:01,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:39:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1799092402, now seen corresponding path program 3 times [2024-05-06 14:39:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:39:01,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375851792] [2024-05-06 14:39:01,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:01,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:01,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:01,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 14:39:01,659 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 14:39:01,660 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-06 14:39:01,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-06 14:39:01,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-05-06 14:39:01,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-05-06 14:39:01,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-06 14:39:01,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-06 14:39:01,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-06 14:39:01,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-05-06 14:39:01,665 INFO L448 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 14:39:01,669 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 14:39:01,669 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 14:39:01,724 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2024-05-06 14:39:01,733 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 14:39:01,734 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 14:39:01,736 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 14:39:01,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 02:39:01 BasicIcfg [2024-05-06 14:39:01,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 14:39:01,757 INFO L158 Benchmark]: Toolchain (without parser) took 395369.17ms. Allocated memory was 200.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 125.5MB in the beginning and 863.0MB in the end (delta: -737.5MB). Peak memory consumption was 766.6MB. Max. memory is 8.0GB. [2024-05-06 14:39:01,757 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 14:39:01,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.97ms. Allocated memory is still 200.3MB. Free memory was 125.3MB in the beginning and 101.1MB in the end (delta: 24.2MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2024-05-06 14:39:01,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.06ms. Allocated memory is still 200.3MB. Free memory was 101.1MB in the beginning and 98.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 14:39:01,758 INFO L158 Benchmark]: Boogie Preprocessor took 25.55ms. Allocated memory is still 200.3MB. Free memory was 98.3MB in the beginning and 96.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:39:01,758 INFO L158 Benchmark]: RCFGBuilder took 669.36ms. Allocated memory was 200.3MB in the beginning and 400.6MB in the end (delta: 200.3MB). Free memory was 96.4MB in the beginning and 347.6MB in the end (delta: -251.2MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. [2024-05-06 14:39:01,758 INFO L158 Benchmark]: TraceAbstraction took 394136.22ms. Allocated memory was 400.6MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 346.6MB in the beginning and 863.0MB in the end (delta: -516.4MB). Peak memory consumption was 787.5MB. Max. memory is 8.0GB. [2024-05-06 14:39:01,759 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.10ms. Allocated memory is still 200.3MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.97ms. Allocated memory is still 200.3MB. Free memory was 125.3MB in the beginning and 101.1MB in the end (delta: 24.2MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.06ms. Allocated memory is still 200.3MB. Free memory was 101.1MB in the beginning and 98.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.55ms. Allocated memory is still 200.3MB. Free memory was 98.3MB in the beginning and 96.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 669.36ms. Allocated memory was 200.3MB in the beginning and 400.6MB in the end (delta: 200.3MB). Free memory was 96.4MB in the beginning and 347.6MB in the end (delta: -251.2MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. * TraceAbstraction took 394136.22ms. Allocated memory was 400.6MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 346.6MB in the beginning and 863.0MB in the end (delta: -516.4MB). Peak memory consumption was 787.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 819625, independent: 812160, independent conditional: 812116, independent unconditional: 44, dependent: 7465, dependent conditional: 7465, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 819242, independent: 812160, independent conditional: 812116, independent unconditional: 44, dependent: 7082, dependent conditional: 7082, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 819242, independent: 812160, independent conditional: 812116, independent unconditional: 44, dependent: 7082, dependent conditional: 7082, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 819242, independent: 812160, independent conditional: 812116, independent unconditional: 44, dependent: 7082, dependent conditional: 7082, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 846164, independent: 812160, independent conditional: 390241, independent unconditional: 421919, dependent: 34004, dependent conditional: 26798, dependent unconditional: 7206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 846164, independent: 812160, independent conditional: 197565, independent unconditional: 614595, dependent: 34004, dependent conditional: 8217, dependent unconditional: 25787, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 846164, independent: 812160, independent conditional: 197565, independent unconditional: 614595, dependent: 34004, dependent conditional: 8217, dependent unconditional: 25787, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1735, independent: 1670, independent conditional: 358, independent unconditional: 1312, dependent: 65, dependent conditional: 41, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1735, independent: 1626, independent conditional: 0, independent unconditional: 1626, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 109, independent: 44, independent conditional: 36, independent unconditional: 8, dependent: 65, dependent conditional: 41, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 109, independent: 44, independent conditional: 36, independent unconditional: 8, dependent: 65, dependent conditional: 41, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, independent: 90, independent conditional: 85, independent unconditional: 5, dependent: 232, dependent conditional: 160, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 846164, independent: 810490, independent conditional: 197207, independent unconditional: 613283, dependent: 33939, dependent conditional: 8176, dependent unconditional: 25763, unknown: 1735, unknown conditional: 399, unknown unconditional: 1336] , Statistics on independence cache: Total cache size (in pairs): 1735, Positive cache size: 1670, Positive conditional cache size: 358, Positive unconditional cache size: 1312, Negative cache size: 65, Negative conditional cache size: 41, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 211257, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 846164, independent: 812160, independent conditional: 390241, independent unconditional: 421919, dependent: 34004, dependent conditional: 26798, dependent unconditional: 7206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 846164, independent: 812160, independent conditional: 197565, independent unconditional: 614595, dependent: 34004, dependent conditional: 8217, dependent unconditional: 25787, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 846164, independent: 812160, independent conditional: 197565, independent unconditional: 614595, dependent: 34004, dependent conditional: 8217, dependent unconditional: 25787, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1735, independent: 1670, independent conditional: 358, independent unconditional: 1312, dependent: 65, dependent conditional: 41, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1735, independent: 1626, independent conditional: 0, independent unconditional: 1626, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 109, independent: 44, independent conditional: 36, independent unconditional: 8, dependent: 65, dependent conditional: 41, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 109, independent: 44, independent conditional: 36, independent unconditional: 8, dependent: 65, dependent conditional: 41, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, independent: 90, independent conditional: 85, independent unconditional: 5, dependent: 232, dependent conditional: 160, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 846164, independent: 810490, independent conditional: 197207, independent unconditional: 613283, dependent: 33939, dependent conditional: 8176, dependent unconditional: 25763, unknown: 1735, unknown conditional: 399, unknown unconditional: 1336] , Statistics on independence cache: Total cache size (in pairs): 1735, Positive cache size: 1670, Positive conditional cache size: 358, Positive unconditional cache size: 1312, Negative cache size: 65, Negative conditional cache size: 41, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 211257 ], Independence queries for same thread: 383 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y=0] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y=0] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L844] 0 pthread_t t805; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t805, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t806; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t806, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t807; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t807, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L850] 0 pthread_t t808; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L851] FCALL, FORK 0 pthread_create(&t808, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L748] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L751] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L778] 2 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=2, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L808] 3 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=2, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 393.9s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 391.4s, 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: 45, 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.0s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 2008 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 383.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityConditionCalculations: 660, ConditionalCommutativityTraceChecks: 111, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 14:39:01,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-06 14:39:02,053 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...