/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/mix017_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 14:07:58,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 14:07:58,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 14:07:58,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 14:07:58,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 14:07:58,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 14:07:58,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 14:07:58,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 14:07:58,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 14:07:58,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 14:07:58,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 14:07:58,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 14:07:58,704 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 14:07:58,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 14:07:58,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 14:07:58,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 14:07:58,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 14:07:58,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 14:07:58,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 14:07:58,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 14:07:58,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 14:07:58,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 14:07:58,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 14:07:58,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 14:07:58,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 14:07:58,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 14:07:58,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 14:07:58,712 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 14:07:58,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 14:07:58,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:07:58,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 14:07:58,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 14:07:58,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 14:07:58,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 14:07:58,714 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 14:07:58,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 14:07:58,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 14:07:58,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 14:07:58,714 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 14:07:58,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 50 [2024-05-06 14:07:58,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 14:07:58,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 14:07:58,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 14:07:58,992 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 14:07:58,992 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 14:07:58,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2024-05-06 14:08:00,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 14:08:00,453 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 14:08:00,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2024-05-06 14:08:00,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fe82f2299/aab31e99f41a4ca5ade89a6f485ccd30/FLAG5f391772a [2024-05-06 14:08:00,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fe82f2299/aab31e99f41a4ca5ade89a6f485ccd30 [2024-05-06 14:08:00,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 14:08:00,482 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 14:08:00,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 14:08:00,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 14:08:00,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 14:08:00,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:08:00" (1/1) ... [2024-05-06 14:08:00,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd3474b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:00, skipping insertion in model container [2024-05-06 14:08:00,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:08:00" (1/1) ... [2024-05-06 14:08:00,540 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 14:08:00,699 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/mix017_power.opt_rmo.opt.i[958,971] [2024-05-06 14:08:00,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:08:00,909 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 14:08:00,983 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/mix017_power.opt_rmo.opt.i[958,971] [2024-05-06 14:08:01,020 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:08:01,044 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:08:01,044 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:08:01,050 INFO L206 MainTranslator]: Completed translation [2024-05-06 14:08:01,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01 WrapperNode [2024-05-06 14:08:01,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 14:08:01,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 14:08:01,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 14:08:01,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 14:08:01,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (1/1) ... [2024-05-06 14:08:01,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (1/1) ... [2024-05-06 14:08:01,132 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2024-05-06 14:08:01,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 14:08:01,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 14:08:01,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 14:08:01,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 14:08:01,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (1/1) ... [2024-05-06 14:08:01,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (1/1) ... [2024-05-06 14:08:01,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (1/1) ... [2024-05-06 14:08:01,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (1/1) ... [2024-05-06 14:08:01,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (1/1) ... [2024-05-06 14:08:01,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (1/1) ... [2024-05-06 14:08:01,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (1/1) ... [2024-05-06 14:08:01,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (1/1) ... [2024-05-06 14:08:01,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 14:08:01,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 14:08:01,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 14:08:01,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 14:08:01,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (1/1) ... [2024-05-06 14:08:01,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:08:01,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:08:01,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 14:08:01,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 14:08:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 14:08:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 14:08:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 14:08:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 14:08:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 14:08:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 14:08:01,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 14:08:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 14:08:01,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 14:08:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 14:08:01,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 14:08:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-06 14:08:01,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-06 14:08:01,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 14:08:01,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 14:08:01,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 14:08:01,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 14:08:01,301 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 14:08:01,444 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 14:08:01,445 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 14:08:01,711 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 14:08:01,838 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 14:08:01,838 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 14:08:01,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:08:01 BoogieIcfgContainer [2024-05-06 14:08:01,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 14:08:01,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 14:08:01,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 14:08:01,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 14:08:01,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 02:08:00" (1/3) ... [2024-05-06 14:08:01,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7968401a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:08:01, skipping insertion in model container [2024-05-06 14:08:01,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:08:01" (2/3) ... [2024-05-06 14:08:01,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7968401a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:08:01, skipping insertion in model container [2024-05-06 14:08:01,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:08:01" (3/3) ... [2024-05-06 14:08:01,850 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2024-05-06 14:08:01,857 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 14:08:01,865 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 14:08:01,865 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 14:08:01,865 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 14:08:01,924 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 14:08:01,972 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 14:08:01,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 14:08:01,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:08:01,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 14:08:01,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 14:08:02,023 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 14:08:02,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:08:02,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 14:08:02,047 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;@421ce6ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 14:08:02,047 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-06 14:08:02,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:08:02,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:08:02,110 INFO L85 PathProgramCache]: Analyzing trace with hash 130505333, now seen corresponding path program 1 times [2024-05-06 14:08:02,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:08:02,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199354896] [2024-05-06 14:08:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:02,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:08:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:08:03,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:08:03,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199354896] [2024-05-06 14:08:03,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199354896] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:08:03,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:08:03,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 14:08:03,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919324133] [2024-05-06 14:08:03,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:08:03,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 14:08:03,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:08:03,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 14:08:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 14:08:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:08:03,085 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:08:03,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:08:03,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:08:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:08:03,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 14:08:03,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:08:03,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:08:03,221 INFO L85 PathProgramCache]: Analyzing trace with hash -729361077, now seen corresponding path program 1 times [2024-05-06 14:08:03,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:08:03,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167791558] [2024-05-06 14:08:03,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:03,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:08:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:08:03,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:08:03,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167791558] [2024-05-06 14:08:03,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167791558] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:08:03,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:08:03,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 14:08:03,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562258721] [2024-05-06 14:08:03,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:08:03,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 14:08:03,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:08:03,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 14:08:03,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-06 14:08:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:08:03,789 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:08:03,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:08:03,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:08:03,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:08:04,158 INFO L85 PathProgramCache]: Analyzing trace with hash -916680269, now seen corresponding path program 1 times [2024-05-06 14:08:04,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:04,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:04,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:04,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:08:04,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:08:04,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 14:08:04,358 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:08:04,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:08:04,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1122420413, now seen corresponding path program 1 times [2024-05-06 14:08:04,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:08:04,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622023762] [2024-05-06 14:08:04,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:04,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:08:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:08:04,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:08:04,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622023762] [2024-05-06 14:08:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622023762] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:08:04,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:08:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 14:08:04,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296953080] [2024-05-06 14:08:04,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:08:04,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 14:08:04,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:08:04,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 14:08:04,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 14:08:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:08:04,763 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:08:04,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:08:04,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:08:04,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:08:04,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:08:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -916680269, now seen corresponding path program 2 times [2024-05-06 14:08:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:04,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash -452649662, now seen corresponding path program 1 times [2024-05-06 14:08:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:05,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:05,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:05,474 INFO L85 PathProgramCache]: Analyzing trace with hash -686146446, now seen corresponding path program 1 times [2024-05-06 14:08:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:05,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash 432348402, now seen corresponding path program 1 times [2024-05-06 14:08:06,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:06,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash -540242540, now seen corresponding path program 1 times [2024-05-06 14:08:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1264353117, now seen corresponding path program 1 times [2024-05-06 14:08:06,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:06,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1621782473, now seen corresponding path program 1 times [2024-05-06 14:08:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:06,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -501873670, now seen corresponding path program 1 times [2024-05-06 14:08:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash -708926022, now seen corresponding path program 1 times [2024-05-06 14:08:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -577057850, now seen corresponding path program 1 times [2024-05-06 14:08:06,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:06,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash -572803992, now seen corresponding path program 1 times [2024-05-06 14:08:06,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:06,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:06,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:07,358 INFO L85 PathProgramCache]: Analyzing trace with hash 554199728, now seen corresponding path program 1 times [2024-05-06 14:08:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:07,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:07,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:07,527 INFO L85 PathProgramCache]: Analyzing trace with hash 841724069, now seen corresponding path program 1 times [2024-05-06 14:08:07,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:07,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:07,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1156722863, now seen corresponding path program 1 times [2024-05-06 14:08:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:07,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:07,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1724961515, now seen corresponding path program 1 times [2024-05-06 14:08:08,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1164022511, now seen corresponding path program 1 times [2024-05-06 14:08:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash 378092934, now seen corresponding path program 1 times [2024-05-06 14:08:08,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash -126350714, now seen corresponding path program 1 times [2024-05-06 14:08:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash -419717731, now seen corresponding path program 1 times [2024-05-06 14:08:08,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:08,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash 817744823, now seen corresponding path program 1 times [2024-05-06 14:08:08,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:08,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,875 INFO L85 PathProgramCache]: Analyzing trace with hash -112168407, now seen corresponding path program 1 times [2024-05-06 14:08:08,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:08,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1250544219, now seen corresponding path program 1 times [2024-05-06 14:08:08,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:08,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:08,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:09,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2059924372, now seen corresponding path program 1 times [2024-05-06 14:08:09,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:09,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:09,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2019198143, now seen corresponding path program 1 times [2024-05-06 14:08:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:09,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:09,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:09,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1845058925, now seen corresponding path program 1 times [2024-05-06 14:08:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:09,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:09,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash 949153457, now seen corresponding path program 1 times [2024-05-06 14:08:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:10,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1831733237, now seen corresponding path program 1 times [2024-05-06 14:08:10,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:10,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1880574430, now seen corresponding path program 1 times [2024-05-06 14:08:10,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:10,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1463357034, now seen corresponding path program 1 times [2024-05-06 14:08:10,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:10,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,494 INFO L85 PathProgramCache]: Analyzing trace with hash 601394489, now seen corresponding path program 1 times [2024-05-06 14:08:10,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:10,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,586 INFO L85 PathProgramCache]: Analyzing trace with hash 989231259, now seen corresponding path program 1 times [2024-05-06 14:08:10,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:10,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash -660825915, now seen corresponding path program 1 times [2024-05-06 14:08:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,906 INFO L85 PathProgramCache]: Analyzing trace with hash 117230473, now seen corresponding path program 1 times [2024-05-06 14:08:10,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:10,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:10,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1347130444, now seen corresponding path program 1 times [2024-05-06 14:08:12,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:12,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash 926375570, now seen corresponding path program 1 times [2024-05-06 14:08:12,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,278 INFO L85 PathProgramCache]: Analyzing trace with hash -801400859, now seen corresponding path program 1 times [2024-05-06 14:08:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:12,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash -302946233, now seen corresponding path program 1 times [2024-05-06 14:08:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,490 INFO L85 PathProgramCache]: Analyzing trace with hash 267322300, now seen corresponding path program 1 times [2024-05-06 14:08:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:12,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 147170744, now seen corresponding path program 1 times [2024-05-06 14:08:12,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,763 INFO L85 PathProgramCache]: Analyzing trace with hash 836031496, now seen corresponding path program 1 times [2024-05-06 14:08:12,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:12,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1912693786, now seen corresponding path program 1 times [2024-05-06 14:08:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:12,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:12,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:17,686 INFO L85 PathProgramCache]: Analyzing trace with hash -865632573, now seen corresponding path program 1 times [2024-05-06 14:08:17,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:17,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:17,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:18,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1045406832, now seen corresponding path program 1 times [2024-05-06 14:08:18,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:18,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:18,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:21,903 INFO L85 PathProgramCache]: Analyzing trace with hash -386369624, now seen corresponding path program 1 times [2024-05-06 14:08:21,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:21,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:21,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash -936108458, now seen corresponding path program 1 times [2024-05-06 14:08:22,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:22,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:22,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1952051186, now seen corresponding path program 1 times [2024-05-06 14:08:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:25,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:08:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:08:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:26,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:08:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:08:26,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 14:08:26,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-06 14:08:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash -916680269, now seen corresponding path program 3 times [2024-05-06 14:08:26,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:26,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:26,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:26,426 INFO L85 PathProgramCache]: Analyzing trace with hash -452649662, now seen corresponding path program 2 times [2024-05-06 14:08:26,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:26,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:26,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -686146446, now seen corresponding path program 2 times [2024-05-06 14:08:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:26,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash 432348402, now seen corresponding path program 2 times [2024-05-06 14:08:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:27,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,201 INFO L85 PathProgramCache]: Analyzing trace with hash -540242540, now seen corresponding path program 2 times [2024-05-06 14:08:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1264353117, now seen corresponding path program 2 times [2024-05-06 14:08:27,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1621782473, now seen corresponding path program 2 times [2024-05-06 14:08:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:27,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash -501873670, now seen corresponding path program 2 times [2024-05-06 14:08:27,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:27,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash -708926022, now seen corresponding path program 2 times [2024-05-06 14:08:27,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,874 INFO L85 PathProgramCache]: Analyzing trace with hash -577057850, now seen corresponding path program 2 times [2024-05-06 14:08:27,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:27,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,976 INFO L85 PathProgramCache]: Analyzing trace with hash -572803992, now seen corresponding path program 2 times [2024-05-06 14:08:27,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:27,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:28,281 INFO L85 PathProgramCache]: Analyzing trace with hash 554199728, now seen corresponding path program 2 times [2024-05-06 14:08:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:28,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:28,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash 841724069, now seen corresponding path program 2 times [2024-05-06 14:08:28,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:28,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:28,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1156722863, now seen corresponding path program 2 times [2024-05-06 14:08:28,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:28,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:28,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:28,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1724961515, now seen corresponding path program 2 times [2024-05-06 14:08:28,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:28,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1164022511, now seen corresponding path program 2 times [2024-05-06 14:08:29,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:29,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 378092934, now seen corresponding path program 2 times [2024-05-06 14:08:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash -126350714, now seen corresponding path program 2 times [2024-05-06 14:08:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash -419717731, now seen corresponding path program 2 times [2024-05-06 14:08:29,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:29,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,517 INFO L85 PathProgramCache]: Analyzing trace with hash 817744823, now seen corresponding path program 2 times [2024-05-06 14:08:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:29,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash -112168407, now seen corresponding path program 2 times [2024-05-06 14:08:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1250544219, now seen corresponding path program 2 times [2024-05-06 14:08:29,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:29,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1917827984, now seen corresponding path program 1 times [2024-05-06 14:08:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:52,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:08:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:08:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1412248092, now seen corresponding path program 1 times [2024-05-06 14:08:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:53,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:08:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:08:53,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:08:53,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:08:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:08:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:08:53,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 14:08:53,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-05-06 14:09:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1917827984, now seen corresponding path program 2 times [2024-05-06 14:09:16,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:09:16,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:09:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:09:16,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:09:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:09:42,347 INFO L85 PathProgramCache]: Analyzing trace with hash 689456059, now seen corresponding path program 1 times [2024-05-06 14:09:42,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:09:42,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:09:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:09:42,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:09:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash -352163791, now seen corresponding path program 1 times [2024-05-06 14:10:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:10:06,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:10:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:06,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:10:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash -833570052, now seen corresponding path program 1 times [2024-05-06 14:10:33,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:10:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:10:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:33,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:10:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:42,290 INFO L85 PathProgramCache]: Analyzing trace with hash -327073582, now seen corresponding path program 1 times [2024-05-06 14:10:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:10:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:10:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:42,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:10:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:47,428 INFO L85 PathProgramCache]: Analyzing trace with hash 707059717, now seen corresponding path program 1 times [2024-05-06 14:10:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:10:47,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:10:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:10:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:10:47,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:10:47,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:10:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:10:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:10:47,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 14:10:47,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-05-06 14:10:47,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1917827984, now seen corresponding path program 3 times [2024-05-06 14:10:47,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:10:47,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:10:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:47,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:10:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash 689456059, now seen corresponding path program 2 times [2024-05-06 14:10:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:10:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:10:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:50,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:10:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash -352163791, now seen corresponding path program 2 times [2024-05-06 14:10:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:10:50,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:10:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:50,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:10:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash -833570052, now seen corresponding path program 2 times [2024-05-06 14:10:51,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:10:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:10:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:51,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:10:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:51,834 INFO L85 PathProgramCache]: Analyzing trace with hash -327073582, now seen corresponding path program 2 times [2024-05-06 14:10:51,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:10:51,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:10:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:51,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:10:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:59,489 INFO L85 PathProgramCache]: Analyzing trace with hash 879567814, now seen corresponding path program 1 times [2024-05-06 14:10:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:10:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:10:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:10:59,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:10:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:14:59,399 INFO L85 PathProgramCache]: Analyzing trace with hash -858442590, now seen corresponding path program 1 times [2024-05-06 14:14:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:14:59,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:14:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:14:59,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:14:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:15:12,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1026266839, now seen corresponding path program 1 times [2024-05-06 14:15:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:15:12,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:15:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:15:12,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:15:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:15:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2042779209, now seen corresponding path program 1 times [2024-05-06 14:15:24,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:15:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:15:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:15:24,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:15:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:15:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash -618206906, now seen corresponding path program 1 times [2024-05-06 14:15:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:15:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:15:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:15:35,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:15:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:15:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash -848722014, now seen corresponding path program 1 times [2024-05-06 14:15:47,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:15:47,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:15:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:15:47,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:15:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1686756785, now seen corresponding path program 1 times [2024-05-06 14:16:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:16:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:16:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:00,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:16:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1196210257, now seen corresponding path program 1 times [2024-05-06 14:16:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:16:13,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:16:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:13,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:16:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1760381245, now seen corresponding path program 1 times [2024-05-06 14:16:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:16:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:16:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:26,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:16:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash -330364125, now seen corresponding path program 1 times [2024-05-06 14:16:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:16:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:16:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:39,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:16:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:39,825 INFO L85 PathProgramCache]: Analyzing trace with hash -897087939, now seen corresponding path program 1 times [2024-05-06 14:16:39,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:16:39,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:16:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:39,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:16:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:46,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1186929879, now seen corresponding path program 1 times [2024-05-06 14:16:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:16:46,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:16:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:16:46,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:16:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:17:25,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1423484706, now seen corresponding path program 2 times [2024-05-06 14:17:25,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:17:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:17:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:17:25,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:17:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:17:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1448631033, now seen corresponding path program 2 times [2024-05-06 14:17:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:17:32,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:17:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:17:32,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:17:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:17:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1588706295, now seen corresponding path program 2 times [2024-05-06 14:17:40,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:17:40,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:17:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:17:40,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:17:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:17:49,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1884253720, now seen corresponding path program 2 times [2024-05-06 14:17:49,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:17:49,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:17:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:17:49,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:17:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:17:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2068610786, now seen corresponding path program 2 times [2024-05-06 14:17:56,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:17:56,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:17:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:17:56,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:17:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:04,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1717468943, now seen corresponding path program 2 times [2024-05-06 14:18:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:04,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:04,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:10,769 INFO L85 PathProgramCache]: Analyzing trace with hash -105978991, now seen corresponding path program 2 times [2024-05-06 14:18:10,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:10,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:10,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:18,718 INFO L85 PathProgramCache]: Analyzing trace with hash -295785307, now seen corresponding path program 2 times [2024-05-06 14:18:18,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:18,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:18,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1430674851, now seen corresponding path program 2 times [2024-05-06 14:18:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:26,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:26,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash -84520783, now seen corresponding path program 1 times [2024-05-06 14:18:26,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:26,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1105654587, now seen corresponding path program 1 times [2024-05-06 14:18:26,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:26,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:26,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:27,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1282594208, now seen corresponding path program 1 times [2024-05-06 14:18:27,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:27,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:27,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:27,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1621191386, now seen corresponding path program 1 times [2024-05-06 14:18:27,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:27,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:27,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:27,406 INFO L85 PathProgramCache]: Analyzing trace with hash -606482519, now seen corresponding path program 1 times [2024-05-06 14:18:27,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:27,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:27,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:27,551 INFO L85 PathProgramCache]: Analyzing trace with hash 396081877, now seen corresponding path program 1 times [2024-05-06 14:18:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:27,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:27,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:18:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:18:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:18:27,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable98,SelfDestructingSolverStorable11,SelfDestructingSolverStorable99,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28,SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable110,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 14:18:27,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:18:27,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:18:27,595 INFO L85 PathProgramCache]: Analyzing trace with hash -804542973, now seen corresponding path program 2 times [2024-05-06 14:18:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:18:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539182578] [2024-05-06 14:18:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:18:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:18:28,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:18:28,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539182578] [2024-05-06 14:18:28,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539182578] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:18:28,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:18:28,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-06 14:18:28,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19622813] [2024-05-06 14:18:28,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:18:28,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-06 14:18:28,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:18:28,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-06 14:18:28,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-06 14:18:28,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:18:28,366 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:18:28,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 14:18:28,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:18:28,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:18:28,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:18:28,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:18:28,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1917827984, now seen corresponding path program 4 times [2024-05-06 14:18:28,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:28,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:28,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash 689456059, now seen corresponding path program 3 times [2024-05-06 14:18:29,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:29,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:29,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash -352163791, now seen corresponding path program 3 times [2024-05-06 14:18:29,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:29,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:29,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash -833570052, now seen corresponding path program 3 times [2024-05-06 14:18:30,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:30,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:30,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash -327073582, now seen corresponding path program 3 times [2024-05-06 14:18:30,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:30,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash -897087939, now seen corresponding path program 2 times [2024-05-06 14:18:39,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:39,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:39,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:53,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1423484706, now seen corresponding path program 3 times [2024-05-06 14:18:53,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:18:53,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:18:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:18:53,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:18:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:01,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1448631033, now seen corresponding path program 3 times [2024-05-06 14:19:01,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:01,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:01,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1588706295, now seen corresponding path program 3 times [2024-05-06 14:19:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:09,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:09,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1884253720, now seen corresponding path program 3 times [2024-05-06 14:19:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:16,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2068610786, now seen corresponding path program 3 times [2024-05-06 14:19:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:24,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:24,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:33,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1717468943, now seen corresponding path program 3 times [2024-05-06 14:19:33,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:33,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash -105978991, now seen corresponding path program 3 times [2024-05-06 14:19:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:39,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash -295785307, now seen corresponding path program 3 times [2024-05-06 14:19:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:47,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1430674851, now seen corresponding path program 3 times [2024-05-06 14:19:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:55,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash -84520783, now seen corresponding path program 2 times [2024-05-06 14:19:55,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:55,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1105654587, now seen corresponding path program 2 times [2024-05-06 14:19:55,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:55,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:55,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1282594208, now seen corresponding path program 2 times [2024-05-06 14:19:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:56,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:56,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1621191386, now seen corresponding path program 2 times [2024-05-06 14:19:56,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:56,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:56,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:56,695 INFO L85 PathProgramCache]: Analyzing trace with hash -606482519, now seen corresponding path program 2 times [2024-05-06 14:19:56,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:56,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:56,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash 396081877, now seen corresponding path program 2 times [2024-05-06 14:19:56,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:56,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1536799709, now seen corresponding path program 1 times [2024-05-06 14:19:57,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:57,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:57,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash 49577831, now seen corresponding path program 1 times [2024-05-06 14:19:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:57,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash 681381672, now seen corresponding path program 1 times [2024-05-06 14:19:57,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:57,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:57,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash -809301532, now seen corresponding path program 1 times [2024-05-06 14:19:58,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:58,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:58,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:58,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1965767209, now seen corresponding path program 1 times [2024-05-06 14:19:58,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:58,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:58,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash -479051249, now seen corresponding path program 1 times [2024-05-06 14:19:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:58,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash 261644704, now seen corresponding path program 1 times [2024-05-06 14:19:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:58,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1532464638, now seen corresponding path program 1 times [2024-05-06 14:19:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:59,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:59,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:59,251 INFO L85 PathProgramCache]: Analyzing trace with hash 49436564, now seen corresponding path program 1 times [2024-05-06 14:19:59,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:59,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:59,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:59,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1387071696, now seen corresponding path program 1 times [2024-05-06 14:19:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:59,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:59,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1253938386, now seen corresponding path program 1 times [2024-05-06 14:19:59,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:59,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:19:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:59,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:19:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:19:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1980114682, now seen corresponding path program 1 times [2024-05-06 14:19:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:19:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:00,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash 63876609, now seen corresponding path program 1 times [2024-05-06 14:20:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:00,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash 417705125, now seen corresponding path program 1 times [2024-05-06 14:20:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:00,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:00,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1398950986, now seen corresponding path program 1 times [2024-05-06 14:20:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:00,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:00,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash 45131284, now seen corresponding path program 1 times [2024-05-06 14:20:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:00,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:01,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1386931390, now seen corresponding path program 1 times [2024-05-06 14:20:01,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:01,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:01,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:01,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1014574694, now seen corresponding path program 1 times [2024-05-06 14:20:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:01,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:01,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2059067159, now seen corresponding path program 1 times [2024-05-06 14:20:01,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:01,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:01,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1457601539, now seen corresponding path program 1 times [2024-05-06 14:20:01,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:01,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:01,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:02,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1848136664, now seen corresponding path program 1 times [2024-05-06 14:20:02,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:02,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1583640558, now seen corresponding path program 1 times [2024-05-06 14:20:02,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:02,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:02,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:02,652 INFO L85 PathProgramCache]: Analyzing trace with hash -87458847, now seen corresponding path program 1 times [2024-05-06 14:20:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:02,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:02,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1382655901, now seen corresponding path program 1 times [2024-05-06 14:20:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:02,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:02,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:03,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1014435349, now seen corresponding path program 1 times [2024-05-06 14:20:03,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:03,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:03,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash -798556625, now seen corresponding path program 1 times [2024-05-06 14:20:03,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:03,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:03,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:03,658 INFO L85 PathProgramCache]: Analyzing trace with hash -94067469, now seen corresponding path program 1 times [2024-05-06 14:20:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:03,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash 689704633, now seen corresponding path program 1 times [2024-05-06 14:20:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:03,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:03,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash -393391518, now seen corresponding path program 1 times [2024-05-06 14:20:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:04,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash 125859876, now seen corresponding path program 1 times [2024-05-06 14:20:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:04,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1250989291, now seen corresponding path program 1 times [2024-05-06 14:20:04,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:04,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:04,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:04,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1010189651, now seen corresponding path program 1 times [2024-05-06 14:20:04,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:04,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:04,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash -798695009, now seen corresponding path program 1 times [2024-05-06 14:20:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:05,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:05,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:05,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1359712613, now seen corresponding path program 1 times [2024-05-06 14:20:05,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:05,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:05,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1625548458, now seen corresponding path program 1 times [2024-05-06 14:20:05,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:05,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:05,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:05,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1147604953, now seen corresponding path program 2 times [2024-05-06 14:20:05,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:05,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:05,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:06,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1216014773, now seen corresponding path program 2 times [2024-05-06 14:20:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:06,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:06,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash 958248104, now seen corresponding path program 2 times [2024-05-06 14:20:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:06,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:20:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:20:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:20:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 14:20:45,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,SelfDestructingSolverStorable152,SelfDestructingSolverStorable153,SelfDestructingSolverStorable154,SelfDestructingSolverStorable150,SelfDestructingSolverStorable148,SelfDestructingSolverStorable149,SelfDestructingSolverStorable144,SelfDestructingSolverStorable145,SelfDestructingSolverStorable146,SelfDestructingSolverStorable147,SelfDestructingSolverStorable140,SelfDestructingSolverStorable141,SelfDestructingSolverStorable142,SelfDestructingSolverStorable143,SelfDestructingSolverStorable137,SelfDestructingSolverStorable138,SelfDestructingSolverStorable139,SelfDestructingSolverStorable133,SelfDestructingSolverStorable134,SelfDestructingSolverStorable135,SelfDestructingSolverStorable136,SelfDestructingSolverStorable173,SelfDestructingSolverStorable130,SelfDestructingSolverStorable174,SelfDestructingSolverStorable131,SelfDestructingSolverStorable132,SelfDestructingSolverStorable170,SelfDestructingSolverStorable171,SelfDestructingSolverStorable172,SelfDestructingSolverStorable126,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable122,SelfDestructingSolverStorable166,SelfDestructingSolverStorable123,SelfDestructingSolverStorable167,SelfDestructingSolverStorable124,SelfDestructingSolverStorable168,SelfDestructingSolverStorable125,SelfDestructingSolverStorable169,SelfDestructingSolverStorable162,SelfDestructingSolverStorable163,SelfDestructingSolverStorable120,SelfDestructingSolverStorable164,SelfDestructingSolverStorable121,SelfDestructingSolverStorable165,SelfDestructingSolverStorable160,SelfDestructingSolverStorable161,SelfDestructingSolverStorable119,SelfDestructingSolverStorable115,SelfDestructingSolverStorable159,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable155,SelfDestructingSolverStorable156,SelfDestructingSolverStorable157,SelfDestructingSolverStorable158 [2024-05-06 14:20:45,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:20:45,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:20:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1026070915, now seen corresponding path program 3 times [2024-05-06 14:20:45,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:20:45,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609549026] [2024-05-06 14:20:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:20:45,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:20:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:45,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:20:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:20:45,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 14:20:45,549 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 14:20:45,551 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-06 14:20:45,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-06 14:20:45,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-05-06 14:20:45,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-05-06 14:20:45,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-06 14:20:45,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-06 14:20:45,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-06 14:20:45,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2024-05-06 14:20:45,557 INFO L448 BasicCegarLoop]: Path program histogram: [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-05-06 14:20:45,563 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 14:20:45,563 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 14:20:45,645 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 14:20:45,647 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 14:20:45,649 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 14:20:45,651 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2024-05-06 14:20:45,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 02:20:45 BasicIcfg [2024-05-06 14:20:45,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 14:20:45,681 INFO L158 Benchmark]: Toolchain (without parser) took 765198.62ms. Allocated memory was 153.1MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 87.4MB in the beginning and 1.1GB in the end (delta: -983.4MB). Peak memory consumption was 999.9MB. Max. memory is 8.0GB. [2024-05-06 14:20:45,681 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 153.1MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 14:20:45,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.94ms. Allocated memory is still 153.1MB. Free memory was 87.2MB in the beginning and 120.5MB in the end (delta: -33.3MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. [2024-05-06 14:20:45,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.44ms. Allocated memory is still 153.1MB. Free memory was 120.5MB in the beginning and 118.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:20:45,682 INFO L158 Benchmark]: Boogie Preprocessor took 71.11ms. Allocated memory is still 153.1MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:20:45,682 INFO L158 Benchmark]: RCFGBuilder took 635.11ms. Allocated memory is still 153.1MB. Free memory was 116.0MB in the beginning and 79.8MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2024-05-06 14:20:45,682 INFO L158 Benchmark]: TraceAbstraction took 763838.14ms. Allocated memory was 153.1MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 78.7MB in the beginning and 1.1GB in the end (delta: -992.1MB). Peak memory consumption was 989.6MB. Max. memory is 8.0GB. [2024-05-06 14:20:45,683 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.12ms. Allocated memory is still 153.1MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 570.94ms. Allocated memory is still 153.1MB. Free memory was 87.2MB in the beginning and 120.5MB in the end (delta: -33.3MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.44ms. Allocated memory is still 153.1MB. Free memory was 120.5MB in the beginning and 118.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.11ms. Allocated memory is still 153.1MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 635.11ms. Allocated memory is still 153.1MB. Free memory was 116.0MB in the beginning and 79.8MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 763838.14ms. Allocated memory was 153.1MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 78.7MB in the beginning and 1.1GB in the end (delta: -992.1MB). Peak memory consumption was 989.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 933790, independent: 925903, independent conditional: 925782, independent unconditional: 121, dependent: 7887, dependent conditional: 7887, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 933384, independent: 925903, independent conditional: 925782, independent unconditional: 121, dependent: 7481, dependent conditional: 7481, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 933384, independent: 925903, independent conditional: 925782, independent unconditional: 121, dependent: 7481, dependent conditional: 7481, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 933384, independent: 925903, independent conditional: 925782, independent unconditional: 121, dependent: 7481, dependent conditional: 7481, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 966904, independent: 925903, independent conditional: 443875, independent unconditional: 482028, dependent: 41001, dependent conditional: 33352, dependent unconditional: 7649, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 966904, independent: 925903, independent conditional: 258906, independent unconditional: 666997, dependent: 41001, dependent conditional: 8369, dependent unconditional: 32632, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 966904, independent: 925903, independent conditional: 258906, independent unconditional: 666997, dependent: 41001, dependent conditional: 8369, dependent unconditional: 32632, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1769, independent: 1714, independent conditional: 371, independent unconditional: 1343, dependent: 55, dependent conditional: 33, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1769, independent: 1670, independent conditional: 0, independent unconditional: 1670, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 99, independent: 44, independent conditional: 36, independent unconditional: 8, dependent: 55, dependent conditional: 33, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 99, independent: 44, independent conditional: 36, independent unconditional: 8, dependent: 55, dependent conditional: 33, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 401, independent: 93, independent conditional: 85, independent unconditional: 8, dependent: 308, dependent conditional: 213, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 966904, independent: 924189, independent conditional: 258535, independent unconditional: 665654, dependent: 40946, dependent conditional: 8336, dependent unconditional: 32610, unknown: 1769, unknown conditional: 404, unknown unconditional: 1365] , Statistics on independence cache: Total cache size (in pairs): 1769, Positive cache size: 1714, Positive conditional cache size: 371, Positive unconditional cache size: 1343, Negative cache size: 55, Negative conditional cache size: 33, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 209952, Maximal queried relation: 7, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 966904, independent: 925903, independent conditional: 443875, independent unconditional: 482028, dependent: 41001, dependent conditional: 33352, dependent unconditional: 7649, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 966904, independent: 925903, independent conditional: 258906, independent unconditional: 666997, dependent: 41001, dependent conditional: 8369, dependent unconditional: 32632, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 966904, independent: 925903, independent conditional: 258906, independent unconditional: 666997, dependent: 41001, dependent conditional: 8369, dependent unconditional: 32632, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1769, independent: 1714, independent conditional: 371, independent unconditional: 1343, dependent: 55, dependent conditional: 33, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1769, independent: 1670, independent conditional: 0, independent unconditional: 1670, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 99, independent: 44, independent conditional: 36, independent unconditional: 8, dependent: 55, dependent conditional: 33, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 99, independent: 44, independent conditional: 36, independent unconditional: 8, dependent: 55, dependent conditional: 33, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 401, independent: 93, independent conditional: 85, independent unconditional: 8, dependent: 308, dependent conditional: 213, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 966904, independent: 924189, independent conditional: 258535, independent unconditional: 665654, dependent: 40946, dependent conditional: 8336, dependent unconditional: 32610, unknown: 1769, unknown conditional: 404, unknown unconditional: 1365] , Statistics on independence cache: Total cache size (in pairs): 1769, Positive cache size: 1714, Positive conditional cache size: 371, Positive unconditional cache size: 1343, Negative cache size: 55, Negative conditional cache size: 33, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 209952 ], Independence queries for same thread: 406 - 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y=0] [L730] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y=0] [L731] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y=0] [L732] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y=0] [L733] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y=0] [L734] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y=0] [L735] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y=0] [L736] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y=0] [L737] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y=0] [L738] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y=0] [L739] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y=0] [L740] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y=0] [L741] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y=0] [L742] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y=0] [L743] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y=0] [L744] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y=0] [L745] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y=0] [L746] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t437; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t438; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t439; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t440; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L845] 4 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L792] 2 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] 3 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L869] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L880] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 763.6s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 760.7s, 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: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 1989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 749.6s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityConditionCalculations: 576, ConditionalCommutativityTraceChecks: 168, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 14:20:45,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 14:20:46,017 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...