/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/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy10.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-faa7b7a-m [2024-04-27 13:05:06,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-27 13:05:06,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-27 13:05:06,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-27 13:05:06,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-27 13:05:06,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-27 13:05:06,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-27 13:05:06,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-27 13:05:06,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-27 13:05:06,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-27 13:05:06,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-27 13:05:06,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-27 13:05:06,606 INFO L153 SettingsManager]: * Use SBE=true [2024-04-27 13:05:06,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-27 13:05:06,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-27 13:05:06,607 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-27 13:05:06,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-27 13:05:06,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-27 13:05:06,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-27 13:05:06,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-27 13:05:06,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-27 13:05:06,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-27 13:05:06,609 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-27 13:05:06,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-27 13:05:06,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-27 13:05:06,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-27 13:05:06,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-27 13:05:06,609 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-27 13:05:06,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-27 13:05:06,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-27 13:05:06,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-27 13:05:06,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-27 13:05:06,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-27 13:05:06,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-27 13:05:06,611 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-27 13:05:06,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-27 13:05:06,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-27 13:05:06,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-27 13:05:06,612 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-27 13:05:06,612 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-04-27 13:05:06,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-27 13:05:06,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-27 13:05:06,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-27 13:05:06,856 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-27 13:05:06,857 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-27 13:05:06,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy10.wvr.bpl [2024-04-27 13:05:06,858 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy10.wvr.bpl' [2024-04-27 13:05:06,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-27 13:05:06,920 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-27 13:05:06,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-27 13:05:06,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-27 13:05:06,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-27 13:05:06,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/1) ... [2024-04-27 13:05:06,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/1) ... [2024-04-27 13:05:06,944 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-27 13:05:06,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-27 13:05:06,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-27 13:05:06,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-27 13:05:06,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-27 13:05:06,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/1) ... [2024-04-27 13:05:06,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/1) ... [2024-04-27 13:05:06,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/1) ... [2024-04-27 13:05:06,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/1) ... [2024-04-27 13:05:06,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/1) ... [2024-04-27 13:05:06,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/1) ... [2024-04-27 13:05:06,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/1) ... [2024-04-27 13:05:06,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/1) ... [2024-04-27 13:05:06,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-27 13:05:06,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-27 13:05:06,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-27 13:05:06,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-27 13:05:06,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/1) ... [2024-04-27 13:05:06,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-27 13:05:06,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 13:05:06,998 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-04-27 13:05:07,019 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-04-27 13:05:07,042 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-27 13:05:07,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-27 13:05:07,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-27 13:05:07,042 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-27 13:05:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-27 13:05:07,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-27 13:05:07,043 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-27 13:05:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-27 13:05:07,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-27 13:05:07,043 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-27 13:05:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-27 13:05:07,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-27 13:05:07,043 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-27 13:05:07,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-27 13:05:07,044 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-27 13:05:07,044 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-27 13:05:07,091 INFO L241 CfgBuilder]: Building ICFG [2024-04-27 13:05:07,092 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-27 13:05:07,204 INFO L282 CfgBuilder]: Performing block encoding [2024-04-27 13:05:07,212 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-27 13:05:07,213 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-27 13:05:07,214 INFO L201 PluginConnector]: Adding new model easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:05:07 BoogieIcfgContainer [2024-04-27 13:05:07,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-27 13:05:07,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-27 13:05:07,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-27 13:05:07,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-27 13:05:07,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 01:05:06" (1/2) ... [2024-04-27 13:05:07,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e806ad and model type easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:05:07, skipping insertion in model container [2024-04-27 13:05:07,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:05:07" (2/2) ... [2024-04-27 13:05:07,223 INFO L112 eAbstractionObserver]: Analyzing ICFG easy10.wvr.bpl [2024-04-27 13:05:07,229 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-27 13:05:07,236 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-27 13:05:07,236 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-27 13:05:07,236 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-27 13:05:07,271 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-27 13:05:07,301 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-27 13:05:07,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-27 13:05:07,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 13:05:07,304 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-04-27 13:05:07,305 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-04-27 13:05:07,333 INFO L187 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-27 13:05:07,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 13:05:07,344 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-27 13:05:07,349 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;@6cf56ce4, 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-04-27 13:05:07,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-27 13:05:07,378 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-27 13:05:07,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 13:05:07,380 INFO L85 PathProgramCache]: Analyzing trace with hash -775351420, now seen corresponding path program 1 times [2024-04-27 13:05:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 13:05:07,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173326663] [2024-04-27 13:05:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 13:05:07,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 13:05:07,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 13:05:07,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173326663] [2024-04-27 13:05:07,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173326663] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-27 13:05:07,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-27 13:05:07,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-27 13:05:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200588146] [2024-04-27 13:05:07,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-27 13:05:07,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-27 13:05:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 13:05:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-27 13:05:07,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-27 13:05:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 13:05:07,604 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 13:05:07,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-04-27 13:05:07,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 13:05:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 13:05:07,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-27 13:05:07,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-27 13:05:07,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 13:05:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1274406660, now seen corresponding path program 2 times [2024-04-27 13:05:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 13:05:07,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43453958] [2024-04-27 13:05:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:07,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 13:05:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 13:05:07,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 13:05:07,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43453958] [2024-04-27 13:05:07,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43453958] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-27 13:05:07,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-27 13:05:07,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-27 13:05:07,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536607725] [2024-04-27 13:05:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-27 13:05:07,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-27 13:05:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 13:05:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-27 13:05:07,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-27 13:05:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 13:05:07,739 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 13:05:07,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-04-27 13:05:07,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 13:05:07,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 13:05:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 13:05:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 13:05:07,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-27 13:05:07,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-27 13:05:07,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 13:05:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1867163876, now seen corresponding path program 3 times [2024-04-27 13:05:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 13:05:07,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121979252] [2024-04-27 13:05:07,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:07,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 13:05:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 13:05:08,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 13:05:08,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121979252] [2024-04-27 13:05:08,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121979252] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-27 13:05:08,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-27 13:05:08,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-04-27 13:05:08,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520741733] [2024-04-27 13:05:08,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-27 13:05:08,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-04-27 13:05:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 13:05:08,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-04-27 13:05:08,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-04-27 13:05:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 13:05:08,285 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 13:05:08,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 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-04-27 13:05:08,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 13:05:08,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 13:05:08,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 13:05:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 269493041, now seen corresponding path program 1 times [2024-04-27 13:05:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:08,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:08,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:09,031 INFO L85 PathProgramCache]: Analyzing trace with hash -545511352, now seen corresponding path program 1 times [2024-04-27 13:05:09,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:09,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash 813672466, now seen corresponding path program 1 times [2024-04-27 13:05:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:09,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash -848974574, now seen corresponding path program 1 times [2024-04-27 13:05:09,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:09,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 13:05:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 13:05:09,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:09,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 13:05:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 13:05:09,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-27 13:05:09,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-27 13:05:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash -244965479, now seen corresponding path program 1 times [2024-04-27 13:05:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:09,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 996004856, now seen corresponding path program 1 times [2024-04-27 13:05:09,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:09,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:09,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash 811379560, now seen corresponding path program 1 times [2024-04-27 13:05:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:09,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash -617037319, now seen corresponding path program 1 times [2024-04-27 13:05:10,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1948287607, now seen corresponding path program 1 times [2024-04-27 13:05:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash -267373558, now seen corresponding path program 1 times [2024-04-27 13:05:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash 301354397, now seen corresponding path program 1 times [2024-04-27 13:05:10,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,178 INFO L85 PathProgramCache]: Analyzing trace with hash 752051819, now seen corresponding path program 1 times [2024-04-27 13:05:10,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1838770014, now seen corresponding path program 1 times [2024-04-27 13:05:10,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1167295685, now seen corresponding path program 1 times [2024-04-27 13:05:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1826427967, now seen corresponding path program 1 times [2024-04-27 13:05:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,284 INFO L85 PathProgramCache]: Analyzing trace with hash 784692230, now seen corresponding path program 1 times [2024-04-27 13:05:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1444344544, now seen corresponding path program 1 times [2024-04-27 13:05:10,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1825007798, now seen corresponding path program 1 times [2024-04-27 13:05:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,370 INFO L85 PathProgramCache]: Analyzing trace with hash -740666783, now seen corresponding path program 1 times [2024-04-27 13:05:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1485833685, now seen corresponding path program 1 times [2024-04-27 13:05:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1183796130, now seen corresponding path program 1 times [2024-04-27 13:05:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1444344540, now seen corresponding path program 1 times [2024-04-27 13:05:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1825007673, now seen corresponding path program 1 times [2024-04-27 13:05:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash -740662907, now seen corresponding path program 1 times [2024-04-27 13:05:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1485713528, now seen corresponding path program 1 times [2024-04-27 13:05:10,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash 784692235, now seen corresponding path program 1 times [2024-04-27 13:05:10,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1444344384, now seen corresponding path program 1 times [2024-04-27 13:05:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1825002836, now seen corresponding path program 1 times [2024-04-27 13:05:10,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash -740512959, now seen corresponding path program 1 times [2024-04-27 13:05:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1826427973, now seen corresponding path program 1 times [2024-04-27 13:05:10,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash 784692422, now seen corresponding path program 1 times [2024-04-27 13:05:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1444338586, now seen corresponding path program 1 times [2024-04-27 13:05:10,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1824823097, now seen corresponding path program 1 times [2024-04-27 13:05:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1167295692, now seen corresponding path program 1 times [2024-04-27 13:05:10,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1826428191, now seen corresponding path program 1 times [2024-04-27 13:05:10,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 784699181, now seen corresponding path program 1 times [2024-04-27 13:05:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1444129056, now seen corresponding path program 1 times [2024-04-27 13:05:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1948287590, now seen corresponding path program 1 times [2024-04-27 13:05:10,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash -267373043, now seen corresponding path program 1 times [2024-04-27 13:05:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash 301370363, now seen corresponding path program 1 times [2024-04-27 13:05:10,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:10,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:10,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash 752546766, now seen corresponding path program 1 times [2024-04-27 13:05:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash -617037301, now seen corresponding path program 1 times [2024-04-27 13:05:11,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:11,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1948287044, now seen corresponding path program 1 times [2024-04-27 13:05:11,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:11,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash -267356116, now seen corresponding path program 1 times [2024-04-27 13:05:11,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash 301895101, now seen corresponding path program 1 times [2024-04-27 13:05:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:11,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash 811379579, now seen corresponding path program 1 times [2024-04-27 13:05:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:11,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,441 INFO L85 PathProgramCache]: Analyzing trace with hash -617036724, now seen corresponding path program 1 times [2024-04-27 13:05:11,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:11,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1948269156, now seen corresponding path program 1 times [2024-04-27 13:05:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash -266801587, now seen corresponding path program 1 times [2024-04-27 13:05:11,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:11,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 13:05:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 13:05:11,577 INFO L85 PathProgramCache]: Analyzing trace with hash -219761300, now seen corresponding path program 1 times [2024-04-27 13:05:11,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:11,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 13:05:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 13:05:11,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 13:05:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 13:05:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 13:05:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 13:05:11,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-27 13:05:11,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-04-27 13:05:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 13:05:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 13:05:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-27 13:05:11,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2024-04-27 13:05:11,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-04-27 13:05:11,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-04-27 13:05:11,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-04-27 13:05:11,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-04-27 13:05:11,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-27 13:05:11,804 INFO L448 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-27 13:05:11,806 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-27 13:05:11,806 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-27 13:05:11,809 INFO L201 PluginConnector]: Adding new model easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:05:11 BasicIcfg [2024-04-27 13:05:11,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-27 13:05:11,809 INFO L158 Benchmark]: Toolchain (without parser) took 4888.79ms. Allocated memory was 303.0MB in the beginning and 383.8MB in the end (delta: 80.7MB). Free memory was 272.3MB in the beginning and 233.7MB in the end (delta: 38.6MB). Peak memory consumption was 119.3MB. Max. memory is 8.0GB. [2024-04-27 13:05:11,809 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.08ms. Allocated memory is still 188.7MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-27 13:05:11,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.22ms. Allocated memory is still 303.0MB. Free memory was 272.1MB in the beginning and 270.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-27 13:05:11,810 INFO L158 Benchmark]: Boogie Preprocessor took 12.05ms. Allocated memory is still 303.0MB. Free memory was 270.5MB in the beginning and 269.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-27 13:05:11,810 INFO L158 Benchmark]: RCFGBuilder took 255.28ms. Allocated memory is still 303.0MB. Free memory was 269.5MB in the beginning and 259.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-04-27 13:05:11,810 INFO L158 Benchmark]: TraceAbstraction took 4592.63ms. Allocated memory was 303.0MB in the beginning and 383.8MB in the end (delta: 80.7MB). Free memory was 257.8MB in the beginning and 233.7MB in the end (delta: 24.1MB). Peak memory consumption was 105.7MB. Max. memory is 8.0GB. [2024-04-27 13:05:11,811 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.08ms. Allocated memory is still 188.7MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.22ms. Allocated memory is still 303.0MB. Free memory was 272.1MB in the beginning and 270.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.05ms. Allocated memory is still 303.0MB. Free memory was 270.5MB in the beginning and 269.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.28ms. Allocated memory is still 303.0MB. Free memory was 269.5MB in the beginning and 259.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4592.63ms. Allocated memory was 303.0MB in the beginning and 383.8MB in the end (delta: 80.7MB). Free memory was 257.8MB in the beginning and 233.7MB in the end (delta: 24.1MB). Peak memory consumption was 105.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 25035, independent: 24888, independent conditional: 21221, independent unconditional: 3667, dependent: 147, dependent conditional: 127, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25035, independent: 24888, independent conditional: 21221, independent unconditional: 3667, dependent: 147, dependent conditional: 127, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25035, independent: 24888, independent conditional: 21221, independent unconditional: 3667, dependent: 147, dependent conditional: 127, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25035, independent: 24888, independent conditional: 21221, independent unconditional: 3667, dependent: 147, dependent conditional: 127, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25433, independent: 24888, independent conditional: 11597, independent unconditional: 13291, dependent: 545, dependent conditional: 311, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25433, independent: 24888, independent conditional: 2729, independent unconditional: 22159, dependent: 545, dependent conditional: 97, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25433, independent: 24888, independent conditional: 2729, independent unconditional: 22159, dependent: 545, dependent conditional: 97, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 587, independent: 579, independent conditional: 76, independent unconditional: 503, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 587, independent: 577, independent conditional: 0, independent unconditional: 577, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 28, dependent conditional: 7, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 25433, independent: 24309, independent conditional: 2653, independent unconditional: 21656, dependent: 537, dependent conditional: 95, dependent unconditional: 442, unknown: 587, unknown conditional: 78, unknown unconditional: 509] , Statistics on independence cache: Total cache size (in pairs): 587, Positive cache size: 579, Positive conditional cache size: 76, Positive unconditional cache size: 503, Negative cache size: 8, Negative conditional cache size: 2, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9082, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25433, independent: 24888, independent conditional: 11597, independent unconditional: 13291, dependent: 545, dependent conditional: 311, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25433, independent: 24888, independent conditional: 2729, independent unconditional: 22159, dependent: 545, dependent conditional: 97, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25433, independent: 24888, independent conditional: 2729, independent unconditional: 22159, dependent: 545, dependent conditional: 97, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 587, independent: 579, independent conditional: 76, independent unconditional: 503, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 587, independent: 577, independent conditional: 0, independent unconditional: 577, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 28, dependent conditional: 7, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 25433, independent: 24309, independent conditional: 2653, independent unconditional: 21656, dependent: 537, dependent conditional: 95, dependent unconditional: 442, unknown: 587, unknown conditional: 78, unknown unconditional: 509] , Statistics on independence cache: Total cache size (in pairs): 587, Positive cache size: 579, Positive conditional cache size: 76, Positive unconditional cache size: 503, Negative cache size: 8, Negative conditional cache size: 2, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9082 ], Independence queries for same thread: 0 - PositiveResult [Line: 79]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 82 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 3.6s, 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: 32, 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.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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: 2.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-04-27 13:05:11,828 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-04-27 13:05:12,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...