/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/mix055.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 15:02:40,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 15:02:40,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 15:02:40,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 15:02:40,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 15:02:41,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 15:02:41,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 15:02:41,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 15:02:41,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 15:02:41,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 15:02:41,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 15:02:41,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 15:02:41,017 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 15:02:41,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 15:02:41,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 15:02:41,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 15:02:41,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 15:02:41,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 15:02:41,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 15:02:41,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 15:02:41,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 15:02:41,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 15:02:41,020 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 15:02:41,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 15:02:41,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 15:02:41,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 15:02:41,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 15:02:41,020 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 15:02:41,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 15:02:41,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 15:02:41,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 15:02:41,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 15:02:41,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 15:02:41,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 15:02:41,043 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 15:02:41,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 15:02:41,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 15:02:41,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 15:02:41,044 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 15:02:41,044 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 15:02:41,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 15:02:41,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 15:02:41,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 15:02:41,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 15:02:41,327 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 15:02:41,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2024-05-06 15:02:42,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 15:02:42,685 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 15:02:42,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2024-05-06 15:02:42,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/29d542b04/9e995273f09d4bcdb5e5b02c29ff23c8/FLAG34c402132 [2024-05-06 15:02:42,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/29d542b04/9e995273f09d4bcdb5e5b02c29ff23c8 [2024-05-06 15:02:42,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 15:02:42,725 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 15:02:42,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 15:02:42,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 15:02:42,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 15:02:42,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 03:02:42" (1/1) ... [2024-05-06 15:02:42,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e40959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:42, skipping insertion in model container [2024-05-06 15:02:42,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 03:02:42" (1/1) ... [2024-05-06 15:02:42,781 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 15:02:42,962 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/mix055.opt.i[944,957] [2024-05-06 15:02:43,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 15:02:43,168 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 15:02:43,177 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/mix055.opt.i[944,957] [2024-05-06 15:02:43,260 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 15:02:43,316 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 15:02:43,316 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 15:02:43,321 INFO L206 MainTranslator]: Completed translation [2024-05-06 15:02:43,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43 WrapperNode [2024-05-06 15:02:43,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 15:02:43,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 15:02:43,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 15:02:43,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 15:02:43,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (1/1) ... [2024-05-06 15:02:43,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (1/1) ... [2024-05-06 15:02:43,374 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2024-05-06 15:02:43,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 15:02:43,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 15:02:43,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 15:02:43,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 15:02:43,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (1/1) ... [2024-05-06 15:02:43,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (1/1) ... [2024-05-06 15:02:43,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (1/1) ... [2024-05-06 15:02:43,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (1/1) ... [2024-05-06 15:02:43,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (1/1) ... [2024-05-06 15:02:43,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (1/1) ... [2024-05-06 15:02:43,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (1/1) ... [2024-05-06 15:02:43,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (1/1) ... [2024-05-06 15:02:43,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 15:02:43,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 15:02:43,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 15:02:43,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 15:02:43,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (1/1) ... [2024-05-06 15:02:43,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 15:02:43,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 15:02:43,450 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 15:02:43,470 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 15:02:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 15:02:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 15:02:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 15:02:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 15:02:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 15:02:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 15:02:43,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 15:02:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 15:02:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 15:02:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 15:02:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 15:02:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-06 15:02:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-06 15:02:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 15:02:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 15:02:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 15:02:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 15:02:43,509 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 15:02:43,665 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 15:02:43,668 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 15:02:43,887 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 15:02:43,971 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 15:02:43,972 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 15:02:43,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 03:02:43 BoogieIcfgContainer [2024-05-06 15:02:43,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 15:02:43,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 15:02:43,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 15:02:43,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 15:02:43,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 03:02:42" (1/3) ... [2024-05-06 15:02:43,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7e3616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 03:02:43, skipping insertion in model container [2024-05-06 15:02:43,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:02:43" (2/3) ... [2024-05-06 15:02:43,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7e3616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 03:02:43, skipping insertion in model container [2024-05-06 15:02:43,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 03:02:43" (3/3) ... [2024-05-06 15:02:43,979 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2024-05-06 15:02:43,985 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 15:02:43,993 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 15:02:43,993 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 15:02:43,993 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 15:02:44,039 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 15:02:44,079 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 15:02:44,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 15:02:44,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 15:02:44,090 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 15:02:44,097 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 15:02:44,118 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 15:02:44,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 15:02:44,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 15:02:44,148 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;@4e3d662, 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 15:02:44,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-06 15:02:44,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 15:02:44,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 15:02:44,218 INFO L85 PathProgramCache]: Analyzing trace with hash -911375918, now seen corresponding path program 1 times [2024-05-06 15:02:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 15:02:44,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392302342] [2024-05-06 15:02:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:02:45,046 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 15:02:45,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 15:02:45,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392302342] [2024-05-06 15:02:45,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392302342] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 15:02:45,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 15:02:45,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-06 15:02:45,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344503442] [2024-05-06 15:02:45,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 15:02:45,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-06 15:02:45,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 15:02:45,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-06 15:02:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-06 15:02:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:02:45,082 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 15:02:45,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 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 15:02:45,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:02:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 15:02:45,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 15:02:45,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 15:02:45,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 15:02:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1908921683, now seen corresponding path program 1 times [2024-05-06 15:02:45,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 15:02:45,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936767688] [2024-05-06 15:02:45,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:45,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:02:45,556 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 15:02:45,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 15:02:45,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936767688] [2024-05-06 15:02:45,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936767688] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 15:02:45,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 15:02:45,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 15:02:45,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476065820] [2024-05-06 15:02:45,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 15:02:45,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 15:02:45,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 15:02:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 15:02:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-06 15:02:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:02:45,561 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 15:02:45,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 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 15:02:45,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 15:02:45,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:02:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash 72661743, now seen corresponding path program 1 times [2024-05-06 15:02:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:45,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 15:02:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 15:02:46,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 15:02:46,017 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 15:02:46,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 15:02:46,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2050759771, now seen corresponding path program 1 times [2024-05-06 15:02:46,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 15:02:46,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697124570] [2024-05-06 15:02:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:02:46,809 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 15:02:46,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 15:02:46,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697124570] [2024-05-06 15:02:46,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697124570] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 15:02:46,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 15:02:46,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 15:02:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132737394] [2024-05-06 15:02:46,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 15:02:46,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 15:02:46,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 15:02:46,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 15:02:46,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 15:02:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:02:46,812 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 15:02:46,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 15:02:46,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 15:02:46,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 15:02:46,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:02:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash 72661743, now seen corresponding path program 2 times [2024-05-06 15:02:46,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:46,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash -119921427, now seen corresponding path program 1 times [2024-05-06 15:02:47,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1898619954, now seen corresponding path program 1 times [2024-05-06 15:02:47,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash -345802547, now seen corresponding path program 1 times [2024-05-06 15:02:47,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:47,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,726 INFO L85 PathProgramCache]: Analyzing trace with hash -288249529, now seen corresponding path program 1 times [2024-05-06 15:02:47,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash 821985662, now seen corresponding path program 1 times [2024-05-06 15:02:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash -666220982, now seen corresponding path program 1 times [2024-05-06 15:02:47,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:47,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1363982425, now seen corresponding path program 1 times [2024-05-06 15:02:48,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:48,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1983662119, now seen corresponding path program 1 times [2024-05-06 15:02:48,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:48,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash 341083799, now seen corresponding path program 1 times [2024-05-06 15:02:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1812118013, now seen corresponding path program 1 times [2024-05-06 15:02:48,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:48,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash -803725021, now seen corresponding path program 1 times [2024-05-06 15:02:48,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash 683092025, now seen corresponding path program 1 times [2024-05-06 15:02:48,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:48,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1595621630, now seen corresponding path program 1 times [2024-05-06 15:02:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:48,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:48,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,030 INFO L85 PathProgramCache]: Analyzing trace with hash 218160921, now seen corresponding path program 1 times [2024-05-06 15:02:49,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:49,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1946700155, now seen corresponding path program 1 times [2024-05-06 15:02:49,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:49,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1863912138, now seen corresponding path program 1 times [2024-05-06 15:02:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,337 INFO L85 PathProgramCache]: Analyzing trace with hash -78421122, now seen corresponding path program 1 times [2024-05-06 15:02:49,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:49,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash -556718939, now seen corresponding path program 1 times [2024-05-06 15:02:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:49,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1819073957, now seen corresponding path program 1 times [2024-05-06 15:02:49,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:49,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2019530211, now seen corresponding path program 1 times [2024-05-06 15:02:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1173524785, now seen corresponding path program 1 times [2024-05-06 15:02:49,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash -409535794, now seen corresponding path program 1 times [2024-05-06 15:02:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash 141618478, now seen corresponding path program 1 times [2024-05-06 15:02:49,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:49,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2028730515, now seen corresponding path program 1 times [2024-05-06 15:02:50,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:50,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash -488546994, now seen corresponding path program 1 times [2024-05-06 15:02:50,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:50,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1816874842, now seen corresponding path program 1 times [2024-05-06 15:02:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash -335703489, now seen corresponding path program 1 times [2024-05-06 15:02:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:50,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1790286185, now seen corresponding path program 1 times [2024-05-06 15:02:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -357890726, now seen corresponding path program 1 times [2024-05-06 15:02:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,782 INFO L85 PathProgramCache]: Analyzing trace with hash -11544826, now seen corresponding path program 1 times [2024-05-06 15:02:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:50,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,939 INFO L85 PathProgramCache]: Analyzing trace with hash -416014376, now seen corresponding path program 1 times [2024-05-06 15:02:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:50,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1675987812, now seen corresponding path program 1 times [2024-05-06 15:02:51,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:51,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:51,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1396155002, now seen corresponding path program 1 times [2024-05-06 15:02:51,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:51,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:51,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash -232057350, now seen corresponding path program 1 times [2024-05-06 15:02:51,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:51,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:51,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1254411669, now seen corresponding path program 1 times [2024-05-06 15:02:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:52,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1483555773, now seen corresponding path program 1 times [2024-05-06 15:02:52,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:52,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1156235398, now seen corresponding path program 1 times [2024-05-06 15:02:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:52,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:52,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1976960602, now seen corresponding path program 1 times [2024-05-06 15:02:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:52,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:52,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:52,382 INFO L85 PathProgramCache]: Analyzing trace with hash -767511036, now seen corresponding path program 1 times [2024-05-06 15:02:52,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:52,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:52,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:52,446 INFO L85 PathProgramCache]: Analyzing trace with hash 390883568, now seen corresponding path program 1 times [2024-05-06 15:02:52,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:52,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:52,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:53,263 INFO L85 PathProgramCache]: Analyzing trace with hash -64893198, now seen corresponding path program 1 times [2024-05-06 15:02:53,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:53,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:02:53,333 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 15:02:53,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:53,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:02:53,392 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 15:02:53,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 15:02:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-06 15:02:53,478 INFO L85 PathProgramCache]: Analyzing trace with hash 72661743, now seen corresponding path program 3 times [2024-05-06 15:02:53,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:53,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash -119921427, now seen corresponding path program 2 times [2024-05-06 15:02:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:53,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:53,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1898619954, now seen corresponding path program 2 times [2024-05-06 15:02:53,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:53,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:53,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash -345802547, now seen corresponding path program 2 times [2024-05-06 15:02:53,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:53,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:53,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash -288249529, now seen corresponding path program 2 times [2024-05-06 15:02:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash 821985662, now seen corresponding path program 2 times [2024-05-06 15:02:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,299 INFO L85 PathProgramCache]: Analyzing trace with hash -666220982, now seen corresponding path program 2 times [2024-05-06 15:02:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1363982425, now seen corresponding path program 2 times [2024-05-06 15:02:54,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:54,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1983662119, now seen corresponding path program 2 times [2024-05-06 15:02:54,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash 341083799, now seen corresponding path program 2 times [2024-05-06 15:02:54,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:54,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1812118013, now seen corresponding path program 2 times [2024-05-06 15:02:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash -803725021, now seen corresponding path program 2 times [2024-05-06 15:02:54,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:54,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:54,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash 683092025, now seen corresponding path program 2 times [2024-05-06 15:02:55,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:55,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1595621630, now seen corresponding path program 2 times [2024-05-06 15:02:55,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:55,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash 218160921, now seen corresponding path program 2 times [2024-05-06 15:02:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1946700155, now seen corresponding path program 2 times [2024-05-06 15:02:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:55,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1863912138, now seen corresponding path program 2 times [2024-05-06 15:02:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash -78421122, now seen corresponding path program 2 times [2024-05-06 15:02:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:55,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash -556718939, now seen corresponding path program 2 times [2024-05-06 15:02:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1819073957, now seen corresponding path program 2 times [2024-05-06 15:02:55,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:55,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:55,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2019530211, now seen corresponding path program 2 times [2024-05-06 15:02:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:56,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:56,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1173524785, now seen corresponding path program 2 times [2024-05-06 15:02:56,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:56,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:56,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash -409535794, now seen corresponding path program 2 times [2024-05-06 15:02:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:56,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash -488546994, now seen corresponding path program 2 times [2024-05-06 15:02:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:56,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:56,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:56,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1816874842, now seen corresponding path program 2 times [2024-05-06 15:02:56,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:02:56,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:02:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:02:56,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:02:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:15,821 INFO L85 PathProgramCache]: Analyzing trace with hash -712842041, now seen corresponding path program 1 times [2024-05-06 15:03:15,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:15,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:15,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:16,321 INFO L85 PathProgramCache]: Analyzing trace with hash -829921966, now seen corresponding path program 1 times [2024-05-06 15:03:16,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:16,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:16,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1135084944, now seen corresponding path program 1 times [2024-05-06 15:03:16,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:16,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:16,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:17,207 INFO L85 PathProgramCache]: Analyzing trace with hash -36564669, now seen corresponding path program 1 times [2024-05-06 15:03:17,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:17,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:17,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:17,594 INFO L85 PathProgramCache]: Analyzing trace with hash -970987725, now seen corresponding path program 1 times [2024-05-06 15:03:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:17,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:17,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1832326946, now seen corresponding path program 1 times [2024-05-06 15:03:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:17,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash -613250480, now seen corresponding path program 1 times [2024-05-06 15:03:18,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:18,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1959400676, now seen corresponding path program 1 times [2024-05-06 15:03:19,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:19,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:19,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:19,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2141412570, now seen corresponding path program 1 times [2024-05-06 15:03:19,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:19,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:19,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1392668966, now seen corresponding path program 1 times [2024-05-06 15:03:38,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:38,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:38,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -519613485, now seen corresponding path program 1 times [2024-05-06 15:03:39,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:39,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1125074993, now seen corresponding path program 1 times [2024-05-06 15:03:39,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:39,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:39,889 INFO L85 PathProgramCache]: Analyzing trace with hash -728978428, now seen corresponding path program 1 times [2024-05-06 15:03:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:39,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:40,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1916170322, now seen corresponding path program 1 times [2024-05-06 15:03:40,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:40,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:40,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash 893206495, now seen corresponding path program 1 times [2024-05-06 15:03:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:40,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:40,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash 998690607, now seen corresponding path program 1 times [2024-05-06 15:03:41,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:41,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:41,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash -383381923, now seen corresponding path program 1 times [2024-05-06 15:03:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:41,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1674931259, now seen corresponding path program 1 times [2024-05-06 15:03:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:03:41,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:03:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:03:41,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:03:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:00,419 INFO L85 PathProgramCache]: Analyzing trace with hash -353714520, now seen corresponding path program 1 times [2024-05-06 15:04:00,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:00,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:00,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash -764340079, now seen corresponding path program 1 times [2024-05-06 15:04:00,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:00,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:00,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash -855874735, now seen corresponding path program 1 times [2024-05-06 15:04:01,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:01,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:01,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:01,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2105767870, now seen corresponding path program 1 times [2024-05-06 15:04:01,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:01,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:01,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:02,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1730472876, now seen corresponding path program 1 times [2024-05-06 15:04:02,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:02,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:02,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1856826467, now seen corresponding path program 1 times [2024-05-06 15:04:02,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:02,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:02,897 INFO L85 PathProgramCache]: Analyzing trace with hash -475493455, now seen corresponding path program 1 times [2024-05-06 15:04:02,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:02,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:02,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1954956901, now seen corresponding path program 1 times [2024-05-06 15:04:03,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:03,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:03,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash -617248569, now seen corresponding path program 1 times [2024-05-06 15:04:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:03,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:03,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash -7595353, now seen corresponding path program 1 times [2024-05-06 15:04:24,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:24,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash -749876366, now seen corresponding path program 1 times [2024-05-06 15:04:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:25,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:25,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1271050160, now seen corresponding path program 1 times [2024-05-06 15:04:25,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:25,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:25,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1426423965, now seen corresponding path program 1 times [2024-05-06 15:04:26,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:26,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:26,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2032219411, now seen corresponding path program 1 times [2024-05-06 15:04:26,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:26,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:26,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:26,770 INFO L85 PathProgramCache]: Analyzing trace with hash 896950014, now seen corresponding path program 1 times [2024-05-06 15:04:26,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:26,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash -802303952, now seen corresponding path program 1 times [2024-05-06 15:04:27,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:27,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1359636796, now seen corresponding path program 1 times [2024-05-06 15:04:27,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:27,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:27,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1290789126, now seen corresponding path program 1 times [2024-05-06 15:04:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:27,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:27,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:46,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1930044553, now seen corresponding path program 1 times [2024-05-06 15:04:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:46,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:46,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1419788336, now seen corresponding path program 1 times [2024-05-06 15:04:46,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:46,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash 369907762, now seen corresponding path program 1 times [2024-05-06 15:04:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:46,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:46,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1927679167, now seen corresponding path program 1 times [2024-05-06 15:04:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:47,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:47,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:47,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1586180747, now seen corresponding path program 1 times [2024-05-06 15:04:47,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:47,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:47,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:48,144 INFO L85 PathProgramCache]: Analyzing trace with hash 503132764, now seen corresponding path program 1 times [2024-05-06 15:04:48,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:48,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:48,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash -537913070, now seen corresponding path program 1 times [2024-05-06 15:04:48,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:48,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1229618202, now seen corresponding path program 1 times [2024-05-06 15:04:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:48,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:48,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash -653067672, now seen corresponding path program 1 times [2024-05-06 15:04:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:49,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash -844944956, now seen corresponding path program 1 times [2024-05-06 15:04:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:49,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:59,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2117908520, now seen corresponding path program 1 times [2024-05-06 15:04:59,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:04:59,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:04:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:04:59,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:04:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash -33566959, now seen corresponding path program 1 times [2024-05-06 15:05:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:00,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:00,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:00,494 INFO L85 PathProgramCache]: Analyzing trace with hash 830266577, now seen corresponding path program 1 times [2024-05-06 15:05:00,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:00,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1220092222, now seen corresponding path program 1 times [2024-05-06 15:05:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:00,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:01,367 INFO L85 PathProgramCache]: Analyzing trace with hash 237759956, now seen corresponding path program 1 times [2024-05-06 15:05:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:01,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 15:05:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 15:05:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 15:05:01,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable98,SelfDestructingSolverStorable11,SelfDestructingSolverStorable99,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28,SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable110,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable122,SelfDestructingSolverStorable59,SelfDestructingSolverStorable120,SelfDestructingSolverStorable60,SelfDestructingSolverStorable121,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable119,SelfDestructingSolverStorable65,SelfDestructingSolverStorable115,SelfDestructingSolverStorable66,SelfDestructingSolverStorable116,SelfDestructingSolverStorable67,SelfDestructingSolverStorable117,SelfDestructingSolverStorable68,SelfDestructingSolverStorable118,SelfDestructingSolverStorable69,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 15:05:01,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 15:05:01,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 15:05:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1806835765, now seen corresponding path program 2 times [2024-05-06 15:05:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 15:05:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341051573] [2024-05-06 15:05:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:05:02,194 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 15:05:02,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 15:05:02,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341051573] [2024-05-06 15:05:02,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341051573] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 15:05:02,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 15:05:02,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 15:05:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787218270] [2024-05-06 15:05:02,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 15:05:02,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 15:05:02,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 15:05:02,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 15:05:02,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-06 15:05:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:05:02,198 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 15:05:02,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 15:05:02,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 15:05:02,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 15:05:02,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 15:05:02,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:05:05,788 INFO L85 PathProgramCache]: Analyzing trace with hash -844944956, now seen corresponding path program 2 times [2024-05-06 15:05:05,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:05,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:05,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash 58466284, now seen corresponding path program 1 times [2024-05-06 15:05:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1104465874, now seen corresponding path program 1 times [2024-05-06 15:05:12,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:12,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1628519963, now seen corresponding path program 1 times [2024-05-06 15:05:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,720 INFO L85 PathProgramCache]: Analyzing trace with hash -916582453, now seen corresponding path program 1 times [2024-05-06 15:05:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:12,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1082238432, now seen corresponding path program 1 times [2024-05-06 15:05:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1072036786, now seen corresponding path program 1 times [2024-05-06 15:05:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:12,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 15:05:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 15:05:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 15:05:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 15:05:12,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,SelfDestructingSolverStorable126,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable123,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125 [2024-05-06 15:05:12,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 15:05:12,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 15:05:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1883103631, now seen corresponding path program 3 times [2024-05-06 15:05:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 15:05:12,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498365886] [2024-05-06 15:05:12,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:12,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 15:05:13,726 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 15:05:13,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 15:05:13,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498365886] [2024-05-06 15:05:13,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498365886] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 15:05:13,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 15:05:13,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-06 15:05:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196158970] [2024-05-06 15:05:13,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 15:05:13,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-06 15:05:13,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 15:05:13,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-06 15:05:13,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-06 15:05:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:05:13,728 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 15:05:13,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 15:05:13,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-06 15:05:13,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 15:05:13,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 15:05:13,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-06 15:05:13,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 15:05:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash -844944956, now seen corresponding path program 3 times [2024-05-06 15:05:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:17,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:17,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:24,686 INFO L85 PathProgramCache]: Analyzing trace with hash 58466284, now seen corresponding path program 2 times [2024-05-06 15:05:24,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:24,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:24,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1104465874, now seen corresponding path program 2 times [2024-05-06 15:05:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:24,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:24,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:24,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1628519963, now seen corresponding path program 2 times [2024-05-06 15:05:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:24,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,116 INFO L85 PathProgramCache]: Analyzing trace with hash -916582453, now seen corresponding path program 2 times [2024-05-06 15:05:25,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:25,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1082238432, now seen corresponding path program 2 times [2024-05-06 15:05:25,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:25,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1072036786, now seen corresponding path program 2 times [2024-05-06 15:05:25,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:25,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2044999522, now seen corresponding path program 1 times [2024-05-06 15:05:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:25,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash -349554120, now seen corresponding path program 1 times [2024-05-06 15:05:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1352127010, now seen corresponding path program 1 times [2024-05-06 15:05:25,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:25,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:25,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1985306424, now seen corresponding path program 1 times [2024-05-06 15:05:26,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:26,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1589642705, now seen corresponding path program 1 times [2024-05-06 15:05:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1887667883, now seen corresponding path program 1 times [2024-05-06 15:05:26,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:26,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash -611654890, now seen corresponding path program 1 times [2024-05-06 15:05:26,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:26,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1090078808, now seen corresponding path program 1 times [2024-05-06 15:05:26,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:26,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,746 INFO L85 PathProgramCache]: Analyzing trace with hash -379106792, now seen corresponding path program 1 times [2024-05-06 15:05:26,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:26,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash -566298430, now seen corresponding path program 1 times [2024-05-06 15:05:26,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:26,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:26,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1650019347, now seen corresponding path program 1 times [2024-05-06 15:05:27,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:27,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1749915661, now seen corresponding path program 1 times [2024-05-06 15:05:27,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:27,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1188897188, now seen corresponding path program 1 times [2024-05-06 15:05:27,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:27,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1838750870, now seen corresponding path program 1 times [2024-05-06 15:05:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1857002911, now seen corresponding path program 1 times [2024-05-06 15:05:27,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:27,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1305398355, now seen corresponding path program 1 times [2024-05-06 15:05:27,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:27,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash -594927581, now seen corresponding path program 1 times [2024-05-06 15:05:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:27,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:27,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1504949591, now seen corresponding path program 1 times [2024-05-06 15:05:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash 612605827, now seen corresponding path program 1 times [2024-05-06 15:05:28,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:28,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1225137737, now seen corresponding path program 1 times [2024-05-06 15:05:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:28,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1347532658, now seen corresponding path program 1 times [2024-05-06 15:05:28,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:28,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1341288556, now seen corresponding path program 1 times [2024-05-06 15:05:28,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,895 INFO L85 PathProgramCache]: Analyzing trace with hash 929990903, now seen corresponding path program 1 times [2024-05-06 15:05:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:28,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:28,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1492589993, now seen corresponding path program 1 times [2024-05-06 15:05:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1477243961, now seen corresponding path program 1 times [2024-05-06 15:05:29,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,247 INFO L85 PathProgramCache]: Analyzing trace with hash 186320513, now seen corresponding path program 1 times [2024-05-06 15:05:29,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:29,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,406 INFO L85 PathProgramCache]: Analyzing trace with hash 135568366, now seen corresponding path program 1 times [2024-05-06 15:05:29,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:29,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1114778604, now seen corresponding path program 1 times [2024-05-06 15:05:29,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:29,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash 37540509, now seen corresponding path program 1 times [2024-05-06 15:05:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:29,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1106451703, now seen corresponding path program 1 times [2024-05-06 15:05:29,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:29,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1630302946, now seen corresponding path program 1 times [2024-05-06 15:05:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:30,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash 608210700, now seen corresponding path program 1 times [2024-05-06 15:05:30,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:30,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:30,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-06 15:05:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 15:05:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 15:05:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 15:05:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 15:05:30,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,SelfDestructingSolverStorable152,SelfDestructingSolverStorable131,SelfDestructingSolverStorable153,SelfDestructingSolverStorable132,SelfDestructingSolverStorable154,SelfDestructingSolverStorable170,SelfDestructingSolverStorable150,SelfDestructingSolverStorable148,SelfDestructingSolverStorable149,SelfDestructingSolverStorable144,SelfDestructingSolverStorable166,SelfDestructingSolverStorable145,SelfDestructingSolverStorable167,SelfDestructingSolverStorable146,SelfDestructingSolverStorable168,SelfDestructingSolverStorable147,SelfDestructingSolverStorable169,SelfDestructingSolverStorable140,SelfDestructingSolverStorable162,SelfDestructingSolverStorable141,SelfDestructingSolverStorable163,SelfDestructingSolverStorable142,SelfDestructingSolverStorable164,SelfDestructingSolverStorable143,SelfDestructingSolverStorable165,SelfDestructingSolverStorable160,SelfDestructingSolverStorable161,SelfDestructingSolverStorable137,SelfDestructingSolverStorable159,SelfDestructingSolverStorable138,SelfDestructingSolverStorable139,SelfDestructingSolverStorable133,SelfDestructingSolverStorable155,SelfDestructingSolverStorable134,SelfDestructingSolverStorable156,SelfDestructingSolverStorable135,SelfDestructingSolverStorable157,SelfDestructingSolverStorable136,SelfDestructingSolverStorable158 [2024-05-06 15:05:30,415 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 15:05:30,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 15:05:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2105528779, now seen corresponding path program 4 times [2024-05-06 15:05:30,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 15:05:30,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107734425] [2024-05-06 15:05:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 15:05:30,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 15:05:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:30,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 15:05:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 15:05:30,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 15:05:30,474 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 15:05:30,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-06 15:05:30,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-06 15:05:30,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-05-06 15:05:30,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-05-06 15:05:30,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-06 15:05:30,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-06 15:05:30,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-06 15:05:30,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2024-05-06 15:05:30,486 INFO L448 BasicCegarLoop]: Path program histogram: [4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 15:05:30,490 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 15:05:30,490 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 15:05:30,588 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2024-05-06 15:05:30,591 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 15:05:30,592 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 15:05:30,593 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 15:05:30,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 03:05:30 BasicIcfg [2024-05-06 15:05:30,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 15:05:30,628 INFO L158 Benchmark]: Toolchain (without parser) took 167902.84ms. Allocated memory was 257.9MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 183.5MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 423.0MB. Max. memory is 8.0GB. [2024-05-06 15:05:30,628 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 15:05:30,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.27ms. Allocated memory is still 257.9MB. Free memory was 183.3MB in the beginning and 216.2MB in the end (delta: -32.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-05-06 15:05:30,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.56ms. Allocated memory is still 257.9MB. Free memory was 216.2MB in the beginning and 213.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 15:05:30,628 INFO L158 Benchmark]: Boogie Preprocessor took 38.11ms. Allocated memory is still 257.9MB. Free memory was 213.1MB in the beginning and 211.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 15:05:30,629 INFO L158 Benchmark]: RCFGBuilder took 559.64ms. Allocated memory is still 257.9MB. Free memory was 211.0MB in the beginning and 174.8MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2024-05-06 15:05:30,629 INFO L158 Benchmark]: TraceAbstraction took 166653.03ms. Allocated memory was 257.9MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 173.8MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 414.1MB. Max. memory is 8.0GB. [2024-05-06 15:05:30,630 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 596.27ms. Allocated memory is still 257.9MB. Free memory was 183.3MB in the beginning and 216.2MB in the end (delta: -32.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.56ms. Allocated memory is still 257.9MB. Free memory was 216.2MB in the beginning and 213.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.11ms. Allocated memory is still 257.9MB. Free memory was 213.1MB in the beginning and 211.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 559.64ms. Allocated memory is still 257.9MB. Free memory was 211.0MB in the beginning and 174.8MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 166653.03ms. Allocated memory was 257.9MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 173.8MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 414.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1415027, independent: 1402140, independent conditional: 1402068, independent unconditional: 72, dependent: 12887, dependent conditional: 12887, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1414490, independent: 1402140, independent conditional: 1402068, independent unconditional: 72, dependent: 12350, dependent conditional: 12350, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1414490, independent: 1402140, independent conditional: 1402068, independent unconditional: 72, dependent: 12350, dependent conditional: 12350, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1414490, independent: 1402140, independent conditional: 1402068, independent unconditional: 72, dependent: 12350, dependent conditional: 12350, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1459649, independent: 1402140, independent conditional: 672359, independent unconditional: 729781, dependent: 57509, dependent conditional: 45160, dependent unconditional: 12349, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1459649, independent: 1402140, independent conditional: 335638, independent unconditional: 1066502, dependent: 57509, dependent conditional: 10486, dependent unconditional: 47023, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1459649, independent: 1402140, independent conditional: 335638, independent unconditional: 1066502, dependent: 57509, dependent conditional: 10486, dependent unconditional: 47023, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1527, independent: 1499, independent conditional: 313, independent unconditional: 1186, dependent: 28, dependent conditional: 13, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1527, independent: 1460, independent conditional: 0, independent unconditional: 1460, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 39, independent conditional: 30, independent unconditional: 9, dependent: 28, dependent conditional: 13, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 39, independent conditional: 30, independent unconditional: 9, dependent: 28, dependent conditional: 13, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 255, independent: 146, independent conditional: 138, independent unconditional: 8, dependent: 109, dependent conditional: 67, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1459649, independent: 1400641, independent conditional: 335325, independent unconditional: 1065316, dependent: 57481, dependent conditional: 10473, dependent unconditional: 47008, unknown: 1527, unknown conditional: 326, unknown unconditional: 1201] , Statistics on independence cache: Total cache size (in pairs): 1527, Positive cache size: 1499, Positive conditional cache size: 313, Positive unconditional cache size: 1186, Negative cache size: 28, Negative conditional cache size: 13, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 371395, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1459649, independent: 1402140, independent conditional: 672359, independent unconditional: 729781, dependent: 57509, dependent conditional: 45160, dependent unconditional: 12349, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1459649, independent: 1402140, independent conditional: 335638, independent unconditional: 1066502, dependent: 57509, dependent conditional: 10486, dependent unconditional: 47023, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1459649, independent: 1402140, independent conditional: 335638, independent unconditional: 1066502, dependent: 57509, dependent conditional: 10486, dependent unconditional: 47023, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1527, independent: 1499, independent conditional: 313, independent unconditional: 1186, dependent: 28, dependent conditional: 13, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1527, independent: 1460, independent conditional: 0, independent unconditional: 1460, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 39, independent conditional: 30, independent unconditional: 9, dependent: 28, dependent conditional: 13, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 39, independent conditional: 30, independent unconditional: 9, dependent: 28, dependent conditional: 13, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 255, independent: 146, independent conditional: 138, independent unconditional: 8, dependent: 109, dependent conditional: 67, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1459649, independent: 1400641, independent conditional: 335325, independent unconditional: 1065316, dependent: 57481, dependent conditional: 10473, dependent unconditional: 47008, unknown: 1527, unknown conditional: 326, unknown unconditional: 1201] , Statistics on independence cache: Total cache size (in pairs): 1527, Positive cache size: 1499, Positive conditional cache size: 313, Positive unconditional cache size: 1186, Negative cache size: 28, Negative conditional cache size: 13, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 371395 ], Independence queries for same thread: 537 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L725] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z=0] [L726] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z=0] [L727] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z=0] [L728] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z=0] [L729] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z=0] [L730] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z=0] [L731] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z=0] [L732] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z=0] [L733] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z=0] [L734] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z=0] [L735] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z=0] [L736] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z=0] [L737] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z=0] [L738] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z=0] [L739] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z=0] [L740] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z=0] [L741] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z=0] [L742] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 0 pthread_t t1461; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1462; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1463; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t1464; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L793] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L823] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 843]: 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: 839]: 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: 837]: 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, 167 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 166.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 162.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 53, 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.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 599 NumberOfCodeBlocks, 599 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 2104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 149.5s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 478, ConditionalCommutativityTraceChecks: 165, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 15:05:30,646 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 15:05:30,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...